[10] [10] PETUNIN A. General model of tool path problem for the CNC sheet cutting machines［J］. IFAC-PapersOnLine, 2019, 52(13): 2662-2667.

[11] [11] PETUNIN A A, STYLIOS C. Optimization models of tool path problem for CNC sheet metal cutting machines［J］. IFAC-PapersOnLine, 2016, 49(12): 23-28.

[12] [12] PETUNIN A, TAVAEVA A. The dependence of actual laser cutting speed on CNC sheet equipment on number of NC program commands for metal grades 1.011 4 and AWAlMg3［J］. Journal of Physics: Conference Series, 2020, 1527(1): 012013.

[13] [13] HU Q R, LIN Z W, LIU J H, et al. Process information transferring for cutting paths in laser manufacturing［J］. The International Journal of Advanced Manufacturing Technology, 2022, 121(9): 6937-6950.

[14] [14] TAVAEVA A, PETUNIN A, UKOLOV S, et al. A cost minimizing at laser cutting of sheet parts on CNC machines［M］. Communications in computer and information science. Cham: Springer International Publishing, 2019: 422-437.

[15] [15] DEWIL R, VANSTEENWEGEN P, CATTRYSSE D. A review of cutting path algorithms for laser cutters［J］. The International Journal of Advanced Manufacturing Technology, 2016, 87(5): 1865-1884.

[16] [16] LEVICHEV N, COSTA RODRIGUES G, DEWIL R, et al. Anticipating heat accumulation in laser oxygen cutting of thick metal plates［J］. Journal of Laser Applications, 2020, 32(2): 022018.

[17] [17] LEVICHEV N, TOMS GARCA A, DEWIL R, et al. A virtual sensing approach for quality and productivity optimization in laser flame cutting［J］. The International Journal of Advanced Manufacturing Technology, 2022, 121(9): 6799-6810.

[18] [18] LEVICHEV N, RODRIGUES G C, DUFLOU J R. Real-time monitoring of fiber laser cutting of thick plates by means of photodiodes［J］. Procedia CIRP, 2020, 94: 499-504.

[19] [19] MEJIA D, MORENO A, ARBELAIZ A, et al. Accelerated thermal simulation for three-dimensional interactive optimization of computer numeric control sheet metal laser cutting［J］. Journal of Manufacturing Science and Engineering, 2018, 140(3): 031006.

[20] [20] PETUNIN A A, POLYSHUK E G, CHENTSOV P A, et al. The termal deformation reducing in sheet metal at manufacturing parts by CNC cutting machines［J］. IOP Conference Series: Materials Science and Engineering, 2019, 613(1): 012041.

[21] [21] SENNIAPPAN KARUPPUSAMY N, KANG B Y. Minimizing airtime by optimizing tool path in computer numerical control machine tools with application of A* and genetic algorithms［J］. Advances in Mechanical Engineering, 2017, 9(12): 168781401773744.

[22] [22] KANDASAMY V A, UDHAYAKUMAR S. Effective location of micro joints and generation of tool path using heuristic and genetic approach for cutting sheet metal parts［J］. International Journal of Material Forming, 2020, 13(2): 317-329.

[23] [23] HU Q R, LIN Z W, FU J Z. A robust fast bridging algorithm for laser cutting［J］. The International Journal of Advanced Manufacturing Technology, 2022, 121(3): 2083-2094.

[24] [24] PETUNIN A A. Modeling of tool path for the CNC sheet cutting machines［C］//AIP conference proceedings, June 8-13, 2015, Sozopol, Bulgaria. Maryland: American Institute of Physics, 2015, 1690(1): 060002.

[25] [25] AMARO B, Jr, SANTOS M C, DE CARVALHO G N, et al. Metaheuristics for the minimum time cut path problem with different cutting and sliding speeds［J］. Algorithms, 2021, 14(11): 305.

[26] [26] SILVA E F, OLIVEIRA L T, OLIVEIRA J F, et al. Exact approaches for the cutting path determination problem［J］. Computers & Operations Research, 2019, 112: 104772.

[27] [27] HOEFT J, PALEKAR U S. Heuristics for the plate-cutting traveling salesman problem［J］. IIE Transactions, 1997, 29(9): 719-731.

[28] [28] VEERAMANI D, KUMAR S. Optimization of the nibbling operation on an NC turret punch press［J］. International Journal of Production Research, 1998, 36(7): 1901-1916.

[29] [29] LEE M K, KWON K B. Cutting path optimization in CNC cutting processes using a two-step genetic algorithm［J］. International Journal of Production Research, 2006, 44(24): 5307-5326.

