Show simple item record

dc.contributor.authorHe, Yaohua
dc.contributor.authorWu, Yong
dc.date.accessioned2017-05-03T13:51:46Z
dc.date.available2017-05-03T13:51:46Z
dc.date.issued2013
dc.date.modified2014-09-11T01:58:26Z
dc.identifier.issn0925-5001
dc.identifier.doi10.1007/s10898-012-9948-6
dc.identifier.urihttp://hdl.handle.net/10072/52058
dc.description.abstractPacking 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.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent936646 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeUnited States
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom1187
dc.relation.ispartofpageto1215
dc.relation.ispartofissue3
dc.relation.ispartofjournalJournal of Global Optimization
dc.relation.ispartofvolume56
dc.rights.retentionY
dc.subject.fieldofresearchApplied mathematics
dc.subject.fieldofresearchNumerical and computational mathematics
dc.subject.fieldofresearchTheory of computation
dc.subject.fieldofresearchcode4901
dc.subject.fieldofresearchcode4903
dc.subject.fieldofresearchcode4613
dc.titlePacking non-identical circles within a rectangle with open length
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - 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.issued2013
gro.hasfulltextFull Text
gro.griffith.authorWu, Yong


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record