Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
From MaRDI portal
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
Cited in
(18)- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
- Optimizing insertions in a constraint routing problem with complicated cost functions
- Exact approaches for the cutting path determination problem
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes
- Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
- A dual coding improved genetic algorithm for optimization of laser cutting paths
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Approach optimizing tool paths arrangement based on genetic algorithm
- Two-dimensional profile-packing approach for multi-torch flame cutting
- Optimization of the nibbling operation on an NC turret punch press
- Performance-based optimal selection of cutting conditions and cutting tools in multipass turning operations using genetic algorithms
- Routing under constraints: problem of visit to megalopolises
- Optimizing multi-inserts in routing problems with constraints
- Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
- Two-stage dynamic programming in the routing problem with decomposition
- 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
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)
