Hybridising tabu search with optimisation techniques for irregular stock cutting

Management Science

Volumn 47, Issue 8, 2001, Pages 1160-1172

  Bennell, Julia A ^a,b   Dowsland, Kathryn A ^a,b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Irregular Stock Cutting; Linear Programming; Packing Problems; Tabu Search

Indexed keywords

HEURISTIC METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING; SIMULATED ANNEALING;

IRREGULAR STOCK CUTTING; TABU SEARCH;

MANAGEMENT SCIENCE;

EID: 0035435934     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.47.8.1160.10230     Document Type: Article

References (17)

1. A tabu thresholding implementation for the irregular stock cutting problem
2. The irregular cutting stock problem - A new procedure for deriving the nofit polygon
3. Using tabu search for solving the two-dimensional irregular cutting problem
4. Simulated annealing approach for solving stock cutting problem
5. Jostle for position-local improvement for irregular cutting patterns
6. An algebra of polygons through the notion of negative shapes
7. A simulated annealing approach to the nesting problem in the textile manufacturing industry
8. Optimal blank nesting using simulated annealing
9. Compaction and separation algorithms for non-convex polygons and their application
10. Algorithms for nesting problems
11. A new constructive algorithm for nesting problems
12. Some experiments with tabu search for solving nesting problems