The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
From MaRDI portal
Publication:1592584
DOI10.1016/S0305-0548(00)00021-6zbMath1048.90510MaRDI QIDQ1592584
William B. Dowsland, Julia A. Bennell, Kathryn A. Dowsland
Publication date: 4 July 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Related Items (24)
Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming ⋮ A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums ⋮ The geometry of nesting problems: a tutorial ⋮ Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory ⋮ Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers ⋮ A measure of non-convexity in the plane and the Minkowski sum ⋮ An emergent computation approach to the problem of polygon layout with performance constraints ⋮ An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ Algorithms for nesting with defects ⋮ A variable neighborhood search algorithm for the leather nesting problem ⋮ A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ Irregular stock cutting system based on AutoCAD ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem ⋮ Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem ⋮ An algorithm for polygon placement using a bottom-left strategy ⋮ An improved method for calculating the no-fit polygon ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Uses Software
Cites Work
- Unnamed Item
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- An algebra of polygons through the notion of negative shapes
- Jostling for position: local improvement for irregular cutting patterns
- A tabu thresholding implementation for the irregular stock cutting problem
This page was built for publication: The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
