Journal of the Operational Research Society

, Volume 61, Issue 2, pp 306–320 | Cite as

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

Theoretical Paper

Abstract

In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. The combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50 000 instances). It is also effective for solving the instances of problem set Cover III (almost 100 000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. The computer implementation and the data sets are available for benchmarking purposes.

Keywords

cutting and packing manufacturer's pallet loading problem woodpulp stowage problem non-guillotine cutting pattern dynamic programming raster points 

Notes

Acknowledgements

This work was partially supported by PRONEX-Optimization (PRONEX-CNPq/FAPERJ E-26/171.510/2006-APQ1), FAPESP (Grants 2006/53768-0, 2006/03496-3 and 2005/57984-6) and CNPq (Grants PROSUL 490333/2004-4 and 522973/1995-4). The authors would like to thank Dr W. F. Mascarenhas for his help to prove Lemmas A.1 and A.2 and an anonymous referee for his/her useful comments and suggestions.

References

  1. Alvarez-Valdes R, Parreño F and Tamarit JM (2005a). A tabu search algorithm for the pallet loading problem. OR Spectrum 27: 43–61.CrossRefGoogle Scholar
  2. Alvarez-Valdes R, Parreño F and Tamarit JM (2005b). A branch-and-cut algorithm for the pallet loading problem. Comput Opns Res 32: 3007–3029.CrossRefGoogle Scholar
  3. Arenales M and Morabito R (1995). An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. Eur J Opl Res 84: 599–617.CrossRefGoogle Scholar
  4. Balasubramanian R (1992). The pallet loading problem: A survey. Int J Prod Econ 28: 217–225.CrossRefGoogle Scholar
  5. Barnes FW (1979). Packing the maximum number of m × n tiles in a large p × q rectangle. Discrete Math 26: 93–100.CrossRefGoogle Scholar
  6. Birgin EG, Morabito R and Nishihara FH (2005). A note on an L-approach for solving the manufacturer's pallet loading problem. J Opl Res Soc 56: 1448–1451.CrossRefGoogle Scholar
  7. Bischoff E and Dowsland WB (1982). An application of the micro to product design and distribution. J Opl Res Soc 33: 271–280.CrossRefGoogle Scholar
  8. Brunetta L and Gregoire P (2005). A general purpose algorithm for three-dimensional packing. INFORMS J Comput 17: 328–338.CrossRefGoogle Scholar
  9. Cormen TH, Leiserson CE, Rivest RL and Stein C (2001). Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill: Cambridge.Google Scholar
  10. Dowsland KA (1985). Determining an upper bound for a class of rectangular packing problems. Comput Opns Res 12: 201–205.CrossRefGoogle Scholar
  11. Dowsland KA (1987a). An exact algorithm for the pallet loading problem. Eur J Opl Res 84: 78–84.CrossRefGoogle Scholar
  12. Dowsland KA (1987b). A combined database and algorithmic approach to the pallet-loading problem. J Opl Res Soc 38: 341–345.CrossRefGoogle Scholar
  13. Dowsland KA and Dowsland WB (1992). Packing problems. Eur J Opl Res 56: 2–14.CrossRefGoogle Scholar
  14. Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145–159.CrossRefGoogle Scholar
  15. Herbert A and Dowsland KA (1996). A family of genetic algorithms for the pallet loading problem. Ann Opns Res 63: 415–436.CrossRefGoogle Scholar
  16. Letchford A and Amaral A (2001). Analysis of upper bounds for the pallet loading problem. Eur J Opl Res 132: 582–593.CrossRefGoogle Scholar
  17. Lins L, Lins S and Morabito R (2003). An L-approach for packing (l,w)-rectangles into rectangular and L-shaped pieces. J Opl Res Soc 54: 777–789.CrossRefGoogle Scholar
  18. Maing-Kyu K and Young-Gun G (2001). A fast algorithm for two-dimensional pallet loading problems of large size. Eur J Opl Res 134: 193–2001.CrossRefGoogle Scholar
  19. Martins GHA (2003). Packing in two and three dimensions. PhD thesis, Naval Post-graduate School, CA.Google Scholar
  20. Martins GHA and Dell RF (2007). The minimum size instance of a pallet loading problem equivalence class. Eur J Opl Res 179: 17–26.CrossRefGoogle Scholar
  21. Morabito R and Farago R (2002). A tight lagrangean relaxation bound for the manufacturer's pallet loading problem. Studia Inform Univ 2: 57–76.Google Scholar
  22. Morabito R and Morales S (1998). A simple and effective recursive procedure for the manufacturer's pallet loading problem. J Opl Res Soc 49: 819–828.Google Scholar
  23. Morabito R and Morales S (1999). Erratum to ‘A simple and effective recursive procedure for the manufacturer's pallet loading problem’. J Opl Res Soc 50: 876.CrossRefGoogle Scholar
  24. Morabito R, Morales S and Widmer JA (2000). Loading optimization of palletized products on trucks. Transport Res Part E 36: 285–296.CrossRefGoogle Scholar
  25. Nelißen J (1995). How to use structural constraints to compute an upper bound for the pallet loading problem. Eur J Opl Res 84: 662–680.CrossRefGoogle Scholar
  26. Pureza V and Morabito R (2006). Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem. Comput Opns Res 33: 804–819.CrossRefGoogle Scholar
  27. Ribeiro GM and Lorena LAN (2008). Optimizing the woodpulp stowage using Lagrangean relaxation with clusters. J Opl Res Soc 59: 600–606.CrossRefGoogle Scholar
  28. Scheithauer G (1997). Equivalence and dominance for problems of optimal packing of rectangles. Ric Oper 27: 3–34.Google Scholar
  29. Scheithauer G and Sommerweiss G (1998). 4-block heuristic for the rectangle packing problem. Eur J Opl Res 108: 509–526.CrossRefGoogle Scholar
  30. Scheithauer G and Terno J (1996). The G4-heuristic for the pallet loading problem. J Opl Res Soc 47: 511–522.CrossRefGoogle Scholar
  31. Sirtoli DR, Ribeiro GM and Lorena LAN (2006). Estivagem de unidades de celulose: uma análise prática com heurísticas de bloco. Technical Report INPE-14398-PRE/9485, Instituto Nacional de Pesquisas Espaciais, Brazil.Google Scholar
  32. Wäescher G, Haußner H and Schumann H (2007). An improved typology of cutting and packing problems. Eur J Opl Res 183: 1109–1130.CrossRefGoogle Scholar

Copyright information

© Palgrave Macmillan 2009

Authors and Affiliations

  1. 1.University of São PauloSão PauloBrazil
  2. 2.Federal University of São PauloSão CarlosBrazil

Personalised recommendations