基于蚁群算法的矩形件切割路径优化  

Optimizing the Cutting Path of Rectangle Stock Based on Ant Colony Algorithm

作　　者：张伟[1] 安鲁陵[1] 张臣[1] 邵晓明[1] 

机构地区：[1]南京航空航天大学机电学院,南京210016

出　　处：《机械科学与技术》2011年第3期390-393,共4页Mechanical Science and Technology for Aerospace Engineering

基　　金：南京航空航天大学专项科研项目资助

摘　　要：针对矩形件外轮廓切割问题,设计了基于蚁群算法的切割加工过程中空行程路径优化方法,开发了相应软件模块。该方法在矩形件外轮廓切割路线简化的基础上,结合旅行商问题的求解对切割起始点顺序进行优化,避免出现矩形件在切割过程中外轮廓被重复切割的问题。算例表明:该算法可显著减少空行程路径的总长度,有效缩短切割加工过程中的辅助时间,提高加工效率。For the rectangle outline cutting problem, a method of cutting path optimization based on ant colony algorithm is designed and the corresponding software module has been developed. Based on TSP （Traveling Salesman Problem） ,this method optimizes the starting point of the cutting to avoid cutting the rectangular outline in the cutting process twice. Examples show that this algorithm can significantly reduce the total length of moving paths to effectively shorten the auxiliary cutting time and improve the efficiencv of aided manufacturing.

关 键 词：矩形件切割 路径优化 空行程 蚁群算法 

分 类 号：TG48[金属学及工艺—焊接]