Abstract
The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous rectangular boxes into a single container. Both algorithms adopt the concept of building layers on one face of the container, but the first heuristic determines the layer face once for all, while the second treats the remaining container space as a reduced-sized container after one layer is loaded and, hence, selects the layer face dynamically. To handle the layout design problem at a layer’s level, a block-based 2D packing procedure is also developed. Numerical studies demonstrate the efficiency of the heuristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alvarez-Valdes, R., Parreno, F., Tamarit, J.M., 2005. A tabu search algorithm for the pallet loading problem. OR Spectrum, 27:43–61. [doi:10.1007/s00291-004-0183-5]
Birgin, E.G., Morabito, R., Nishihara, F.H., 2005. A note on an L-approach for solving the manufacturer’s pallet loading problem. J. Operat. Res. Soc., 56:1448–1451. [doi:10.1057/palgrave.jors.2601960]
Bischoff, E.E., Ratcliff, M.S., 1995. Issues in the development of approaches to container loading. OMEGA-Int. J. Manag. Sci., 23(4):377–390. [doi:10.1016/0305-0483(95)00015-G]
Bischoff, E.E., 2006. 3D packing of items with limited load bearing strength. Eur. J. Operat. Res., 168(3):952–966. [doi:10.1016/j.ejor.2004.04.037]
Bortfeldt, A., Gehring, H., 2001. A hybrid genetic algorithm for the container loading problem. Eur. J. Operat. Res., 131(1):143–161. [doi:10.1016/S0377-2217(00)00055-2]
Bortfeldt, A., Gehring, H., Mack, D., 2003. A parallel tabu search algorithm for solving the container loading problem. Parallel Computing, 29(5):641–662. [doi:10.1016/S0167-8191(03)00047-4]
Davies, A.P., Bischoff, E.E., 1999. Weight distribution considerations in container loading. Eur. J. Operat. Res., 114(3):509–527. [doi:10.1016/S0377-2217(98)00139-8]
De Cani, P., 1978. A note on the two-dimensional rectangular cutting-stock problem. J. Operat. Res. Soc., 29(7):703–706. [doi:10.2307/3009849]
Dyckhoff, H., 1990. A topology of cutting and packing problems. Eur. J. Operat. Res., 44(2):145–159. [doi:10.1016/0377-2217(90)90350-K]
George, J.A., Robinson, D.F., 1980. A heuristic for packing boxes into a container. Comput. Operat. Res., 7(3):147–156. [doi:10.1016/0305-0548(80)90001-5]
Jin, Z., Ohno, K., Du, J., 2004. An efficient approach for the three-dimensional container packing problem with practical constraints. Asia-Pacific J. Operat. Res., 21(3):279–295. [doi:10.1142/S0217595904000254]
Keller, G., 2005. Statistics for Management and Economics (7th Ed). South-Western College, Toronto, p.434–444.
Li, B., Ye, H.Z., 2002. A heuristic layout restriction algorithm for solving two-dimensional rectangular layout loading problems. J. Southwest Jiao Tong Univ., 37(4):443–447 (in Chinese).
Loh, T.H., Nee, A.Y.C., 1992. A Packing Algorithm for Hexahedral Boxes. Proc. Conf. of Industrial Automation, p.115–126.
Mack, D., Bortfeldt, A., Gehring, H., 2004. A parallel hybrid local search algorithm for the container loading problem. Int. Trans. Operat. Res., 11(5):511–533. [doi:10.1111/j.1475-3995.2004.00474.x]
Moura, A., Oliveira, J.F., 2005. A GRASP approach to the container-loading problem. IEEE Intell. Syst., 20(4):50–57. [doi:10.1109/MIS.2005.57]
Ngoi, B.K.A., Tay, M.L., Chua, E.S., 1994. Applying spatial representation techniques to the container packing problem. Int. J. Prod. Res., 32(1):111–123. [doi:10.1080/00207549408956919]
Pisinger, D., 2002. Heuristics for the container loading problem. Eur. J. Operat. Res., 141(2):382–392. [doi:10.1016/S0377-2217(02)00132-7]
Pureza, V., Morabito, R., 2005. Some experiments with a simple tabu search algorithm for the manufacturer’s pallet loading problem. Computers and Operations Research, 33(3):804–819. [doi:10.1016/j.cor.2004.08.009]
Scheithauer, G., 1992. Algorithm for the Container Loading Problem. Operational Research Proc. 1991, p.445–452.
Scheithauer, G., Terno, J., 1996. The G4-heuristic for the pallet loading problem, J. Operat. Res. Soc., 47:511–522.
Takahara, S., 2005. Loading Problem in Multiple Containers and Containers and Pallets Using Strategic Search Method. Modeling Decisions for Artificial Intelligence, Proc. Lecture Notes in Artificial Intelligence, 3558:448–456.
Terno, J., Scheithauer, G., Sommerweiss, U., Riehme, J., 2000. An efficient approach for the multi-pallet loading problem. Eur. J. Operat. Res., 123(2):372–381. [doi:10.1016/S0377-2217(99)00263-5]
Wang, Z.J., Li, K.W., 2007. A Layer-based Heuristic for the Container Loading Problem with Homogeneous Boxes. Proc. 2nd Int. Conf. on Computer Science and Education, p.233–238.
Wang, Z.J., Li, K.W., Zhang, X.P., 2006. A Heuristic Algorithm for the Container Loading Problem with Heterogeneous Boxes. Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, p.5240–5245.
Wang, Z.J., Li, K.W., Levy, J.K., 2007. A heuristic for the container loading problem: a tertiary-tree-based dynamic space decomposition approach. Eur. J. Operat. Res., in press. [doi:10.1016/j.ejor.2007.08.017]
Author information
Authors and Affiliations
Corresponding author
Additional information
Project supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) under the Discovery Grant Program
Rights and permissions
About this article
Cite this article
Wang, Zj., Li, K.W. Layer-layout-based heuristics for loading homogeneous items into a single container. J. Zhejiang Univ. - Sci. A 8, 1944–1952 (2007). https://doi.org/10.1631/jzus.2007.A1944
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.2007.A1944