激光切割路径优化的双重编码改进遗传算法

Dual coding improved genetic algorithm for optimization of laser cutting path

针对激光切割路径优化的特点,将其归纳为旅行商问题,并利用改进遗传算法进行求解。为使优化更具实际意义,建立了考虑时间距离和热效应的多目标优化数学模型。改进的遗传算法采用双重编码对轮廓扫描顺序和各轮廓的起始点同时进行优化。在编码设计时,被切割件除考虑多边形情况外还考虑到圆及椭圆的情况,通过构建的适应函数将多目标函数转化为单目标优化问题,同时为提高算法的优化性能,适应函数采用动态控制,并改进了交叉与变异操作。仿真结果表明,该算法能有效地对激光切割路径进行优化。

The laser cutting path optimization was reduced to the traveling salesman problem and solved by improved genetic algorithm. To make this optimization more practical, a multi-objective mathematical op- timization model which has considered time distance and heating effect was made. In the improved genetic algorithm, the dual coding was adopted to optimize the scanning order and the starting point of the contour simultaneously, and in the design of coding, the circle and ellipse situation were taken into account in addi- tion to the polygonal. The multi-objective problem was transformed to single objective optimization prob- lem through the construction of fitness function. In order to improve the optimal performance of the algo- rithm, fitness function adopted dynamic control, the crossover and mutation operations were improved. The computation results show this algorithm can optimize the laser cutting path effectively.