An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environments and the Physical Internet

• Published in: Applications of Evolutionary Computation Vol. 10200; pp. 140 - 155
• Main Authors: Ha, Chi Trung, Nguyen, Trung Thanh, Bui, Lam Thu, Wang, Ran
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2017; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: 3D bin packing problem; 3D container loading problem; Benchmark problems; Dynamic environments; Dynamic optimization; Online optimization; Online packing heuristic; Physical internet
• ISBN: 9783319557915; 3319557912
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-55792-2_10

In this paper, we consider the online three-dimensional container loading problem. We develop a novel online packing algorithm to solve the three-dimensional bin packing problem in the online case where items are not known well in advance and they have to be packed in real-time when they arrive. This is relevant in many real-world scenarios such as automated cargo loading in warehouses. This is also relevant in the new logistics model of Physical Internet. The effectiveness of the online packing heuristic is evaluated on a set of generated data. The experimental results show that the algorithm could solve the 3D container loading problems in online fashion and is competitive against other algorithms both in the terms of running time, space utilization and the number of bins.