The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon

Computers and Operations Research

Volumn 28, Issue 3, 2001, Pages 271-287

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

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Geometric algorithm; Irregular cutting stock problem; Nesting

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; CUTTING; PROBLEM SOLVING;

IRREGULAR CUTTING-STOCK PROBLEMS; NO-FIT POLYGONS;

OPERATIONS RESEARCH;

GEOMETRY; POLYGON;

EID: 0034155380     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00021-6     Document Type: Article

References (20)

1. Nesting two dimensional shapes in rectangular modules
2. A tabu thresholding implementation for the irregular stock cutting problem
3. Geometry, shoemaking and the milk tray problem
4. Jostling for position: Local improvement for irregular cutting patterns
5. Solution approaches to irregular nesting problems
6. A unified computational framework for minkowski operations
7. An algebra of polygons through the notion of negative shapes
8. A simulated annealing approach to the nesting problem in the textile manufacturing industry
9. Compaction and separation algorithms for non-convex polygons and their application
10. Placement and compaction of non convex polygons for clothing manufacture
11. A new constructive algorithm for nesting problems
12. An algorithm to compute the minkowski sum outer-face of two simple polygons
13. Minkowski sum and hodograph of the dense placement vector function
14. The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules