激光切割工艺路径的双向蚁群算法优化  

Optimization on laser cutting process path based on bidirectional ant colony algorithm

作　　者：王娜[1] 王海艳[1] 姜云春 Wang Na;Wang Haiyan;Jiang Yunchun(Department of Mechanical and Electrical Engineering,Institute of Intelligent Manufacturing,Qingdao Huanghai University,Qingdao 266427,China)

机构地区：[1]青岛黄海学院,智能制造学院,机电工程系,山东青岛266427

出　　处：《锻压技术》2020年第11期30-35,共6页Forging & Stamping Technology

基　　金：山东省重点研发计划项目(2019GGX105001);山东省博士后创新项目专项资金项目(201702038)。

摘　　要：为了减少激光切割过程中的空行路程和切割时间,提出了基于广义旅行商模型和双向蚁群算法的激光切割工艺路径优化方法。建立了切割轮廓和特征点的概念,基于切割轮廓和特征点建立了优化切割路径的广义旅行商模型。提出了双向蚁群算法,在传统蚁群算法中加入了新的引导信息,针对激光切割路径的特殊性,对正向和反向搜索蚁群的引导信息进行了不同的设计;为了防止出现"打刀"问题,规定了备选城市集合的确定规则。在排样完毕的板材上进行验证,与传统蚁群算法规划的切割路径相比,双向蚁群算法规划的切割路径的空行路程减少了16.44%、切割时间减少了3.18%,证明了双向蚁群算法的有效性和优越性。To reduce empty stroke and cutting time in laser cutting process,the optimization method of laser cutting process path based on generalized travel salesman model and bidirectional ant colony algorithm was proposed.Then,the concepts of cutting profile and feature point were built,and the generalized travel salesman model of cutting path optimization was built based on cutting profile and feature point.Furthermore,the bidirectional ant colony algorithm was put forward by introducing new guiding information to traditional ant colony algorithm,and for the particularity of laser cutting path,the guiding information of searching ant colony in forward and reverse directions was designed respectively.In order to avoid knife-touching problem,the certainty rules of alternative city set was specified.Finally,the experiment was executed on the layout plate.And compared with the cutting path planned by traditional ant colony algorithm,the empty stroke of cutting path planned by the bidirectional ant colony algorithm decreases by 16.44%,and the cutting time decreases by 3.18%,which proves the validity and priority of bidirectional ant colony algorithm.

关 键 词：激光切割路径 广义旅行商问题 双向蚁群算法 空行路程 切割时间 特征点选取 

分 类 号：TH164[机械工程—机械制造及自动化] TG458[金属学及工艺—焊接]