Solution approaches to irregular nesting problems

DOI10.1016/0377-2217(95)00019-MzbMath0918.90116MaRDI QIDQ1127203

William B. Dowsland, Kathryn A. Dowsland

Publication date: 13 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

survey; heuristics; packing; nesting of irregularly shaped pieces

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C27: Combinatorial optimization

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

Related Items

Solving nesting problems with non-convex polygons by constraint logic programming, An object-based evolutionary algorithm for solving nesting problems, Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming, Cut scheduling in the apparel industry, Heuristics for a dynamic rural postman problem, Translational packing of arbitrary polytopes, Rotational polygon overlap minimization and compaction, Computing closely matching upper and lower bounds on textile nesting problems, A new algorithm for the two-polygon containment problem, The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon., Densest translational lattice packing of non-convex polygons, Alternative formulations for a layout problem in the fashion industry, A simulated annealing approach for the circular cutting problem, Mixed-integer programming models for nesting problems, Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle, Fast neighborhood search for two- and three-dimensional nesting problems, A hybrid approach for packing irregular patterns using evolutionary strategies and neural network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composite stock cutting through simulated annealing
• Packing problems
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• Applied simulated annealing
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• Jostling for position: local improvement for irregular cutting patterns
• New approaches for the nesting of two-dimensional shapes for press tool design
• Performance testing of rectangular parts-nesting heuristics
• Modeling of packing problems
• Determining the minimum-area encasing rectangle for an arbitrary closed curve