Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region
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.
Volume (Year): 63 (2012)
Issue (Month): 3 (March)
|Contact details of provider:|| Web page: http://www.palgrave-journals.com/ |
|Order Information:|| Postal: Palgrave Macmillan Journals, Subscription Department, Houndmills, Basingstoke, Hampshire RG21 6XS, UK|
Web: http://www.palgrave-journals.com/pal/subscribe/index.html Email:
When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:63:y:2012:i:3:p:379-391. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Daniel Foley)
If references are entirely missing, you can add them using this form.