Global Torch Path Generation for 2-D Laser Cutting Process using Simulated Annealing
暂无分享,去创建一个
Guk-chan Han | Suck-joo Na | S. Na | G. Han
[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 .