Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/77968
DC FieldValue
dc.titleA new method for the three dimensional container packing problem
dc.contributor.authorLim, A.
dc.contributor.authorYing, W.
dc.date.accessioned2014-07-04T03:10:55Z
dc.date.available2014-07-04T03:10:55Z
dc.date.issued2001
dc.identifier.citationLim, A.,Ying, W. (2001). A new method for the three dimensional container packing problem. IJCAI International Joint Conference on Artificial Intelligence : 342-347. ScholarBank@NUS Repository.
dc.identifier.issn10450823
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/77968
dc.description.abstractA new algorithm for solving the three dimensional container packing problem is proposed in this paper. This new algorithm deviates from the traditional approach of wall building and layering. It uses the concept of "building growing" from multiple sides of the container. We tested our method using all 760 test cases from the OR-Library. Experimental results indicate that the new algorithm is able to achieve an average packing utilization of more than 87%. This is better than the results reported in the literature.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleIJCAI International Joint Conference on Artificial Intelligence
dc.description.page342-347
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check


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