Journal
JOURNAL OF MANUFACTURING SYSTEMS
Volume 22, Issue 3, Pages 173-180Publisher
ELSEVIER SCI LTD
DOI: 10.1016/S0278-6125(03)90018-5
Keywords
toolpath planning; airtime minimization; traveling salesman problem; sequential ordering problem; combinatorial optimization
Ask authors/readers for more resources
This paper describes an algorithm for minimizing the nonproductive time or 'airtime' for milling by optimally connecting different toolpath segments. This problem is formulated as a generalized traveling salesman problem with precedence constraints and is solved using a heuristic method. The performance of the heuristic algorithm and the amount of improvement obtained for different problem sizes is also presented. This algorithm has been implemented in an automated process planning system and can be applied easily to other areas of path planning optimization like fused deposition modeling and laser cutting.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available