An L-approach for packing (l, w)-rectangles into rectangular and L-shaped pieces

Journal of the Operational Research Society

Volumn 54, Issue 7, 2003, Pages 777-789

  Lins, L ^a   Lins, S ^a   Morabito, R ^b  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

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

Author keywords

Cutting and packing; Pallet and container loading; Recursive algorithm

Indexed keywords

CUTTING; HEURISTIC METHODS; OPTIMIZATION; PACKING; PROBLEM SOLVING;

RECURSIVE ALGORITHMS;

ALGORITHMS;

EID: 0037480767     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601553     Document Type: Article

References (42)

1. Tarnowski A, Terno J and Scheithauer G (1994). A polynomial-time algorithm for the guillotine pallet loading problem. INFOR 32: 275-287.
2. Dowsland K (1987). An exact algorithm for the pallet loading problem. Eur J Opl Res 31: 78-84.
3. Nelissen J (1995). How to use structural constraints to compute an upper bound for the pallet loading problem. Eur J Opl Res 84: 662-680.
4. 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.
5. Nelissen J (1994). Solving the pallet loading problem more efficiently. Working Paper, Graduiertenkolleg Informatik und Technik, Aachen.
6. Letchford A and Amaral A (2001). Analysis of upper bounds for the pallet loading problem. Ear J Opl Res 132: 582-593.
7. Beasley J (1985). An exact two-dimensional non-guillotine tree search procedure. Opns Res 33: 49-64.
8. Tsai R, Malstrom E and Kuo W (1993). Three dimensional palletization of mixed box sizes. IEE Trans 25: 64-75.
9. Hadjiconstantinou E and Christofides N (1995). An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur J Opl Res 83: 39-56.
10. Amaral A and Letchford A (2001). Comment on 'An exact algorithm for general, orthogonal, two-dimensional knapsack problems'. Eur J Opl Res, submitted.
11. Dowsland W (1995). Improving palletization efficiency - the theoretical basis and practical applications. Int J Prod Res 33: 213-222.
12. Morabito R, Morales S and Widmer J (2000). Loading optimization of palletized products on trucks. Trans Res 36(Part E): 285-296.
13. Bhattacharya S, Roy R and Bhattacharya S (1998). An exact depth-first algorithm for the pallet loading problem. Eur J Opl Res 110: 610-625.
14. Steudel H (1979). Generating pallet loading patterns: a special case of the two-dimensional cutting stock problem. Mngt Sci 10: 997-1004.
15. Smith A and De Cani P (1980). An algorithm to optimize the layout of boxes in pallets. J Opl Res Soc 31: 573-578.
16. Bischoff E and Dowsland W (1982). An application of the micro to product design and distribution. J Opl Res 33: 271-280.
17. 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.
18. Scheithauer G and Terno J (1996). The G4-heuristic for the pallet loading problem. J Opl Res Soc 47: 511-522.
19. Herbert A and Dowsland K (1996). A family of genetic algorithms for the pallet loading problem. Ann Opns Res 63: 415-436.
20. Scheithauer G and Sommerweiss G (1998). 4-block heuristic for the rectangle packing problem. Eur J Opl Res 108: 509-526.
21. Morabito R and Morales S (1999). Errata: 'A simple and effective recursive procedure for the manufacturers pallet loading problem'. J Opl Res Soc 50: 876.
22. G Y and Kang M (2001). A fast algorithm for two-dimensional pallet loading problems of large size. Eur J Opl Res 134: 193-200.
23. Lins L, Lins S and Morabito R (2002). An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container. Eur J Opl Res 141: 421-439.
24. Morabito R and Farago R (2002). A tight Lagrangean relaxation bound for the manufacturer's pallet loading problem. Studia Informatica Universalis 2: 57-76.
25. Hodgson T (1982). A combined approach to the pallet loading problem. IIE Trans 14: 176-182.
26. Dowsland K and Dowsland W (1992). Packing problems. Eur J Opl Res 56: 2-14.
27. Sweeney P and Paternoster E (1992). Cutting and packing problems: A categorized, application-oriented research bibliography. J Opl Res Soc 43: 691-706.
28. Dyckhoff H and Finke U (1992). Cutting and Packing in Production and Distribution: Typology and Bibliography. Springer-Verlag Co: Heidelberg.
29. Balasubramanian R (1992). The pallet loading problem: a survey. Int J Prod Econ 28: 217-225.
30. Martello S (ed.) (1994), Special issue: knapsack, packing and cutting, Part II: multidimensional knapsack and cutting stock problems. INFOR 32.
31. Bischoff E and Waescher G (eds) (1995). Special issue on cutting and packing. Eur J Opl Res 84: 503-712.
32. Dyckhoff H, Scheithauer G and Terno J (1997). Cutting and packing. In: Amico M, Maffioli F and Martello S (eds), Annotated Bibliographies in Combinatorial Optimisation. John Wiley & Sons: New York, 393-414.
33. Arenales M, Morabito R and Yanasse H (eds) (1999). Special issue: cutting and packing problems. Pesquisa Operacional 19: 109-284.
34. Wang P and Waescher G (eds) (2002). Special issue on cutting and packing. Eur J Opl Res 141: 239-469.
35. Hifi M (ed.) (2002). Special issue on cutting and packing. Studia Informatica Universalis 2: 1-161.
36. Lins L, Lins S and Morabito R (1999). A 9-fold partition heuristic for packing boxes into a container. Investigacion Operativa 7: 69-82.
37. Herz J (1972). Recursive computational procedure for two-dimensional stock cutting. IBM J Res Development 16: 462-469.
38. Christofides N and Whitlock C (1977). An algorithm for two-dimensional cutting problems. Opns Res 25: 30-44.
39. Dowsland K (1985). Determining an upper bound for a class of rectangular packing problems. Comput Opns Res 12: 201-205.
40. Lins L, Lins S and Melo S (2002). PHORMA: Perfectly hashable order restricted multidimensional arrays. Discrete Appl Math., submitted.
41. Cormen T, Leiserson C and Rivest R (1990). Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company: Cambridge, MA and New York.
42. Dowsland K (1984). The three-dimensional pallet chart: an analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems. J Opl Res Soc 35: 895-905.