Global Torch Path Generation for 2-D Laser Cutting Process using Simulated Annealing

ABSTRACTRecently the major objective of laser processing in production line is the precision or shape cutting of sheet metals. This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with irregular parts. In this paper, the basic object is a polygon(a many-sided figure) with holes. Under the constraint of the relative positions of parts enforced by nesting, the developed torch path algorithm generates feasible cutting paths. The objective of this work is to traverse this cutting contours with a minimum path length. The proposed torch path algorithm is based on a simulated annealing, that is an improved version of previously suggested TSP models. Since every piercing point of parts is not Fixed in advance, the algorithm solves an relaxed optimization problem with constraints. For solving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and annealing schedule were presented. In this way, a global solution ca...

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  William H. Press,et al.  Numerical Recipes in FORTRAN - The Art of Scientific Computing, 2nd Edition , 1987 .

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

[4]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[5]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.

[6]  Steven D. Jackson,et al.  Automatic generation of 2-axis laser-cutter NC machine program and path planning from CAD , 1993 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  U. Manber,et al.  Pierce point minimization and optimal torch path determination in flame cutting , 1984 .

[9]  Robert S. Garfinkel,et al.  Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems , 1977, Oper. Res..

[10]  G. Laporte The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[11]  André Langevin,et al.  CLASSIFICATION OF TRAVELING SALESMAN PROBLEM FORMULATIONS , 1988 .

[12]  J. A. Bland,et al.  Tabu search and design optimization , 1991, Comput. Aided Des..

[13]  A. Bisseret Towards computer-aided text production , 1990 .

[14]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[15]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[16]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .