A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems

Journal of the Operational Research Society

Volumn 56, Issue 4, 2005, Pages 414-425

  Alvarez Valdes, R ^a,c   Parreno F ^b   Tamarit, J M ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

^c Departamento de Estadistica   (Spain)

Author keywords

GRASP; Heuristics; Non guillotine cutting

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; CUTTING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; TWO DIMENSIONAL;

COMPUTATIONAL EXPERIMENTS; CUTTING PROBLEMS; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); NON-GUILLOTINE CUTTING;

ADAPTIVE ALGORITHMS;

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

References (24)

1. Tsai RD, Malstrom EM and Meeks HD (1988). A two-dimensional palletizing procedure for warehouse loading operations. IIE Trans 20: 418-425.
2. 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.
3. Healy P, Creavin M and Kuusik A (1999). An optimal algorithm for placement rectangle. Opns Res Lett 24: 73-80.
4. Beasley JE (1985). An exact two-dimensional non-guillotine cutting tree search procedure. Opns Res 33: 49-64.
5. Scheithauer G and Terno J (1993). Modeling of packing problems. Optimization 28: 63-84.
6. Hadjiconstantinou E and Christofides N (1995). An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur J Opl Res 83: 39-56.
7. Fekete SP and Schepers J (2004). An exact algorithm for higher-dimensional orthogonal packing. Working paper available from Fekete SP at http://www.math.tu-bs.de/~fekete
8. Caprara A and Monaci M (2004). On the two-dimensional Knapsack problem. Opns Res Lett 32: 5-14.
9. Scheithauer G (1999). LP-based bounds for the container and multi-container loading problem. Int Trans Opns Res 6: 199-213.
10. Amaral A and Letchford A (2003). An improved upper bound for the two-dimensional non-guillotine cutting problem. Working paper available from the second author at Department of Management Science, Management School, Lancaster University, Lancaster LAI 4YW, England.
11. Wu YL, Huang W, Lau SC, Wong CK and Young GH (2002). An effective quasi-human based heuristic for solving rectangle packing problem. Eur J Opl Res 141: 341-358.
12. Lai KK and Chan JWM (1997). Developing a simulated annealing algorithm for the cutting stock problem. Comput Ind Eng 32: 115-127.
13. Lai KK and Chan JWM (1997). A evolutionary algorithm for the rectangular cutting stock problem. Int J Ind Eng 4: 130-139.
14. Leung TW, Yung CH and Troutt MD (2001). Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Comput Ind Eng 40: 201-214.
15. Leung TW, Chan CK and Troutt MD (2003). Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. Eur J Opl Res 145: 530-542.
16. Beasley JE (2004). A population heuristic for constrained twodimensional non-guillotine cutting. Eur J Opl Res 156: 601-627.
17. Feo T and Resende MGC (1989). A probabilistic heuristic for a computationally difficult set covering problem. Opns Res Lett 8: 67-71.
18. Resende MGC and Ribeiro CC (2003). Greedy randomized adaptive search procedures. In: Glover F and Kochenberger G (eds). Handbook of Metaheuristics. Kluwer Academic Publishers, Dordrecht, MA, pp 219-249.
19. Prais M and Ribeiro CC (2000). Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J Comput 12: 164-176.
20. Delorme X, Gandibleux X and Rodriguez J (2003). GRASP for set packing problems. Eur J Opl Res 153: 564-580.
21. Beltrán JC, Calderón JE, Cabrera RJ and Moreno JM (2002). Procedimientos constructivos adaptativos (GRASP) para el problema del empaquetado bidimensional. Rev Iberoam Intel Artif 15: 26-33.
22. Wang PY (1983). Two algorithms for constrained two-dimensional cutting stock problems. Opns Res 31: 573-586.
23. Christofides N and Whitlock C (1977). An algorithm for twodimensional cutting problems. Opns Res 25: 30-44.
24. Jakobs S (1996). On genetic algorithms for the packing of polygons. Eur J Opl Res 88: 165-181.