Construction heuristics for generating tool paths for laser cutters

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
• Dewil, R., P. Vansteenwegen, and D. Cattrysse. 2011. “Cutting Path Optimization Using Tabu Search.” Key Engineering Materials 473: 739–748.
   Google Scholar
• Drexl, M. 2007. “On Some Generalized Routing Problems.” PhD Thesis, Rheinisch-Westfälischen Technischen Hochschule Aachen.
   Google Scholar
• Dror, M. 1999. “Polygon Plate-cutting with a Given Order.” IIE Transactions 31 (3): 271–274.
   Web of Science ®Google Scholar
• Erdös, G., Z. Kemény, A. Kovács, and J. Váncza. 2013. “Planning of Remote Laser Welding Processes.” In Forty Sixth CIRP Conference on Manufacturing Systems 2013, Lisbon, Vol. 7, January, 222–227.
   Google Scholar
• Fischetti, M., J. J. S. Gonzalez, and P. Toth. 1995. “A Branch-and-cut Algorithm for the Symmetric Generalized Travelling Salesman Problem.” Operations Research 45 (3): 378–394.
   Web of Science ®Google Scholar
• Han, G. C., and S. J. Na. 1999. “A Study on Torch Path Planning in Laser Cutting Processes Part 2: Cutting Path Optimization Using Simulated Annealing.” Journal of Manufacturing Systems 1 (1): 62–70.
   Google Scholar
• Hatwig, J., M. F. Zaeh, and G. Reinhar. 2012. “An Automated Path Planning System for a Robot with a Laser Scanner for Remote Laser Cutting and Welding.” In Proceedings of 2012 IEEE International Conference on Mechatronics and Automation, Chengdu, 1323–1328.
   Google Scholar
• Helsgaun, K. 2000. “An Effective Implementation of the LinKernighan Traveling Salesman Heuristic.” European Journal of Operational Research 126 (1): 106–130.
   Web of Science ®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 Numberical 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
• Kumar, D. V. S. 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
• 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
• Manber, U., and S. Israni. 1984. “Pierce Point Minimization and Optimal Torch Path Determination in Flame Cutling.” Journal of Manufacturing Systems 3 (1): 81–89.
   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
• Rao, Y., G. Huang, P. Li, X. Shao, and D. Yu. 2006. “An Integrated Manufacturing Information System for Mass Sheet Metal Cutting.” The International Journal of Advanced Manufacturing Technology 33 (5–6): 436–448.
   Web of Science ®Google Scholar
• Renaud, J., and F. F. Boctor. 1998. “An Efficient Composite Heuristic for the Symmetric Generalized Traveling Salesman Problem.” European Journal Of Operational Research 108 (3): 571–584.
   Web of Science ®Google Scholar
• Rodrigues, A. M., and F. J. Soeiro. 2012. “Cutting Path as a Rural Postman Problem: Solutions by Memetic Algorithms.” Journal of Combinatorial Optimization Problems and Informatics 3 (1): 22–37.
   Google Scholar
• Rosenkrantz, D. J., R. E. Stearns, and P. M. Lewis. 1974. “Approximate Algorithms for the Traveling Salesman Problem.” In Fifteenth Annual IEEE Symposium on Switching and Automata Theory, New Orleans, LA, 33–42.
   Google Scholar
• Sherali, H. D., S. Sarin, and A. Boothra. 2005. “New Tighter Polynomial Length Formulations for the Asymmetric Traveling Salesman Problem With and Without Precedence Constraints.” Operations Research Letters 33 (1): 62–70.
   Web of Science ®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
• Verlinden, B., D. Cattrysse, H. Crauwels, and J. Duflou. 2007. “Sequencing and Scheduling in the Sheet Metal Shop.” In Multiprocessor Scheduling: Theory and Applications, edited by E. Levner, December, Chap. 20, 345–380. Vienna: Itech Education.
   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, and G. G. Wang. 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
• 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–104: 373–377.
   Google Scholar