A multi-start random constructive heuristic for the container loading problem

This paper deals with the container loading problem which involves the selection of a subset of boxes, each box with a given volume, such that they fit in a single container and maximize its volume utilization subject to orientation and stability constraints. We propose a multi-start random constructive heuristic with a load arrangement that is based on maximal cuboids that fit in given empty spaces. Each instance is adaptively evaluated by a set of criteria, and at each step of the construction process one maximal cuboid is chosen probabilistically from a restricted list of candidates. In order to enhance the flexibility in the construction of a solution, a probabilistic reduction on such cuboids is allowed. Computational tests on several instances from the literature show that the proposed method performs better than other approaches.

[1]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[2]  J. A. George,et al.  A heuristic for packing boxes into a container , 1980, Comput. Oper. Res..

[3]  M. Meyer,et al.  A computer-based heuristic for packing pooled shipment containers , 1990 .

[4]  Eberhard E. Bischoff,et al.  A comparative evaluation of heuristics for container loading , 1990 .

[5]  Robert W. Haessler,et al.  Load planning for shipments of low density products , 1990 .

[6]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[7]  Reinaldo Morabito,et al.  An AND/OR-graph Approach to the Container Loading Problem , 1994 .

[8]  Bryan Kok Ann Ngoi,et al.  Applying spatial representation techniques to the container packing problem , 1994 .

[9]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[10]  M.S.W. Ratcliff,et al.  Loading pallets with non-identical items , 1995 .

[11]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[12]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[13]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[14]  A. M. Verweij,et al.  Multiple destination bin packing , 1996 .

[15]  Hermann Gehring,et al.  Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat , 1997 .

[16]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[17]  Kin Keung Lai,et al.  Container packing in a multi-customer delivering operation , 1998 .

[18]  Andreas Bortfeldt,et al.  A tabu search algorithm for weakly heterogeneous container loading problems , 1998 .

[19]  Eberhard E. Bischoff,et al.  Weight distribution considerations in container loading , 1999, Eur. J. Oper. Res..

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

[21]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[22]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[23]  Michael Eley,et al.  Solving container loading problems by block arrangement , 2002, Eur. J. Oper. Res..

[24]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[25]  J. Z. Cha,et al.  Research on solution to complex container loading problem based on genetic algorithm , 2002, Proceedings. International Conference on Machine Learning and Cybernetics.

[26]  Andrew Lim,et al.  A multi-faced buildup algorithm for three-dimensional packing problems , 2003 .

[27]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[28]  Jarampom Hassamontr.  On decomposing 3D packing problems in wooden furniture industry , 2003, Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694).

[29]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[30]  David Pisinger,et al.  Guided Local Search for the Three-Dimensional Bin-Packing Problem , 2003, INFORMS J. Comput..

[31]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[32]  Chen-Fu Chien,et al.  A container packing support system for determining and visualizing container packing patterns , 2004, Decis. Support Syst..

[33]  Reinaldo Morabito,et al.  Refinamentos na heurística de George e Robinson para o problema do carregamento de caixas dentro de contêineres , 2004 .

[34]  D. Mack,et al.  A parallel hybrid local search algorithm for the container loading problem , 2004 .

[35]  Mhand Hifi.  Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study , 2004, Comput. Oper. Res..

[36]  Andrew Lim,et al.  The container loading problem , 2005, SAC '05.

[37]  A. Moura,et al.  A GRASP approach to the container-loading problem , 2005, IEEE Intelligent Systems.

[38]  E. E. Bischoff,et al.  Three-dimensional packing of items with limited load bearing strength , 2006, Eur. J. Oper. Res..

[39]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .