Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.omega.2003.08.004
DC FieldValue
dc.titleA multi-faced buildup algorithm for three-dimensional packing problems
dc.contributor.authorLim, A.
dc.contributor.authorRodrigues, B.
dc.contributor.authorWang, Y.
dc.date.accessioned2013-07-04T07:32:37Z
dc.date.available2013-07-04T07:32:37Z
dc.date.issued2003
dc.identifier.citationLim, A., Rodrigues, B., Wang, Y. (2003). A multi-faced buildup algorithm for three-dimensional packing problems. Omega 31 (6) : 471-481. ScholarBank@NUS Repository. https://doi.org/10.1016/j.omega.2003.08.004
dc.identifier.issn03050483
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39042
dc.description.abstractThis paper provides a new approach to solving the three-dimensional packing problem. The heuristic developed uses a multi-faced buildup technique in the packing procedure for which there is no requirement for packed boxes to form flat layers. The basic algorithm is then augmented by a Look-ahead strategy. Experimental results indicate an average packing utilization of 87.8% which improve current benchmarks significantly. The new approaches given here add to heuristics currently available. © 2003 Elsevier Ltd. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.omega.2003.08.004
dc.sourceScopus
dc.subjectCombinatorial optimization
dc.subjectHeuristics
dc.subjectLogistics
dc.subjectPacking
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1016/j.omega.2003.08.004
dc.description.sourcetitleOmega
dc.description.volume31
dc.description.issue6
dc.description.page471-481
dc.description.codenOMEGA
dc.identifier.isiut000186503000005
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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