An object-based evolutionary algorithm for solving nesting problems
From MaRDI portal
Publication:5444463
DOI10.1080/00207540600718718zbMath1128.90587MaRDI QIDQ5444463
K. Ratanapan, Cihan H. Dagli, Scott E. Grasman
Publication date: 25 February 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600718718
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Cites Work
- Solution approaches to irregular nesting problems
- A new algorithm for the minimal-area convex enclosure problem
- Compaction and separation algorithms for non-convex polygons and their applications
- Composite stock cutting through simulated annealing
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- New approaches for the nesting of two-dimensional shapes for press tool design
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
- An approach to two-dimensional cutting stock problems