Three-dimensional packing of items with limited load bearing strength

Abstract A new heuristic approach is put forward for tackling container loading problems where the cargo involved has varying degrees of load bearing strength. In such cases the placement rules must ensure that the weight resting on an item remains below the maximum it can withstand without suffering crushing damage. The construction heuristic proposed is embedded in a search algorithm which seeks to optimise the parameter settings of the procedure. Limiting the time required to produce a good solution and the amount of technical expertise needed by the user are key considerations. The approach is evaluated in a series of tests against benchmarks from the literature. The results demonstrate that it outperforms other approaches which have been suggested for this type of problem and that it also performs well on problems where load bearing strength is not an issue. Potentially useful extensions of the work are discussed.

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

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

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

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

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

[6]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

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

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

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

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

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

[12]  Eberhard E. Bischoff,et al.  Allowing for weight considerations in container loading , 1998 .

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

[14]  Hermann Gehring,et al.  A Parallel Genetic Algorithm for Solving the Container Loading Problem , 2002 .

[15]  Jan Riehme,et al.  An efficient approach for the multi-pallet loading problem , 2000, Eur. J. Oper. Res..

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

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