Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region / Y. G. Stoyan in Journal of the operational research society (JORS), Vol. 63 N° 3 (Mars 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 379–391 Titre : Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region Type de document : texte imprimé Auteurs : Y. G. Stoyan, Auteur ; M. V. Zlotnik, Auteur ; A. M. Chugay, Auteur Année de publication : 2012 Article en page(s) : pp. 379–391 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Cutting stock problem Optimization Non-linear programming Index. décimale : 001.424 Résumé : This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Φ-function technique, a mathematical model of the problem is constructed and its characteristics are investigated. Based on the characteristics, a solution approach to the problem is offered. The approach includes the following methods: an optimization method by groups of variables to construct starting points, a modification of the Zoutendijk feasible direction method to search for local minima and a special non-exhaustive search of local minima to find an approximation to a global minimum. A number of numerical results are given. The numerical results are compared with the best known ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201141a.html [article] Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region [texte imprimé] / Y. G. Stoyan, Auteur ; M. V. Zlotnik, Auteur ; A. M. Chugay, Auteur . - 2012 . - pp. 379–391. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 3 (Mars 2012) . - pp. 379–391 Mots-clés : Cutting stock problem Optimization Non-linear programming Index. décimale : 001.424 Résumé : This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Φ-function technique, a mathematical model of the problem is constructed and its characteristics are investigated. Based on the characteristics, a solution approach to the problem is offered. The approach includes the following methods: an optimization method by groups of variables to construct starting points, a modification of the Zoutendijk feasible direction method to search for local minima and a special non-exhaustive search of local minima to find an approximation to a global minimum. A number of numerical results are given. The numerical results are compared with the best known ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n3/abs/jors201141a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire