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

Journal of the Operational Research Society

Volumn 61, Issue 2, 2010, Pages 306-320

  Birgin, E G ^a   Lobato, R D ^a   Morabito, R ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b FEDERAL UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Cutting and packing; Dynamic programming; Manufacturer's pallet loading problem; Non guillotine cutting pattern; Raster points; Woodpulp stowage problem

Indexed keywords

CARGO HANDLING; DYNAMIC PROGRAMMING; GEOMETRY; NAVIGATION; PALLETS; REGRESSION ANALYSIS; STOWAGE (MINES); WOOD;

CUTTING AND PACKING; MANUFACTURER'S PALLET LOADING PROBLEMS; NON-GUILLOTINE CUTTING; RASTER POINTS; STOWAGE PROBLEMS;

LOADING;

EID: 73549106809     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2008.141     Document Type: Article

References (32)

1. Alvarez-Valdes R, Parrẽno F and Tamarit JM (2005a). A tabu search algorithm for the pallet loading problem. OR Spectrum 27: 43-61. (Pubitemid 40389670)
2. Alvarez-Valdes R, Parrẽno F and Tamarit JM (2005b). A branch-andcut algorithm for the pallet loading problem. Comput Opns Res 32: 3007-3029. (Pubitemid 40244559)
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.
4. Balasubramanian R (1992). The pallet loading problem: A survey. Int J Prod Econ 28: 217-225.
5. Barnes FW (1979). Packing the maximum number of m × n tiles in a large p × q rectangle. Discrete Math 26: 93-100.
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.
7. Bischoff E and Dowsland WB (1982). An application of the micro to product design and distribution. J Opl Res Soc 33: 271-280.
8. Brunetta L and Gregoire P (2005). A general purpose algorithm for three-dimensional packing. INFORMS J Comput 17: 328-338.
9. Cormen TH, Leiserson CE, Rivest RL and Stein C (2001). Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill: Cambridge.
10. Dowsland KA (1985). Determining an upper bound for a class of rectangular packing problems. Comput Opns Res 12: 201-205.
11. Dowsland KA (1987a). An exact algorithm for the pallet loading problem. Eur J Opl Res 84: 78-84.
12. Dowsland KA (1987b). A combined database and algorithmic approach to the pallet-loading problem. J Opl Res Soc 38: 341-345.
13. Dowsland KA and Dowsland WB (1992). Packing problems. Eur J Opl Res 56: 2-14.
14. Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145-159.
15. Herbert A and Dowsland KA (1996). A family of genetic algorithms for the pallet loading problem. Ann Opns Res 63: 415-436.
16. Letchford A and Amaral A (2001). Analysis of upper bounds for the pallet loading problem. Eur J Opl Res 132: 582-593.
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.
18. Maing-Kyu K and Young-Gun G (2001). A fast algorithm for twodimensional pallet loading problems of large size. Eur J Opl Res 134: 193-2001.
19. Martins GHA (2003). Packing in two and three dimensions. PhD thesis, Naval Post-graduate School, CA.
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.
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.
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.
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.
24. Morabito R, Morales S and Widmer JA (2000). Loading optimization of palletized products on trucks. Transport Res Part E 36: 285-296.
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.
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.
27. Ribeiro GM and Lorena LAN (2008). Optimizing the woodpulp stowage using Lagrangean relaxation with clusters. J Opl Res Soc 59: 600-606.
28. Scheithauer G (1997). Equivalence and dominance for problems of optimal packing of rectangles. Ric Oper 27: 3-34.
29. Scheithauer G and Sommerweiss G (1998). 4-block heuristic for the rectangle packing problem. Eur J Opl Res 108: 509-526.
30. Scheithauer G and Terno J (1996). The G4-heuristic for the pallet loading problem. J Opl Res Soc 47: 511-522.
31. Sirtoli DR, Ribeiro GM and Lorena LAN (2006). Estivagem de unidades de celulose: uma ańalise pŕatica com heurísticas de bloco. Technical Report INPE-14398-PRE/9485, Instituto Nacional de Pesquisas Espaciais, Brazil.
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.