摘要
为了缩短割炬加工零件时间,利用图论中旅行商问题模型提出了一种改进的贪心遗传算法,并将其利用Object Arx在Auto CAD平台上实现。该算法从加工轮廓中提取特征点作为旅行商问题的城市,采用贪心交叉方式作为交叉准则、二点异位方式作为变异准则、颠倒变异与交叉的顺序,并利用轮盘赌选择父辈。该算法利用轮盘赌原理优化了第一座城市的选择,经实例仿真验证具有很好的效果,可以显著减少空行程,达到节约时间及成本的目的。
To reduce the time of cutting process,a new improved method based on greedy genetic algorithm is proposed to solve the traveling salesman problem( TSP),and realize it on Auto CAD platform using Object ARX. This method extracts feature points from the processing contour as the cities of TSP,uses greedy crossover method as crossing criterion,two point mutation method as variation criterion,reverses mutation and crossover in order,and uses the roulette wheel to select parents. This method optimizes the first city using roulette wheel. This method has been proved to have good results through simulation,it can significantly shorten the tool path,reduce process time and improve efficiency.
出处
《机电一体化》
2015年第3期20-23 30,30,共5页
Mechatronics
