Issues in the development of approaches to container loading

The paper argues that existing approaches to container loading problems are each applicable only to a narrow part of the spectrum of situations encountered in practice and that there are many scenarios for which there are no adequate methodologies. A number of examples are given. Two approaches aimed at addressing some of the present limitations are discussed. One is designed to produce stable, evenly distributed packing patterns; the other caters for multi-drop loads. A comprehensive performance analysis using both published and randomly generated test problems is presented. The procedure used to create the latter is described in full to enable replication. It is shown that the two methods, when combined, provide a powerful and versatile tool.

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

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

[3]  W. Press,et al.  Numerical Recipes in Fortran: The Art of Scientific Computing.@@@Numerical Recipes in C: The Art of Scientific Computing. , 1994 .

[4]  Eberhard E. Bischoff.  Stability aspects of pallet loading , 1991 .

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

[6]  Pius J. Egbelu,et al.  A heuristic approach to the three-dimensional cargo-loading problem , 1989 .

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

[8]  John Y. Cheung,et al.  Hybrid genetic algorithm for container packing in three dimensions , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

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

[10]  Nancy J. Ivancic.  An Integer Programming Based Heuristic Approach to the Three Dimensional Packing Problem , 1988 .

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

[12]  E. E. Bischoff,et al.  Loading Multiple Pallets , 1995 .

[13]  Gerhard Wäscher,et al.  CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem , 1995 .

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

[15]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

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

[17]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[18]  J. A. George,et al.  A Method for Solving Container Packing for a Single Size of Box , 1992 .

[19]  W. B. Dowsland,et al.  Practical Considerations of the Pallet-Loading Problem , 1985 .

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