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

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.

[1]  Teodor Gabriel Crainic,et al.  Extreme Point-Based Heuristics for Three-Dimensional Bin Packing , 2008, INFORMS J. Comput..

[2]  Hongfeng Wang,et al.  A hybrid genetic algorithm for 3D bin packing problems , 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

[3]  Edward G. Coffman,et al.  Dynamic Bin Packing , 1983, SIAM J. Comput..

[4]  Mauricio G. C. Resende,et al.  A biased random key genetic algorithm for 2D and 3D bin packing problems , 2013 .

[5]  Korhan Karabulut,et al.  A Hybrid Genetic Algorithm for Packing in 3D with Deepest Bottom Left with Fill Method , 2004, ADVIS.

[6]  Daniele Vigo,et al.  Heuristic algorithms for the three-dimensional bin packing problem , 2002, Eur. J. Oper. Res..

[7]  David Simchi-Levi,et al.  Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures , 1994, Oper. Res..

[8]  Ramón Alvarez-Valdés,et al.  A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing , 2010, Ann. Oper. Res..

[9]  Guntram Scheithauer.  Algorithms for the Container Loading Problem , 1992 .

[10]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

[11]  Leah Epstein,et al.  Dynamic multi-dimensional bin packing , 2010, J. Discrete Algorithms.

[12]  Hussein A. Abbass,et al.  A grid-based heuristic for two-dimensional packing problems , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[13]  Changhe Li,et al.  Benchmarking Dynamic Three-Dimensional Bin Packing Problems Using Discrete-Event Simulation , 2016, EvoApplications.

[14]  Daniele Vigo,et al.  Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem , 2007, TOMS.

[15]  Kay Chen Tan,et al.  On solving multiobjective bin packing problems using evolutionary particle swarm optimization , 2008, Eur. J. Oper. Res..

[16]  K. Lai,et al.  Developing a simulated annealing algorithm for the cutting stock problem , 1997 .

[17]  Hongfeng Wang,et al.  A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem , 2012, Appl. Math. Comput..

[18]  Kathryn A. Dowsland,et al.  A comparative review of 3D container loading algorithms , 2016, Int. Trans. Oper. Res..

[19]  Benoît Montreuil,et al.  Toward a Physical Internet: meeting the global logistics sustainability grand challenge , 2011, Logist. Res..

[20]  Mauricio G. C. Resende,et al.  A parallel multi-population biased random-key genetic algorithm for a container loading problem , 2012, Comput. Oper. Res..

[21]  Georges M. Fadel,et al.  A Fast and Efficient Compact Packing Algorithm for Free-Form Objects , 2008, DAC 2008.

[22]  Reinaldo Morabito,et al.  Three-dimensional container loading models with cargo stability and load bearing constraints , 2012, Comput. Oper. Res..

[23]  Klaus Jansen,et al.  Fully Dynamic Bin Packing Revisited , 2015, APPROX-RANDOM.

[24]  Teodor Gabriel Crainic,et al.  The Generalized Bin Packing Problem , 2012 .

[25]  Søren Gram Christensen,et al.  Container loading with multi-drop constraints , 2009, Int. Trans. Oper. Res..

[26]  Ilkyeong Moon,et al.  Hybrid genetic algorithms for the three-dimensional multiple container packing problem , 2015 .

[27]  Ilkyeong Moon,et al.  Container packing problem with balance constraints , 2014, OR Spectr..

[28]  Andreas Bortfeldt,et al.  Constraints in container loading - A state-of-the-art review , 2013, Eur. J. Oper. Res..

[29]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[30]  Xueping Li,et al.  A hybrid differential evolution algorithm for multiple container loading problem with heterogeneous containers , 2015, Comput. Ind. Eng..