关键词: 加工路径优化, 变长度染色体, 遗传算法, 旅行商问题, 数控加工

Abstract: The problem of machining path optimization is a special Traveling Salesman Problem（TSP），to solve this problem，the machining paths are sorted into a series of machining elements such as point，line segment，curve and close curve，and an approach for it’s optimization based on variable-length genome genetic algorithm is presented.In this algorithm，each machining element is represented by some points which are encoded into a combination of an index and its attribute，and some kinds of lines can be cut and spliced by the crossover and mutation operation，thus the machining paths can be further optimized.Simulation results show that this approach is effective for the problem of machining paths optimization，it can dramatically shorten machining paths.

Key words: machining path optimization, variable-length genome, Genetic Algorithm（GA）, Traveling Salesman Problem（TSP）, NC machining