Reactive GRASP for the strip-packing problem

Computers and Operations Research

Volumn 35, Issue 4, 2008, Pages 1065-1083

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

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

GRASP; Heuristics; Non guillotine cutting; Strip packing

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); METAHEURISTICS; NON GUILLOTINE CUTTING; STRIP PACKING;

ONLINE SEARCHING;

EID: 34548609506     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.07.004     Document Type: Article

References (36)

1. Bengtsson B.E. Packing rectangular pieces-a heuristic approach. The Computer Journal 25 (1982) 353-357
2. Wäscher G, Haussner H, Schumann H. An improved typology of cutting and packing problems, European Journal of Operational Research, 2006; in press.
3. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 2 (1990) 145-159
4. Lodi A., Martello S., and Monaci M. Two-dimensional packing problems: a survey. European Journal of Operational Research 141 2 (2002) 241-252
5. Martello S., Monaci M., and Vigo D. An exact approach to the strip packing problem. INFORMS Journal on Computing 15 3 (2003) 310-319
6. Fekete SP, Schepers J. An exact algorithm for higher-dimensional orthogonal packing. Operations Research 2004; in press.
7. Baker B.S., Coffman E.G., and Rivest R.L. Orthogonal packing in two dimensions. SIAM Journal on Computing 9 (1980) 846-855
8. Liu D., and Teng H. An improved BL-algorithm for genetic algorithm of the ortogonal packing of rectangles. European Journal of Operational Research 112 (1999) 413-420
9. Chazelle B. The bottom-left bin packing heuristic: an efficient implementation. IEEE Transactions on Computers 32 (1983) 697-707
10. Iori M., Martello S., and Monaci M. Metaheuristic algorithms for the strip packing problem. In: Pardalos P.M., and Korotkith V. (Eds). Optimization and industry: new frontiers (2003), Kluwer Academic Publishers, Dordrecht 159-179
11. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
12. Gómez A., and De la Fuente D. Resolution of strip-packing problems with genetic algorithms. Journal of the Operational Research Society 51 (2000) 1289-1295
13. Leo H.W., and Wallace K.S. Strip-packing using hybrid genetic approach. Engineering Applications of Artificial Intelligence 17 (2004) 169-177
14. Yeung L.H.W., and Tang W.K.S. Strip-packing using hybrid genetic approach. Engineering Applications of Artificial Intelligence 17 (2004) 169-277
15. Lesh N., Marks J., McMahon A., and Mitzenmacher M. New heuristic and interactive approaches to 2D rectangular strip packing. ACM Journal of Experimental Algorithmics 10 (2005) 1-18
16. Burke E.K., Kendall G., and Whitwell G. A new placement heuristic for the orthogonal stock-cutting problem. Operations Research 52 (2004) 655-671
17. Burke EK, Kendall G, Whitwell G. Metaheuristic enhancements of the best-fit heuristic for the orthogonal stock cutting problem. Computer science technical report no. NOTTCS-TR-SUB-0605091028-4370, University of Nottingham, 2006.
18. Bortfeldt A. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research 172 3 (2006) 814-837
19. Dowsland K.A. Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research 68 (1993) 389-399
20. Zhang D., Kang Y., and Deng A. A new heuristic recursive algorithm for the strip rectangular packing problem. Computers & Operations Research 33 (2006) 2209-2217
21. Beltrán J.C., Calderón J.E., Cabrera R.J., and Moreno J.M. Procedimientos constructivos adaptativos (GRASP) para el problema del empaquetado bidimensional. Revista Iberoamericana de Inteligencia Artificial 15 (2002) 26-33
22. Feo T., and Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8 (1989) 67-71
23. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Dordrecht 219-249
24. Prais M., and Ribeiro C.C. Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12 (2000) 164-176
25. Delorme X., Gandibleux X., and Rodriguez J. GRASP for set packing problems. European Journal of Operational Research 153 3 (2003) 564-580
26. Alvarez-Valdes R., Parreño F., and Tamarit J.M. A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. Journal of the Operational Research Society 56 (2005) 414-425
27. Hopper E., and Turton C.H. An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128 (2001) 34-57
28. Hopper E. Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods, PhD thesis, Cardiff University, School of Engineering; 2000.
29. Wang P.Y., and Valenzuela C.L. Data set generation for rectangular placement problems. European Journal of Operational Research 134 (2001) 378-391
30. Ramesh Babu A., and Ramesh Babu N. Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research 37 (1999) 1625-1643
31. Pinto E, Oliveira JF. Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. second ESICUP Meeting, Southampton, 2005.
32. Christofides N., and Whitlock C. An algorithm for two-dimensional cutting problems. Operations Research 25 (1977) 30-44
33. Beasley J.E. Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society 36 (1985) 297-306
34. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33 (1985) 49-64
35. Martello S., and Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Science 44 (1998) 388-399
36. Berkey J.O., and Wang P.Y. Two dimensional finite bin packing algorithms. Journal of the Operational Research Society 38 (1987) 423-429