双链基因的退火算法用于激光切割路径优化  

Optimization of Laser Cutting Path Using Annealing Algorithm with Double-Chain Gene

作　　者：常翠芝[1] 高文良[2] 严蓬辉 李自成[1] 黄元峰[1] CHANG Cuizhi;GAO Wenliang;YAN Penghui;LI Zicheng;HUANG Yuanfeng(School of Electrical and Information Engineering,Wuhan Institute of Technology,Wuhan 430205,China;School of Mathematics and Physics,Wuhan Institute of Technology,Wuhan 430205,China;School of Mechanical and Electrical Engineering,Wuhan Institute of Technology,Wuhan 430205,China)

机构地区：[1]武汉工程大学电气信息学院,湖北武汉430205 [2]武汉工程大学数理学院,湖北武汉430205 [3]武汉工程大学机电工程学院,湖北武汉430205

出　　处：《武汉工程大学学报》2023年第3期331-336,共6页Journal of Wuhan Institute of Technology

基　　金：湖北省教育厅科学技术研究计划指导性项目(B2017059)。

摘　　要：为了缩短激光切割路径中的空行程,提高加工效率,同时避免在切割过程中损坏设备,本文分析了切割图元及其数学描述,将切割路径优化问题归结为广义旅行商问题,并提出了一种基于切割路径双链基因表示的模拟退火算法,MATLAB仿真结果表明该方法可以有效地解决上述问题。最后将优化路径和计算机辅助制造里自带优化软件规划的路径作比较,证明本方法可明显缩短激光头的空行程长度,并有效避免了打刀现象。To improve the processing efficiency in the laser cutting,it is necessary to shorten the noncutting stroke path and avoid damaging the equipment during the cutting process.The cutting element and its mathematical description were analyzed,and the cutting path optimization problem is formulated as the generalized traveling salesman problem.The simulated annealing(SA)algorithm was proposed based on the double-chain gene representation of the cutting path.The MATLAB simulation results show that SA algorithm can effectively solve the above problems.Finally,comparing the optimized path with the path planned by the optimization software in computer aided manufacturing,it is proved that SA algorithm can significantly shorten the laser noncutting stroke length of and avoid the phenomenon of cutting colliding.

关 键 词：激光切割 路径优化 模拟退火算法 计算机辅助制造 

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