Applying spatial representation techniques to the container packing problem. (English) Zbl 0905.90145

Summary: This paper describes an efficient method of packing boxes into a container using a unique spatial representation technique. Unlike other algorithms, the packing algorithm in this paper is not constrained by the physical packing sequence, that is, back to front, or bottom to top. This extra flexibility allows the program to pack the boxes more efficiently. The packing plan can be generated to suit the actual packing sequence. The program is implemented on an IBM PC and a comparison has been made with a similar software. The results, in terms of packing efficiency and packing time, are promising.


90C27 Combinatorial optimization
Full Text: DOI


[1] BISCHOFF E., Operational Research Society Journal 33 pp 271– (1982)
[2] DOI: 10.1016/0377-2217(90)90362-F · Zbl 0684.90083
[3] DOI: 10.1016/0377-2217(92)90288-K · Zbl 0825.90355
[4] DOI: 10.1080/00207549108948039
[5] DOI: 10.1016/0377-2217(90)90363-G · Zbl 0684.90084
[6] DOI: 10.1016/0305-0548(80)90001-5
[7] KOVEL W. F., Proceedings of the Third International Conference of Automated Material Handling pp 247– (1986)
[8] LOH T. H., Proceedings of the Conference of Industrial Automation pp 115– (1992)
[9] NGOI B. K. A., Journal of International Advance Manufacturing Technology 8 (1993)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.