Two-dimensional profile-packing approach for multi-torch flame cutting

DOI10.1080/00207540600693515zbMath1154.90370OpenAlexW2171388492MaRDI QIDQ3605412

No author found.

Publication date: 24 February 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600693515

zbMATH Keywords

optimizationflame cuttingprofile packing

Mathematics Subject Classification ID

Production models (90B30) Combinatorial optimization (90C27)

Cites Work

• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• Compaction and separation algorithms for non-convex polygons and their applications
• Rotational polygon overlap minimization and compaction
• On genetic algorithms for the packing of polygons
• Computing closely matching upper and lower bounds on textile nesting problems
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• A 2-exchange heuristic for nesting problems
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks
• A tabu thresholding implementation for the irregular stock cutting problem

This page was built for publication: Two-dimensional profile-packing approach for multi-torch flame cutting