Please use this identifier to cite or link to this item:
https://doi.org/10.1007/s10898-012-9948-6
DC Field | Value | |
---|---|---|
dc.title | Packing non-identical circles within a rectangle with open length | |
dc.contributor.author | He, Y. | |
dc.contributor.author | Wu, Y. | |
dc.date.accessioned | 2014-12-02T08:59:42Z | |
dc.date.available | 2014-12-02T08:59:42Z | |
dc.date.issued | 2013-07 | |
dc.identifier.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 | |
dc.identifier.issn | 09255001 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/114747 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s10898-012-9948-6 | |
dc.source | Scopus | |
dc.subject | Combinatorial optimization | |
dc.subject | Cutting and packing | |
dc.subject | Decomposition | |
dc.subject | Genetic algorithm | |
dc.subject | Heuristic | |
dc.type | Conference Paper | |
dc.contributor.department | SOLAR ENERGY RESEARCH INST OF S'PORE | |
dc.description.doi | 10.1007/s10898-012-9948-6 | |
dc.description.sourcetitle | Journal of Global Optimization | |
dc.description.volume | 56 | |
dc.description.issue | 3 | |
dc.description.page | 1187-1215 | |
dc.description.coden | JGOPE | |
dc.identifier.isiut | 000321260700024 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.