Process planning for rotational parts using the generalized travelling salesman problem

DOI10.1080/0020754031000087337MaRDI QIDQ4474701zbMATHOpenAlexFDO

Authors

Publication date 12 July 2004

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Optimization of machining datum selection and machining tolerance allocation with genetic algorithms
• Tolerance analysis for setup planning: A graph theoretical approach
• Optimization of process plans using a constraint-based tabu search approach
• A CAPP framework with optimized process parameters for rotational components
• A comparative evaluation of sequential set point adjustment procedures for tolerance control

Cited in

(8)

• Temperature field optimization for laser powder bed fusion as a traveling salesperson problem with history
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• Discrete/Binary approach
• Transformations of generalized ATSP into ATSP.
• Manipulator motion planning for high-speed robotic laser cutting
• Cluster-level operations planning for the out-of-position robotic arc-welding
• A random-key genetic algorithm for the generalized traveling salesman problem
• Methodology for set-up planning automation of turned parts

This page was built for publication: Process planning for rotational parts using the generalized travelling salesman problem

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