锻压技术

基于蚁群算法的激光切割工艺路径优化

英文标题：Optimization on laser cutting process path based on ant colony algorithm

作者：李世红袁跃兰刘绅绅饶运清

分类号：TH16;TG458

出版年,卷(期):页码：2019,44(4):69-72

摘要：

切割工艺路径规划是影响钣金激光切割效率的关键问题之一，钣金件的激光切割工艺路径优化问题可以转化为带有约束条件的广义旅行商问题（GTSP）。为了保证钣金激光切割质量、提高切割效率，在进行切割路径规划时必须满足顺着切、不跨区域切割、走空程时尽量不经过已切割区域等工艺要求。建立了以上述工艺要求为约束、以空行程最短为目标的优化模型。在算法设计与实现上，首先通过建立零件信息的预处理机制进行工艺约束处理，然后运用蚁群算法进行模型求解，最后通过实际算例证明了该方法的有效性，即能够在满足工艺约束的前提下获得较优的切割路径。

Path planning of cutting process is one of the key problems of affecting the laser cutting efficiency for sheet metal, and the path optimization problem of laser cutting process for sheet metal part can be transformed into a generalized traveling salesman problem （GTSP）with constraints. In order to ensure the laser cutting quality and efficiency, some technological requirements such as cutting along one direction, not cutting across the regions and going through the empty space as far as possible without passing through the cut area should be met during cutting path planning. And an optimization model with the above process requirements as the constraints and the shortest idle path as the target was established. In algorithm design and implementation, firstly, the processing of process constraints was achieved by setting up the pre-processing mechanism of part information, and then the above model was solved by ant colony algorithm. Finally, a case test shows that this method is effective, that is, the optimal cutting path can be obtained under the premise of satisfying the process constraints.

基金项目：

工信部智能制造专项子课题(工信厅装函［2017］468号)

李世红（1967-），女，工学学士，讲师 E-mail：1293998325@qq.com 通讯作者：饶运清（1968-），男，博士，教授 E-mail：ryq@hust.edu.cn

参考文献：

[1]徐路宁,王霄,张永康.激光切割板材的工艺处理[J].应用激光,2002, 22(6):533-538.

Xu L N, Wang X, Zhang Y K. Technological treaments of laser cutting for sheet [J]. Applied Laser, 2002, 22(6): 533-538.

[2]毕华丽. 激光切割技术中工艺技术的试验研究[D].大连：大连理工大学,2006.

Bi H L. Experiment Research on Key Technology of Laser Cutting Technology [D]. Dalian: Dalian University of Technology, 2006.

[3]李泳,张宝峰. 复杂轮廓激光切割路径优化算法的研究[J]. 天津理工大学学报,2007, 23(3):76-79.

Li Y, Zhang B F. Study on optimization algorithm of laser cutting path for complex contours [J]. Journal of Tianjin University of Technology, 2007, 23(3): 76-79.

[4]郭华锋,李菊丽,孙涛.激光切割技术的研究进展[J].徐州工程学院学报：自然科学版, 2015,30(4):71-78.

Guo H F, Li J L, Sun T. On the research progress of laser cutting technology [J]. Journal of Xuzhou Institute of Technology: Natural Science Edition, 2015, 30 (4): 71-78.

[5]Vladimir Dimitrijevi, Zoran ari. An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs[J]. Information Sciences, 1997, 102(1-4): 105-110.

[6]Oysu C, Bingul Z. Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing airtime during machining[J]. Engineering Applications of Artificial Intelligence, 2009, 22(3):389-396.

[7]谭阳. 求解广义旅行商问题的若干进化算法研究[D]. 广州：华南理工大学, 2013.

Tan Y. The Study of Several Evolutionary Algorithms for Solving Generalized Travelling Salesman Problem[D]. Guangzhou: South China University of Technology, 2013.

[8]Gong B C, Jiang T Y, Xu S Z, et al. An improved ant colony algorithm based on path optimization strategy for TSP[J]. Applied Mechanics and Materials, 2014, 543-547: 1681-1684.

[9]孙鑫. 二维激光切割路径优化研究[D]. 武汉：华中科技大学, 2012.

Sun X. Research on Path Optimization of Two Dimension Laser-cutting[D]. Wuhan:Huazhong University of Science and Technology, 2012.

[10]Marco Dorigo, Luca Maria Gambardella. Ant colonies for the travelling salesman problem[J]. BioSystems, 1997, 43(2): 73-81.

[11]郭平, 鄢文晋. 基于TSP问题的蚁群算法综述[J].计算机科学, 2007, 34(10):181-184,194.

Guo P, Yan W J. The review of ant colony algorithm based on TSP [J]. Computer Science, 2007, 34 (10): 181-184,194.

[12]刘天孚,程如意.带精英策略和视觉探测蚁群算法的机器人路径规划[J].计算机应用,2008, 28(1):92-93, 96.

Liu T F, Cheng R Y. Ant algorithm with elitist strategy and vision detection for mobile robot path planning [J]. Journal of Computer Applications, 2008, 28 (1): 92-93, 96.

服务与反馈：

【文章下载】【加入收藏】