论文信息 - Generating Stable Loading Patterns for Pallet Loading Problems

Generating Stable Loading Patterns for Pallet Loading Problems

This paper describes an integer programming model for generating stable loading patterns for the Pallet Loading Problem. The algorithm always gives optimal or near-optimal utilization of the pallet area and fulfills stability criteria for 98% of the test cases.

Kenneth Holmström | Waldemar Kocjan

[1] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

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

[3] John E. Beasley,et al. An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[4] Guntram Scheithauer,et al. The G4-Heuristic for the Pallet Loading Problem , 1996 .

[5] Adrian Smith,et al. An Algorithm to Optimize the Layout of Boxes in Pallets , 1980 .

[6] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

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

[8] E. Bischoff,et al. An Application of the Micro to Product Design and Distribution , 1982 .

[9] Ramón Alvarez-Valdés,et al. A branch-and-cut algorithm for the pallet loading problem , 2005, Comput. Oper. Res..

[10] J. C. Herz,et al. Recursive computational procedure for two-dimensional stock cutting , 1972 .

[11] Fuh-Hwa F. Liu,et al. A three-dimensional pallet loading method for single-size boxes , 1997 .

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