基于遗传蚁群混合算法的激光切割机路径优化

摘要

Optimization of cutting path is a key issue in the laser cutting industry. The problem can be summarized into the general￣ized traveling salesman problem ( GTSP) . This paper uses the combination of Genetic Algorithm and Ant Algorithm ( GAAA) to solve the problem. It the algorithm,the shortest time distance is directly taken as objective function. The starting point and the cutting se￣quence of the profile are optimized at the same time,in order to make the solutions obtained by the algorithm quickly gather near the optimal solution without being trapped into local optimal solution. The initial information distribution of Ant Algorithm is generated,based on the fast random global search ability of Genetic Algorithm. In the Ant colony algorithm, MMAS Algorithm is used with the variation factors added to. Simulation result shows that it is used to obtain the perfect result.%激光切割机的路径优化问题是激光切割行业的一个关键问题，针对其特点将其归纳为广义旅行商问题，利用改进的遗传蚁群算法来求解该问题。算法以时间距离最短为目标函数，对轮廓切割顺序及轮廓切割起始点同时进行优化。为了让算法所得解能够快速聚集在最优解附近而又不至于陷入局部最优解，利用遗传算法快速随机的全局搜索能力来产生蚁群算法初期的信息素分布，蚁群算法采用最大最小蚂蚁算法同时在其加入变异因子。仿真结果表明取得了非常好的效果。