A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

Computers and Operations Research

Volumn 29, Issue 7, 2002, Pages 925-947

  Alvarez Valdés, Ramón ^a   Parajón, Antonio ^b   Tamarit, Jose'e Manuel ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

^b National Autonomous University of Nicaragua   (Nicaragua)

Author keywords

Cutting stock problem; GRASP; Heuristics; Knapsack problem; Path relinking; Tabu search

Indexed keywords

GLASS; HEURISTIC METHODS; INDUSTRIAL APPLICATIONS; METALS; PAPER;

BUILDING BLOCKS;

ALGORITHMS;

ALGORITHM;

EID: 0036604756     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00095-2     Document Type: Article

References (23)

1. An efficient approach for large-scale two-dimensional guillotine cutting stock problems
2. Algorithms for unconstrained two-dimensional guillotine cutting
3. A recursive exact algorithm for weighted two-dimensional cutting
4. An algorithm for two-dimensional cutting problems
5. Best-first search methods for constrained two-dimensional cutting stock problems
6. An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
7. An improvement of Viswanathan and Bagchi's exact algorithm for cutting stock problems
8. Constrained two-dimensional cutting: An improvement of Christofides and Whitlock's exact algorithm
9. An and-or-graph approach for two-dimensional cutting problems
10. An approximation algorithm for solving unconstrained two-dimensional knapsack problems
11. The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
12. Staged and constrained two-dimensional guillotine cutting problems: An AND/OR- Graph approach
13. Two algorithms for constrained two-dimensional cutting stock problems
14. Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates
15. Knapsack problems
16. A probabilistic heuristic for a computationally difficult set covering problem
17. Greedy randomized adaptive search procedures
18. A recursive computing procedure for two-dimensional stock cutting
19. Une amelioration de l'algorithme recursif de Herz por le probleme de decoupe a deux dimensions
20. An improved version of Wang's algorithm for two-dimensional cutting problems
21. Constrained two-dimensional cutting stock problems. A best-first branch-and-bound algorithm