An improvement heuristic framework for the laser cutting tool path problem

References

• Castelino, K., R. D’Souza, and P. Wright. 2003. “Toolpath Optimization for Minimizing Airtime during Machining.” Journal of Manufacturing Systems 22 (3): 173–180.
   Web of Science ®Google Scholar
• Chu, Y. J., and T. H. Liu. 1965. “On the Shortest Arborescence of a Directed Graph.” Science Sinica 14: 1396–1400.
   Google Scholar
• Croes, G. A. 1958. “A Method for Solving Traveling Salesman Problems.” Operations Research 6 (6): 791–812.
   Web of Science ®Google Scholar
• Dewil, R., P. Vansteenwegen, and D. Cattrysse. 2011. “Cutting Path Optimization using Tabu Search.” Key Engineering Materials 473: 739–748.
   Google Scholar
• Dewil, R., P. Vansteenwegen, and D. Cattrysse. 2012. “Generating Tool Paths for Laser Cutting Machines. In ORBEL 2012, 2–3. Brussels.
   Google Scholar
• Dewil, R., P. Vansteenwegen, and D. Cattrysse. 2014. “Construction Heuristics for Generating Tool Paths for Laser Cutters.” International Journal of Production Research 52 (20): 1–20.
   Web of Science ®Google Scholar
• Gambardella, L. M., and M. Dorigo. 2000. “An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem.” INFORMS Journal on Computing 12 (3): 237–255.
   Web of Science ®Google Scholar
• Garfinkel, R. S., and I. R. Webb. 1999. “On Crossings, the Crossing Postman Problem, and the Rural Postman Problem.” Networks 34 (3): 173–180.
   Web of Science ®Google Scholar
• Glover, F., and M. Laguna. 1999. Tabu Search. Vol. 50. Boston: Kluwer Academic.
   Google Scholar
• Han, G.-C., and S.-J. Na. 1999a. “A Study on Torch Path Planning in Laser Cutting Processes Part 1: Calculation of Heat Flow in Contour Laser Beam Cutting.” Journal of Manufacturing Processes I 1: 54–61.
   Google Scholar
• Han, G.-C., and S.-J. Na. 1999b. “A Study on Torch Path Planning in Laser Cutting Processes Part 2: Cutting Path Optimization.” Journal of Manufacturing Processes 1 (1): 62–70.
   Google Scholar
• Helsgaun, K. 2000. “An Effective Implementation of the Lin–Kernighan Traveling Salesman Heuristic.” European Journal of Operational Research 126 (1): 106–130.
   Web of Science ®Google Scholar
• Helsgaun, K. 2009. “General k-opt Submoves for the Lin–Kernighan TSP Heuristic.” Mathematical Programming Computation 1 (2–3): 119–163.
   Google Scholar
• Helsgaun, K. 2014. Solving the Equality Generalized Traveling Salesman Problem using the Lin–Kernighan–Helsgaun Algorithm. Tech. Rep. December 2013, Roskilde University, Roskilde.
   Google Scholar
• Hoeft, J., and U. S. Palekar. 1997. “Heuristics for the Plate-cutting Traveling Salesman Problem.” IIE Transactions 29 (9): 719–731.
   Web of Science ®Google Scholar
• Imahori, S., M. Kushiya, T. Nakashima, and K. Sugihara. 2008. “Generation of Cutter Paths for Hard Material in Wire EDM.” Journal of Materials Processing Technology 206 (1–3): 453–461.
   Web of Science ®Google Scholar
• Jing, Y., and C. Zhige. 2013. “An Optimized Algorithm of Numerical Cutting-path Control in Garment Manufacturing.” Advanced Materials Research 796: 454–457.
   Google Scholar
• Kim, Y., K. Gotoh, and M. Toyosada. 2004. “Global Cutting-path Optimization Considering the Minimum Heat Effect with Microgenetic Algorithms.” Journal of Marine Science and Technology 9 (2): 70–79.
   Web of Science ®Google Scholar
• Kruskal, J. B. 1956. “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem.” Proceedings of the American Mathematical Society 7 (1): 48–50.
   Google Scholar
• Lee, M.-K., and K.-B. Kwon. 2006. “Cutting Path Optimization in CNC Cutting Processes using a Two-step Genetic Algorithm.” International Journal of Production Research 44 (24): 5307–5326.
   Web of Science ®Google Scholar
• Moreira, L., J. Oliveira, A. Gomes, and J. Ferreira. 2007. “Heuristics for a Dynamic Rural Postman Problem.” Computers & Operations Research 34 (11): 3281–3294.
   Web of Science ®Google Scholar
• Noon, C., and J. Bean. 1991. “An Efficient Transformation of the Generalized Traveling Salesmen Problem.” INFOR 31 (1): 1993.
   Web of Science ®Google Scholar
• Raggenbass, A., and J. Reissner. 1989. “Stamping – Laser Combination in Sheet Processing.” Annals of the CIRP 38 (1): 291–294.
   Google Scholar
• Raggenbass, A., and J. Reissner. 1991. “Automatic Generation of NC Production Plans in Stamping and Laser Cutting.” CIRP Annals - Manufacturing Technology 40 (1): 247–250.
   Google Scholar
• Srivastava, S. S., S. Kumar, R. C. Carg, and P. Sen. 1969. “Generalized Traveling Salesman Problem through n Sets of Nodes.” CORS 7: 97–101.
   Google Scholar
• Tarjan, R. E. 1977. “Finding Optimum Branchings.” Networks 7 (1): 25–35.
   Web of Science ®Google Scholar
• Vaupotic, B., M. Kovacic, M. Ficko, and J. Balic. 2006. “Concept of Automatic Programming of NC Machine for Metal Plate Cutting by Genetic Algorithm Method.” Journal of Achievements in Materials and Manufacturing Engineering 14 (1): 131–139.
   Google Scholar
• Veeramani, S., and D. Kumar. 1998. “Optimization of the Nibbling Operation on an NC Turret Punch Press.” International Journal of Production Research 36 (7): 1901–1916.
   Web of Science ®Google Scholar
• Wang, G. G., and S. Q. Xie. 2005. “Optimal Process Planning for a Combined Punch-and-laser Cutting Machine using Ant Colony Optimization.” International Journal of Production Research 43 (11): 2195-2216.
   Web of Science ®Google Scholar
• Xie, S. Q., J. Gan, G. G. Wang, and C. Vn. 2009. “Optimal Process Planning for Compound Laser Cutting and Punch using Genetic Algorithms.” International Journal of Mechatronics and Manufacturing Systems 2 (1/2): 20–38.
   Google Scholar
• Xie, S. Q., Y. L. Tu, J. Q. Liu, and Z. D. Zhou. 2001. “Integrated and Concurrent Approach for Compound Sheet Metal Cutting and Punching.” International Journal of Production Research 39 (6): 1095–1112.
   Web of Science ®Google Scholar
• Yang, W. B., Y. W. Zhao, J. Jie, and W. L. Wang. 2010. “An Effective Algorithm for Tool-path Airtime Optimization during Leather Cutting.” Advanced Materials Research 102: 373–377.
   Google Scholar