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

DOI10.1080/00207540600579615MaRDI QIDQ5438623zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A dual coding improved genetic algorithm for optimization of laser cutting paths
• Approach optimizing tool paths arrangement based on genetic algorithm
• Optimization of multipass turning operations with genetic algorithms
• scientific article; zbMATH DE number 2161546
• An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry

Cites work

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

Cited in

(17)

• Two-dimensional profile-packing approach for multi-torch flame cutting
• A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane
• Construction of a technologically feasible cutting with pierce points placement constraints
• Some constructions for solving routing problems using decompositions and transformations of target sets
• An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
• Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
• Optimizing multi-inserts in routing problems with constraints
• Exact approaches for the cutting path determination problem
• Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
• Mathematical models and routing algorithms for CAD technological preparation of cutting processes
• 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
• A dual coding improved genetic algorithm for optimization of laser cutting paths
• Routing under constraints: problem of visit to megalopolises
• Approach optimizing tool paths arrangement based on genetic algorithm
• Performance-based optimal selection of cutting conditions and cutting tools in multipass turning operations using genetic algorithms
• Two-stage dynamic programming in the routing problem with decomposition

Describes a project that uses

Uses Software

• TOPOS

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

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