Autosoft Journal

Online Manuscript Access


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


Authors



Abstract

Recently 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 can be obtained in a reasonable time. Several examples are represented to illustrate the method.


Keywords


Pages

Total Pages: 12
Pages: 97-108

DOI
10.1080/10798587.1998.10750725


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways


Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Published

Volume: 4
Issue: 2
Year: 1998

Cite this document


References

M. Averbuch, “Computer Aided Production Management - Our Way.” Sheet Metal Industries, pp. 213–215, April, 1990.

Manber U. J. of Manufacturing Systems 3.1 (1984) https://doi.org/10.1016/0278-6125(84)90024-4

Jackson, Steven D., and Ravi O. Mittal. "Automatic Generation of 2-Axis Laser-Cutter NC Machine Program and Path Planning from CAD." Computers in Industry 21.2 (1993): 223-231. Crossref. Web. https://doi.org/10.1016/0166-3615(93)90138-Q

Laporteo G. European J. Operations Research https://doi.org/10.1016/0377-2217(92)90138-Y

Langevin, André, François Soumis, and Jacques Desrosiers. "Classification of Travelling Salesman Problem Formulations." Operations Research Letters 9.2 (1990): 127-132. Crossref. Web. https://doi.org/10.1016/0167-6377(90)90052-7

J. K. Lenstra and A. H. G. Rinnooy Kan, “Some Simple Applications of the Traveling Salesman Problem,” Operational Research Quartely, 26(4), pp. 717–733, 1975.

Garfinkel, Robert S. "Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems." Operations Research 25.5 (1977): 741-751. Crossref. Web. https://doi.org/10.1287/opre.25.5.741

D. Schuocker, “Laser Cutting, The Industrial Laser Annual Handbook, pp. 87–107, 1986 Ed.

A. Hillebrand, I. Decker and H. Wohlfahrt, “Calculation of Workpiece Heating During Contour Cutting by Laser Beam with the Finite Element Method,” Schweiβen und Schneiden, Vol.45, pp. 487–490, 1993.

Raggenbass, A., and J. Reissner. "Stamping — Laser Combination in Sheet Processing." CIRP Annals 38.1 (1989): 291-294. Crossref. Web. https://doi.org/10.1016/S0007-8506(07)62706-1

Rutenbar, R.A. "Simulated Annealing Algorithms: An Overview." IEEE Circuits and Devices Magazine 5.1 (1989): 19-26. Crossref. Web. https://doi.org/10.1109/101.17235

Cenrny V. J. Opt. Theory and App. 45.1 (1985)

Bland, J.A., and G.P. Dawson. "Tabu Search and Design Optimization." Computer-Aided Design 23.3 (1991): 195-201. Crossref. Web. https://doi.org/10.1016/0010-4485(91)90089-F

J. J. Hopfield and D. W. Tank, “Neural Computation of Decisions in Optimization Problems,” Biol. Cybern, 52, pp. 141–152, 1985.

Mehmet Ali M.K. IEEE Trans, on Neural Networks 4.6 (1993) https://doi.org/10.1109/72.286889

Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. "Optimization by Simulated Annealing." Science 220.4598 (1983): 671-680. Crossref. Web. https://doi.org/10.1126/science.220.4598.671

T. M. Kwon and Y. Lu, “A Comparative Study of the Traveling Salesman Problem,” Proc. Artificial Neural Networks in Eng.(ANNIE”91) Conf, pp. 889–894, Nov. 1991.

C. C. Doumanidis, “Real-Time Simulated Annealing Techniques for Motion Control in Manufacturing Process,” Proc. 1994 Summer Computer Simulation Conf., pp. 613–618, July 1994.

Metropolis N. J. Chemical Physics 20.1334 (1953) https://doi.org/10.1063/1.1699114

Cenrny V. J. Opt. Theory and App. https://doi.org/10.1007/BF00940812

E. H. L. Aarts and J. H. M. Korst, “Simulated Annealing and Bolzmann Machines,” John Wiley, New York, pp. 13–114, 1989.

V. Press, B.P. Flannery, S. A. Teukolsky and W. T. Vetterling, “Numerical Recipes in C: The Art of Scientific Computing,” Cambridge University Press, New York, 1990.

Lin S. The Bell Syst. Tech. J. https://doi.org/10.1002/j.1538-7305.1965.tb04146.x

JOURNAL INFORMATION


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present




CONTACT INFORMATION


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048
EMAIL: tsiepress@gmail.com
WEB: http://www.wacong.org/tsi/