An object-based evolutionary algorithm for solving nesting problems

DOI10.1080/00207540600718718MaRDI QIDQ5444463zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

combinatorial optimizationcutting and packingevolutionary algorithmsnesting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• TOPOS -- A new constructive algorithm for nesting problems
• scientific article; zbMATH DE number 2111993
• Solution approaches to irregular nesting problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle

Cites work

• A new algorithm for the minimal-area convex enclosure problem
• An approach to two-dimensional cutting stock problems
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• Compaction and separation algorithms for non-convex polygons and their applications
• Composite stock cutting through simulated annealing
• New approaches for the nesting of two-dimensional shapes for press tool design
• Solution approaches to irregular nesting problems
• Using a tabu search approach for solving the two-dimensional irregular cutting problem

Cited in

(1)

• Solution for textile nesting problems using adaptive meta-heuristics and grouping

This page was built for publication: An object-based evolutionary algorithm for solving nesting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444463)