A New Method For The Three Dimensional Container Packing Problem

Lim, Andrew; Ying, Wang

A New Method For The Three Dimensional Container Packing Problem

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 342-349.

Abstract

A 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.

Andrew Lim, and Wang Ying. 2001. A New Method For The Three Dimensional Container Packing Problem. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 342–349. https://ijcai.org/proceedings/2001/49

@inproceedings{ijcai2001p49,
  title     = {A New Method For The Three Dimensional Container Packing Problem},
  author    = {Lim, Andrew and Ying, Wang},
  booktitle = {Proceedings of the Seventeenth International Joint Conference on
               Artificial Intelligence, {IJCAI-01}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {342--349},
  year      = {2001},
  url       = {https://ijcai.org/proceedings/2001/49},
}

TY  - CPAPER
TI  - A New Method For The Three Dimensional Container Packing Problem
AU  - Lim, Andrew
AU  - Ying, Wang
T2  - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2001
SP  - 342
EP  - 349
UR  - https://ijcai.org/proceedings/2001/49
ER  -