Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.cor.2011.12.007
DC FieldValue
dc.titleA global search framework for practical three-dimensional packing with variable carton orientations
dc.contributor.authorHe, Y.
dc.contributor.authorWu, Y.
dc.contributor.authorDe Souza, R.
dc.date.accessioned2014-12-02T08:59:21Z
dc.date.available2014-12-02T08:59:21Z
dc.date.issued2012-10
dc.identifier.citationHe, Y., Wu, Y., De Souza, R. (2012-10). A global search framework for practical three-dimensional packing with variable carton orientations. Computers and Operations Research 39 (10) : 2395-2414. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cor.2011.12.007
dc.identifier.issn03050548
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/114710
dc.description.abstractThis article aims to tackle a practical three-dimensional packing problem, where a number of cartons of diverse sizes are to be packed into a bin with fixed length and width but open height. Each carton is allowed to be packed in any one of the six orientations, and the carton edges are parallel to the bin edges. The allowance of variable carton orientations exponentially increases the solution space and makes the problem very challenging to solve. This study first elaborately devises the packing procedure, which converts an arbitrary sequence of cartons into a compact packing solution and subsequently develops an improved genetic algorithm (IGA) to evolve a set of solutions. Moreover, a novel global search framework (GSF), utilizing the concept of evolutionary gradient, is proposed to further improve the solution quality. Numerical experiments indicate that IGA provides faster and better results and GSF demonstrates its superior performance, especially in solving relative large-size and heterogeneous instances. Applying the proposed algorithms to some benchmarking cases of the three-dimensional strip packing problem also indicates that the algorithms are robust and effective compared to existing methods in the literature. © 2011 Elsevier Ltd. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.cor.2011.12.007
dc.sourceScopus
dc.subjectEvolutionary gradient
dc.subjectGenetic algorithm
dc.subjectGlobal search
dc.subjectLoading
dc.subjectPacking
dc.subjectThree-dimensional
dc.typeArticle
dc.contributor.departmentSOLAR ENERGY RESEARCH INST OF S'PORE
dc.description.doi10.1016/j.cor.2011.12.007
dc.description.sourcetitleComputers and Operations Research
dc.description.volume39
dc.description.issue10
dc.description.page2395-2414
dc.description.codenCMORA
dc.identifier.isiut000301313900012
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

17
checked on Jan 13, 2022

WEB OF SCIENCETM
Citations

12
checked on Jan 13, 2022

Page view(s)

170
checked on Jan 13, 2022

Google ScholarTM

Check

Altmetric


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