Please use this identifier to cite or link to this item: https://doi.org/10.1007/s10898-012-9948-6
Title: Packing non-identical circles within a rectangle with open length
Authors: He, Y. 
Wu, Y.
Keywords: Combinatorial optimization
Cutting and packing
Decomposition
Genetic algorithm
Heuristic
Issue Date: Jul-2013
Citation: He, Y., Wu, Y. (2013-07). Packing non-identical circles within a rectangle with open length. Journal of Global Optimization 56 (3) : 1187-1215. ScholarBank@NUS Repository. https://doi.org/10.1007/s10898-012-9948-6
Abstract: Packing non-identical circles inside a rectangle witnesses a wide range of industrial applications. However, the non-convex constraints in this problem make it intractable using exact analytical approaches. Even via heuristic methods, the solution time for industrial-scale instances sometimes is too long to be acceptable. This article aims to challenge the existing methods for the benchmark instances. The most significant contributions of this work are: firstly, we proposed three types of packing positions for selection and used human intelligence to convert an arbitrary circle sequence into a feasible compact layout; secondly, diverse position selection criteria have been tested, and it is found that the criterion commonly used in the literature is not the best; thirdly, the traditional genetic algorithm is adapted with lower crossover rate but higher mutation rate particularly, and a minor-adjustment operator with the purpose of exploring the neighborhood of the current best solutions is introduced. © 2012 Springer Science+Business Media, LLC.
Source Title: Journal of Global Optimization
URI: http://scholarbank.nus.edu.sg/handle/10635/114747
ISSN: 09255001
DOI: 10.1007/s10898-012-9948-6
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.