An Effective Algorithm for Tool-Path Airtime Optimization during Leather Cutting

Abstract

Tool-path airtime optimization problem during multi-contour processing in leather cutting is regarded as generalized traveling salesman problem. A hybrid intelligence algorithm is proposed. The improved genetic simulated annealing algorithm is applied to optimize cutting path selected arbitrarily firstly, and an optimal contour sequence is founded, then problem is changed into multi- segment map problem solved with dynamic programming algorithm. The algorithm's process and its various parameters are given simultaneously, and its performance is compared with simulated annealing and standard genetic algorithm alone. The results show that the algorithm is more effective.