An analytical model for the container loading problem. (English) Zbl 0927.90087
Summary: This paper considers the problem of loading containers with cartons of non-uniform size and presents an analytical model to capture the mathematical essence of the problem. The container loading problem is formulated as a zero-one mixed integer programming model. It includes the consideration of multiple containers, multiple carton sizes, carton orientations, and the overlapping of cartons in a container. This model is then extended to formulate some special container loading problems. Numerical examples are used to validate the model.
Keywords:
three-dimensional palletization; cartons of non-uniform size; container loading; zero-one mixed integer programmingReferences:
| [1] | Beasley, J. E., An exact two-dimensional non-guillotine cutting tree search procedure, Operations Research, 49-64 (1985) · Zbl 0569.90038 |
| [2] | Bischoff, E.; Dowsland, W. B., An application of the microcomputer to product design and distribution, Journal of the Operational Research Society, 33, 271-280 (1982) |
| [3] | Bischoff, E. E.; Marriott, M. D., A comparative evaluation of heuristics for container loading, European Journal of Operational Research, 44, 267-276 (1990) · Zbl 0684.90083 |
| [4] | Chen, C.; Sarin, S.; Ram, B., The pallet packing problem for non-uniform box sizes, International Journal of Production Research, 29, 10, 1963-1968 (1991) · Zbl 0729.90571 |
| [5] | Christofides, N.; Whitlock, C., An algorithm for two dimensional cutting problems, Operations Research, 25, 30-44 (1977) · Zbl 0369.90059 |
| [6] | Dagli, C., Cutting stock problem: Combined use of heuristics and optimization methods, (Mital, A., Recent Developments in Production Research (1988), Elsevier Science Publishers: Elsevier Science Publishers Amsterdam) |
| [7] | Dowsland, K., Efficient automated pallet loading, European Journal of Operational Research, 44, 232-258 (1990) · Zbl 0684.90078 |
| [8] | Dowsland, K. A., A combined data-base and algorithmic approach to the pallet loading problem, Journal of the Operational Research Society, 38, 4, 341-345 (1987) · Zbl 0608.90077 |
| [9] | Dowsland, K. A., An exact algorithm for the pallet loading problem, European Journal of Operational Research, 31, 78-84 (1987) · Zbl 0614.90084 |
| [10] | Dowsland, W. B., Three-dimensional packing-solution approaches and heuristic development, International Journal of Production Research, 29, 8, 1673-1685 (1991) |
| [11] | Dyckhoff, H., A typology of cutting and packing problems, European Journal of Operational Research, 44, 145-159 (1990) · Zbl 0684.90076 |
| [12] | Farley, A., Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, OR Spektrum, 10, 113-123 (1988) · Zbl 0642.90050 |
| [13] | George, J. A.; Robinson, D. F., A heuristic for packing boxes into a container, Computers and Operations Research, 7, 147-156 (1980) |
| [14] | Gehring, H.; Menschner, K.; Meyer, M., A computer-based heuristic for packing pooled shipment containers, European Journal of Operational Research, 44, 277-288 (1990) · Zbl 0684.90084 |
| [15] | Gilmore, P. C.; Gomory, R. E., Multistage cutting problems of two or more dimensions, Operations Research, 13, 94-120 (1965) · Zbl 0128.39601 |
| [16] | Gilmore, P. C.; Gomory, R. E., The theory and computation of knapsack functions, Operations Research, 14, 1045-1075 (1966) · Zbl 0173.21502 |
| [17] | Gilmore, J. F.; Williams, E.; du Fossat, E.; Bohlander, R.; Elling, G., An expert system approach to palletizing unequal-sized containers, SPIE 1095, 933-942 (1989), (Applications of Artificial Intelligence VII) |
| [18] | Haessler, R. W.; Talbot, F. B., Loading planning for shipments of low density products, European Journal of Operational Research, 44, 287-299 (1990) · Zbl 0684.90085 |
| [19] | Han, C. P.; Knott, K.; Egbelu, P. J., A heuristic approach to the three-dimensional cargo-loading problem, International Journal of Production Research, 27, 5, 757-774 (1989) · Zbl 0667.90075 |
| [20] | Herz, J. C., A recursive computing procedure for two dimensional stock cutting, IBM Journal of Research and Development, 16, 462-469 (1972) · Zbl 0265.90057 |
| [21] | Hodgson, T. J., A combined approach to the pallet loading problem, IIE Transactions, 14, 3, 175-182 (1982) |
| [22] | Smith, A.; DeCani, P., An algorithm to optimize the layout of boxes in pallets, Journal of the Operational Research Society, 31, 573-578 (1980) |
| [23] | Steudel, H., Generating pallet loading patterns: A special case for the two-dimensional cutting stock problem, Management Science, 25, 10, 997-1004 (1979) · Zbl 0465.90051 |
| [24] | Vasko, F., A computational improvement to Wang’s two-dimensional cutting stock algorithm, Computers and Industrial Engineering, 16, 1, 109-115 (1989) |
| [25] | Wang, P., Two algorithms for constrained two dimensional cutting stock problems, Operations Research, 31, 573-586 (1983) · Zbl 0517.90093 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
