Please use this identifier to cite or link to this item:
|Title:||A global search framework for practical three-dimensional packing with variable carton orientations|
|Authors:||He, Y. |
De Souza, R.
|Citation:||He, 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|
|Abstract:||This 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.|
|Source Title:||Computers and Operations Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 17, 2018
WEB OF SCIENCETM
checked on Aug 8, 2018
checked on Jul 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.