dc.contributor.author | He, Yaohua | |
dc.contributor.author | Wu, Yong | |
dc.date.accessioned | 2017-05-03T13:51:46Z | |
dc.date.available | 2017-05-03T13:51:46Z | |
dc.date.issued | 2013 | |
dc.date.modified | 2014-09-11T01:58:26Z | |
dc.identifier.issn | 0925-5001 | |
dc.identifier.doi | 10.1007/s10898-012-9948-6 | |
dc.identifier.uri | http://hdl.handle.net/10072/52058 | |
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. | |
dc.description.peerreviewed | Yes | |
dc.description.publicationstatus | Yes | |
dc.format.extent | 936646 bytes | |
dc.format.mimetype | application/pdf | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.publisher.place | United States | |
dc.relation.ispartofstudentpublication | N | |
dc.relation.ispartofpagefrom | 1187 | |
dc.relation.ispartofpageto | 1215 | |
dc.relation.ispartofissue | 3 | |
dc.relation.ispartofjournal | Journal of Global Optimization | |
dc.relation.ispartofvolume | 56 | |
dc.rights.retention | Y | |
dc.subject.fieldofresearch | Applied mathematics | |
dc.subject.fieldofresearch | Numerical and computational mathematics | |
dc.subject.fieldofresearch | Theory of computation | |
dc.subject.fieldofresearchcode | 4901 | |
dc.subject.fieldofresearchcode | 4903 | |
dc.subject.fieldofresearchcode | 4613 | |
dc.title | Packing non-identical circles within a rectangle with open length | |
dc.type | Journal article | |
dc.type.description | C1 - Articles | |
dc.type.code | C - Journal Articles | |
gro.rights.copyright | © 2013 Springer US. This is an electronic version of an article published in Journal of Global Optimization, July 2013, Volume 56, Issue 3, pp 1187-1215. Journal of Global Optimization is available online at: http://link.springer.com/ with the open URL of your article. | |
gro.date.issued | 2013 | |
gro.hasfulltext | Full Text | |
gro.griffith.author | Wu, Yong | |