Toolpath optimization for minimizing airtime during machining

Journal of Manufacturing Systems

Volumn 22, Issue 3, 2003, Pages 173-180

  Castelino, Kenneth ^a   D'Souza, Roshan ^a   Wright, Paul K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Airtime Minimization; Combinatorial Optimization; Sequential Ordering Problem; Toolpath Planning; Traveling Salesman Problem

Indexed keywords

ALGORITHMS; COMMINUTION; CONSTRAINT THEORY; COSTS; DEPOSITION; DRILLING; GRAPH THEORY; HAMILTONIANS; HEURISTIC METHODS; INTEGER PROGRAMMING; LASERS; PLANNING; SALES; TRAVELING SALESMAN PROBLEM;

AIRTIME MINIMIZATIONS; COMBINATORIAL OPTIMIZATIONS; TOOLPATH PLANNING;

MACHINING;

EID: 3242886307     PISSN: 02786125     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0278-6125(03)90018-5     Document Type: Article

References (30)

1. Ascheuer, N.; Jünger, M.; and Reinelt, G. (1998). "Heuristic algorithms for the asymmetric traveling salesman problem with precedence constraints - a computational comparison." Technical Report, ZIB Berlin.
2. Ascheuer, N.; Jünger, M.; and Reinelt, G. (2000). "A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints." Computational Optimization and Applications (v 17), pp61-84.
3. Chen, S. and Smith, S. (1996). "Commonality and genetic algorithm." Technical Report CMU-RI-TR-96-27, Carnegie Mellon Univ.
4. Christofides, N. (1976). "Worst-case analysis of a new heuristic for the travelling salesman problem." Report No. 388, GSIA, Carnegie-Mellon Univ.
5. Cirasella, J.; Johnson, D.; et al. (2001). "The asymmetric traveling salesman problem: algorithms, instance generators, and tests." ALENEX 2001 Proc., Springer Lecture Notes in Computer Science 2153, PP32-59.
6. Dimitrijevic, V. and Saric, Z. (1997). "An effective transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs." Information Sciences (v102), pp105-110.
7. D'Souza, R.; Wright, P.K.; and Sequin, C. (2001). "Automated microplanning for 2.5-D pocket machining." Journal of Manufacturing Systems (v20, n4), pp1573-1590.
8. Escudero, L.F.; Guignard M.; and Malik, K. (1994). "A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence constraints." Annals of Operations Research (v50), pp219-237.
9. Gambardella, L.M. and Dorigo, M. (2000). "An ant colony system hybridized with a new local search for the sequential ordering problem." INFORMS Journal on Computing (v12, n3), pp237-255.
10. Garey, M.R. and Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman.
11. Glover, F. (1991). "Multilevel tabu-search and embedded search neighborhoods for the traveling salesman problem." Manuscript, School of Business, Univ. of Colorado.
12. Han, G. and Na, S. (1999). "A study on torch path planning in laser cutting process, part 2: cutting path optimization using simulated annealing." Journal of Manufacturing Processes (v1, n1), pp62-70.
13. Helsgaun, K. (2000). "An effective implementation of the Lin-Kernighan traveling salesman heuristic." European Journal of Operational Research (v126), pp106-130.
14. Johnson, D. and McGeoch, L. (1997). "The traveling salesman problem: a case study in local optimization." Local Search in Combinatorial Optimization, pp215-310.
15. Kanellakis, P. and Papadimitriou, C. (1980). "Local search for the asymmetric traveling salesman problem." Opeations Research (v28, n5), pp1066-1099.
16. Kannan, B. and Wright, P.K. (2001). "Efficient algorithms for automated process planning of 2.5D machined parts considering fixturing constraints." Communicated to the Int'l Journal of Computer Integrated Mfg.
17. Khan, W.A.; Hayhurst, D.R.; and Cannings, C. (1999). "Determination of optimal path under approach and exit constraints." European Journal of Operational Research (v117), pp310-325.
18. Kirkpatrick, S.; Gelatt, C.D.; and Vecchi, M.P. (1983). "Optimization by simulated annealing." Science (v220), pp671-680.
19. Kolahan, F. and Liang, M. (2000). "Optimization of hole-making operations: a tabu-search approach." Int'l Journal of Machine Tools & Manufacture (v40), pp1735-1753.
20. Laporte, G. (1992). "The traveling salesman problem: an overview of exact and approximate algorithms." European Journal of Operational Research (v59), pp231-247.
21. Laporte, G. and Nobert, Y. (1983). "Generalized traveling salesman problem through n sets of nodes: an integer programming approach." Informs (v21, n1).
22. Lawler, E.L.; Lenstra, J.K.; Rinnooy Kan, A.H.G.; and Shmoys, D.E. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: John Wiley & Sons.
23. Lien, Y.N. and Ma, E. (1993). "Transformation of the generalized traveling salesman problem into the standard traveling salesman problem." Information Sciences (v74), pp177-189.
24. Lin, S. and Kernighan, B.W. (1973). "An effective heuristic algorithm for the traveling salesman problem." Operations Research (v21), pp498-516.
25. Manber, U. and Israni, S. (1984). "Pierce point minimization and optimal torch path determination in flame cutting." Journal of Manufacturing Systems (v3, n1), pp81-89.
26. Muhlenbein, H.; Gorges-Schleuter, M.; and Kramer, O. (1988). "Evolution algorithms in combinatorial optimization." Parallel Computation (v7), pp65-85.
27. Reinelt, G. (1991). "TSPLIB - a traveling salesman problem library." ORSA Journal on Computing (v3), pp376-384
28. Renaud, J. and Boctor, F.F. (1998). "An efficient composite heuristic for the symmetric generalized traveling salesman problem." European Journal of Operational Research (v108), pp571-584.
29. Sundarararjan, V. and Wright, P.K. (1998). "Identification of multiple feature representations by volume decomposition for 2.5D components." 1998 ASME Winter Annual Meeting, Anaheim, C.A.
30. Zhang, W. (1993). "Truncated branch and bound: a case study on the asymmetric TSP." Proc. of AAAI 1993 Spring Symp. on AI and NP-hard Problems, pp160-166.