Tool's Path Optimization for CNC Cutting Machines

The problem of tool’s path optimization for CNC cutting machines is considered. This problem appears at designing of optimum control programs for sheet cutting equipment. For standard cutting technique (i.e. “along a closed contour”) the optimization problem can be reduced to travelling salesman problem if only one point for tool’s switching on can be used. For the first time the problem of tool’s path optimization for more general case is formalized. This case assumes that several possible points for tool’s switching on can be used. On set of admissible solutions the metric is defined. It allows developers to apply all local search algorithms and other methods used in discrete optimization.

[1]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[2]  Y. Kochetov Computational bounds for local search in combinatorial optimization , 2008 .

[3]  V.D. Frolovsky,et al.  Ant colony approach to defining Hamilton cycle on segments , 2005, Proceedings. The 9th Russian-Korean International Symposium on Science and Technology, 2005. KORUS 2005..

[4]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[5]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[6]  Tatiana Panyukova Eulerian Cover with Ordered Enclosing for Flat Graphs , 2007, Electron. Notes Discret. Math..