Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.omega.2003.08.004
DC Field | Value | |
---|---|---|
dc.title | A multi-faced buildup algorithm for three-dimensional packing problems | |
dc.contributor.author | Lim, A. | |
dc.contributor.author | Rodrigues, B. | |
dc.contributor.author | Wang, Y. | |
dc.date.accessioned | 2013-07-04T07:32:37Z | |
dc.date.available | 2013-07-04T07:32:37Z | |
dc.date.issued | 2003 | |
dc.identifier.citation | Lim, 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.issn | 03050483 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/39042 | |
dc.description.abstract | This 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.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.omega.2003.08.004 | |
dc.source | Scopus | |
dc.subject | Combinatorial optimization | |
dc.subject | Heuristics | |
dc.subject | Logistics | |
dc.subject | Packing | |
dc.type | Article | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1016/j.omega.2003.08.004 | |
dc.description.sourcetitle | Omega | |
dc.description.volume | 31 | |
dc.description.issue | 6 | |
dc.description.page | 471-481 | |
dc.description.coden | OMEGA | |
dc.identifier.isiut | 000186503000005 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.