A tabu search algorithm for a two-dimensional non-guillotine cutting problem

European Journal of Operational Research

Volumn 183, Issue 3, 2007, Pages 1167-1182

  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

Heuristics; Non guillotine cutting; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; LEARNING ALGORITHMS; PROBLEM SOLVING; TABU SEARCH;

GUILLOTINE CUTTING PROBLEMS; NON-GUILLOTINE CUTTING;

OPERATIONS RESEARCH;

EID: 34447093826     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.11.068     Document Type: Article

References (23)

1. Alvarez-Valdes R., Parreño F., and Tamarit J.M. A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. Journal of Operational Research Society 56 (2005) 414-425
2. Amaral, A., 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 LA1 4YW, England.
3. Arenales M., and Morabito R. An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. European Journal of Operational Research 84 (1995) 599-617
4. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33 (1985) 49-64
5. Beasley J.E. A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research 156 (2004) 601-627
6. Caprara A., and Monaci M. On the two-dimensional knapsack problem. Operations Research Letters 32 (2004) 5-14
7. Christofides N., and Whitlock C. An algorithm for two-dimensional cutting problems. Operations Research 25 (1977) 30-44
8. Fekete, S.P., Schepers, J., 1997. On more-dimensional packing III: Exact algorithms. ZPR Technical Report 97-290. Available from: .
9. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Boston
10. Hadjiconstantinou E., and Christofides N. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research 83 (1995) 39-56
11. Healy P., Creavin M., and Kuusik A. An optimal algorithm for placement rectangle. Operations Research Letters 24 (1999) 73-80
12. Hopper E., and Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128 (2001) 34-57
13. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
14. Lai K.K., and Chan J.W.M. Developing a simulated annealing algorithm for the cutting stock problem. Computers and Industrial Engineering 32 (1997) 115-127
15. Lai K.K., and Chan J.W.M. A evolutionary algorithm for the rectangular cutting stock problem. International Journal of Industrial Engineering 4 (1997) 130-139
16. Leung T.W., Yung C.H., and Troutt M.D. Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Computers and Industrial Engineering 40 (2001) 201-214
17. Leung T.W., Yung C.H., and Troutt M.D. Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research 145 (2003) 530-542
18. Scheithauer G. LP-based bounds for the container and multi-container loading problem. International Transactions in Operations Research 6 (1999) 199-213
19. Scheithauer G., and Terno J. Modeling of packing problems. Optimization 28 (1993) 63-84
20. Tsai R.D., Malstrom E.M., and Meeks H.D. A two-dimensional palletizing procedure for warehouse loading operations. IIE Transactions 20 (1988) 418-425
21. Wäscher, G., Haussner, H., Schumann, H., 2006. An improved typology of cutting and packing problems. European Journal of Operational Research, this issue.
22. Wang P.Y. Two algorithms for constrained two-dimensional cutting stock problems. Operations Research 31 (1983) 573-586
23. Wu Y.L., Huang W., Lau S.C., Wong C.K., and Young G.H. An effective quasi-human based heuristic for solving rectangle packing problem. European Journal of Operational Research 141 (2002) 341-358