[30] [30] PETUNIN A A, POLISHCHUK E G, UKOLOV S S. On the new algorithm for solving continuous cutting problem［J］. IFAC-PapersOnLine, 2019, 52(13): 2320-2325.

[31] [31] ZHANG Z C, YANG J L. A discrete cuckoo search algorithm for traveling salesman problem and its application in cutting path optimization［J］. Computers & Industrial Engineering, 2022, 169: 108157.

[32] [32] OLIVEIRA L T, SILVA E F, OLIVEIRA J F, et al. Integrating irregular strip packing and cutting path determination problems: A discrete exact approach［J］. Computers & Industrial Engineering, 2020, 149: 106757.

[33] [33] VERKHOTUROV M, PETUNIN A, VERKHOTUROVA G, et al. Simulating thermal sheet cutting of figured parts［J］. IFAC-PapersOnLine, 2022, 55(10): 595-600.

[38] [38] SHERIF S U, JAWAHAR N, BALAMURALI M. Sequential optimization approach for nesting and cutting sequence in laser cutting［J］. Journal of Manufacturing Systems, 2014, 33(4): 624-638.

[39] [39] ZHOU Y M, XU W Q, FU Z H, et al. Multi-neighborhood simulated annealing-based iterated local search for colored traveling salesman problems［J］. IEEE Transactions on Intelligent Transportation Systems, 2022, 23(9): 16072-16082.

[41] [41] LI J, ZHOU M, SUN Q, et al. Colored traveling salesman problem［J］. IEEE Transactions on Cybernetics, 2015, 45(11): 2390-2401.

[42] [42] LI J, MENG X H, ZHOU M C, et al. A two-stage approach to path planning and collision avoidance of multibridge machining systems［J］. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2017, 47(7): 1039-1049.

[43] [43] MENG X H, LI J, ZHOU M C, et al. Population-based incremental learning algorithm for a serial colored traveling salesman problem［J］. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2018, 48(2): 277-288.

[44] [44] HAJAD M, TANGWARODOMNUKUN V, JATURANONDA C, et al. Laser cutting path optimization using simulated annealing with an adaptive large neighborhood search［J］. The International Journal of Advanced Manufacturing Technology, 2019, 103(1): 781-792.

[45] [45] CHENTSOV A, CHENTSOV P, PETUNIN A, et al. Routing problems: Constraints and optimality［j］. IFAC-PapersOnLine, 2016, 49(12): 640-644.

[46] [46] CHENTSOV A G, CHENTSOV P A, PETUNIN A A, et al. Model of megalopolises in the tool path optimisation for CNC plate cutting machines［J］. International Journal of Production Research, 2018, 56(14): 4819-4830.

[47] [47] DEWIL R, VANSTEENWEGEN P, CATTRYSSE D, et al. An improvement heuristic framework for the laser cutting tool path problem［J］. International Journal of Production Research, 2015, 53(6): 1761-1776.

[48] [48] HAJAD M, TANGWARODOMNUKUN V, JATURANONDA C, et al. Laser cutting path optimization with minimum heat accumulation［J］. The International Journal of Advanced Manufacturing Technology, 2019, 105(5): 2569-2579.

[49] [49] CHENTSOV P A, PETUNIN A A. Tool routing problem for CNC plate cutting machines［J］. IFAC-PapersOnLine, 2016, 49(12): 645-650.

[53] [53] EAPEN N A, HECKENDORN R B. Cutting path optimization for an automatic cutter in polynomial time using a 3/2 approximation algorithm［J］. The International Journal of Advanced Manufacturing Technology, 2021, 113(11): 3667-3679.

[54] [54] MAKAROVSKIKH T A, PANYUKOV A V, SAVITSKY E A. Mathematical models and routing algorithms for CAM of technological support of cutting processes［J］. IFAC-PapersOnLine, 2016, 49(12): 821-826.

[55] [55] MAKAROVSKIKH T A, PANYUKOV A V, SAVITSKIY E A. Mathematical models and routing algorithms for economical cutting tool paths［J］. International Journal of Production Research, 2018, 56(3): 1171-1188.

[56] [56] MAKAROVSKIKH T A, PANYUKOV A V, SAVITSKIY E A. Mathematical models and routing algorithms for CAD technological preparation of cutting processes［J］. Automation and Remote Control, 2017, 78(5): 868-881.

[57] [57] PETUNIN A, KHACHAY M, UKOLOV S, et al. Using PCGTSP algorithm for solving generalized segment continuous cutting problem［J］. IFAC-PapersOnLine, 2022, 55(10): 578-583.

[58] [58] RODRIGUES A M, FERREIRA J S. Cutting path as a rural postman problem: Solutions by memetic algorithms［J］. International Journal of Combinatorial Optimization Problems and Informatics, 2012, 3(1): 31-46.