An improvement heuristic framework for the laser cutting tool path problem

This paper deals with generating cutting paths for laser cutting machines by representing a tool path in a novel way. Using the new representation, the tool path problem can be viewed as finding a partitioning of contours which minimises the sum of the costs of a rooted directed minimum spanning tree to connect the partitions and the costs of a generalised travelling salesman problem (GTSP) solutions within each partition. Using Edmond–Liu’s algorithm to solve the arborescence problem, an improved Lin–Kernighan heuristic to solve the GTSP and a heuristic-repartitioning approach, tool paths can be generated that are 4.2% faster than those generated by an existing tool path construction heuristic.

[1]  Udatta S. Palekar,et al.  Heuristics for the plate-cutting traveling salesman problem , 1997 .

[2]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[3]  Paul K. Wright,et al.  Toolpath optimization for minimizing airtime during machining , 2003 .

[4]  Manfred Geiger,et al.  Laser beam cutting , 1995 .

[5]  Mirko Ficko,et al.  Concept of automatic programming of NC machine for metal plate cutting by genetic algorithm method , 2006 .

[6]  Yanwei Zhao,et al.  An Effective Algorithm for Tool-Path Airtime Optimization during Leather Cutting , 2010 .

[7]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[8]  Keld Helsgaun,et al.  Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm , 2015, Mathematical Programming Computation.

[9]  José Fernando Oliveira,et al.  Heuristics for a dynamic rural postman problem , 2007, Comput. Oper. Res..

[10]  D. Veeramani,et al.  Optimization of the nibbling operation on an NC turret punch press , 1998 .

[11]  S. Q. Xie,et al.  Optimal process planning for a combined punch-and-laser cutting machine using ant colony optimization , 2005 .

[12]  Chen Chao,et al.  The Application of Fuzzy Comprehensive Evaluation in the Bias Cut Fabric Choice , 2013 .

[13]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[14]  Pieter Vansteenwegen,et al.  Generating tool paths for laser cutting machines , 2012 .

[15]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[16]  Zhi Ge Chen,et al.  An Optimized Algorithm of Numerical Cutting-Path Control in Garment Manufacturing , 2013 .

[17]  J. Reissner,et al.  Stamping — Laser Combination in Sheet Processing , 1989 .

[18]  Masahiro Toyosada,et al.  Global cutting-path optimization considering the minimum heat effect with microgenetic algorithms , 2004 .

[19]  Yiliu Tu,et al.  Integrated and concurrent approach for compound sheet metal cutting and punching , 2001 .

[20]  Dirk Cattrysse,et al.  Construction heuristics for generating tool paths for laser cutters , 2014 .

[21]  G. Gary Wang,et al.  Optimal process planning for compound laser cutting and punch using Genetic Algorithms , 2009 .

[22]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

[23]  Dirk Cattrysse,et al.  Cutting Path Optimization Using Tabu Search , 2011 .

[24]  Moon-Kyu Lee,et al.  Cutting path optimization in CNC cutting processes using a two-step genetic algorithm , 2006 .

[25]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[26]  J. Reissner,et al.  Automatic Generation of NC Production Plans in Stamping and Laser Cutting , 1991 .

[27]  Suck-Joo Na,et al.  A study on torch path planning in laser cutting processes part 1: Calculation of heat flow in contour laser beam cutting , 1999 .

[28]  Robert S. Garfinkel,et al.  On crossings, the Crossing Postman Problem, and the Rural Postman Problem , 1999, Networks.

[29]  Suck-Joo Na,et al.  A study on torch path planning in laser cutting processes part 2: Cutting path optimization using simulated annealing , 1999 .

[30]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[31]  Kokichi Sugihara,et al.  Generation of cutter paths for hard material in wire EDM , 2008 .