Cutting path optimization in CNC cutting processes using a two-step genetic algorithm

DOI10.1080/00207540600579615zbMath1128.90584OpenAlexW1983190776MaRDI QIDQ5438623

Moon-Kyu Lee, Ki-Bum Kwon

Publication date: 24 January 2008

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

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

zbMATH Keywords

optimizationgenetic algorithmcutting pathCNC cutting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Mathematical models and routing algorithms for CAD technological preparation of cutting processes ⋮ Two-stage dynamic programming in the routing problem with decomposition ⋮ Construction of a technologically feasible cutting with pierce points placement constraints ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ Routing under constraints: problem of visit to megalopolises ⋮ Optimizing insertions in a constraint routing problem with complicated cost functions ⋮ On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks ⋮ Exact approaches for the cutting path determination problem

Uses Software

• TOPOS

Cites Work

• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• A 2-exchange heuristic for nesting problems
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Cutting path optimization in CNC cutting processes using a two-step genetic algorithm