网站首页期刊简介编委会过刊目录投稿指南广告合作征订与发行联系我们English
考虑桥连接的钣金切割件加工路径优化方法
英文标题:Process path optimization method on sheet metal cutting parts considered bridge connection
作者:张文斌1 廖小平1 马俊燕1 鲁娟2 
单位:1. 广西大学 2. 北部湾大学 
关键词:钣金切割 切割路径优化 桥连接 旅行者问题 蚁群算法 
分类号:TP391;TH164
出版年,卷(期):页码:2023,48(4):66-71
摘要:

 针对包含桥连接的钣金切割件加工路径问题,提出基于旅行商问题模型的钣金件切割路径优化方法,并确定了该方法下桥连接的定位。此方法针对钣金排样图,将轮廓基于图元特征拆分成Ni段子轮廓段加工图元,以遍历所有子轮廓段为目标规划切割路径,采用改进的蚁群算法获得包含桥连接定位点的切割路径,最后依据桥连接定位点确定全体桥连接位置。对排样好的钣金切割件进行仿真验证,并将含桥连接的传统广义旅行商问题切割方法与相关文献方法进行对比,表明了该方法能够有效地减少切割空程路径及切割过程中的启停次数,提高了加工效率。

 For the process path problem of sheet metal cutting parts including bridge connection, a cutting path optimization method for sheet metal parts based on the traveling salesman problem model was proposed, and the location of bridge connection under this method was determined. Then, for the sheet metal layout diagram, the contour was split into processing graphic elements of Ni sub-contour segments based on graphic element features, and the cutting path was planned with the goal of traversing all sub-contour segments. Furthermore, the cutting path including bridge connection positioning points was obtained by the improved ant colony algorithm, and the overall bridge connection positions were determined based on the bridge connection positioning points. Finally, the simulation verification of the well-arranged sheet metal cutting parts was tested, and the traditional generalized traveling salesman problem cutting method with bridge connection was compared with the related literature methods. The results show that this method can effectively reduce the cutting empty path and the number of starts and stops during the cutting process, which improving the processing efficiency.

基金项目:
国家自然科学基金资助项目(52165062);广西自然科学基金重点项目(2020JJD160004)
作者简介:
作者简介:张文斌(1996-),男,硕士研究生 E-mail:2411252636@qq.com 通信作者:鲁娟(1988-),女,博士,副教授 E-mail:lujuan3623366@163.com
参考文献:

 
[1]侯普良, 刘建群,高伟强.基于改进蚁群算法的激光切割加工路径优化研究
[J].机电工程,2019,36(6):653-657.


Hou P L,Liu J Q,Gao W Q. Optimization of laser cutting path based on improved ant colony algorithm
[J]. Journal of Mechanical & Electrical Engineering,2019,36(6):653-657.


[2]Eapen N A,Heckendorn R B. Cutting path optimization for an automatic cutter in polynomial time using a 3/2 approximation algorithm
[J]. Int. J. Adv. Manuf. Technol.,2021,113:3667-3679.


[3]Reginald D,Pieter V,Dirk C,et al. An improvement heuristic framework for the laser cutting tool path problem
[J]. International Journal of Production Research,2015,53(6):1761-1776.


[4]刘伟,刘志芳.人工智能技术的激光超高精密加工路径优化研究
[J].激光杂志,2022,43(12):206-210.

Liu W,Liu Z F. Research on path optimization of ultra-high precision laser Machining using artificial intelligence technology
[J]. Laser Journal,2022,43(12):206-210.


[5]刘山和, 钱晓明,楼佩煌,等.基于遗传蚁群混合算法的激光切割机路径优化
[J].机械制造与自动化,2016,45(6):92-95.

Liu S H,Qian X M,Lou P H,et al. Path optimization of laser cutting based on combination of genetic algorithm and ant algorithm
[J]. Machine Building & Automation,2016,45(6): 92-95.


[6]宋磊, 王欣欣,刘晓彦,等.激光切割工艺路径的双染色体遗传算法优化
[J].锻压技术,2021,46(10):119-125.

Song L,Wang X X,Liu X Y,et al.Optimization of double-chromosome genetic algorithm for laser cutting technology path
[J].Forging & Stamping Technology,2021,46(10):119-125.


[7]张青锋, 饶运清.工艺约束下的激光切割路径优化算法设计
[J].机械设计与制造,2014,(3):34-36,40.

Zhang Q F,Rao Y Q. A optimization algorithm of laser cutting path with process constrains
[J]. Machinery Design & Manufacture,2014,(3):34-36,40.


[8]陈婷,余小平,陈俊凤,等.基于平面不封闭图形切割的路径规划
[J].计算机与现代化,2019,288(8):39-43.

Chen T, Yu X P, Chen J F, et al. Path planning based on plane unclosed graphic cutting
[J]. Computer and Modernization,2019,288(8): 39-43.


[9]Kandasamy Vijay,Udhayakumar Saranya. Effective location of micro joints and generation of tool path using heuristic and genetic approach for cutting sheet metal parts
[J]. International Journal of Material Forming,2020,13:317-329.


[10]王铮, 杨卫波,王万良,等.基于量子进化算法的多轮廓路径优化
[J].计算机集成制造系统,2017,23(10):2128-2135.

Wang Z,Yang W B,Wang W L,et al. Path optimization for multi-contour based on quantum evolutionary algorithm
[J]. Computer Integrated Manufacturing Systems,2017,23(10): 2128-2135.


[11]陈婷, 余小平,陈俊凤,等.基于平面不封闭图形切割的路径规划
[J].计算机与现代化,2019,(8):39-43.

Chen T,Yu X P,Chen J F,et al. Path planning based on plane unclosed graphic cutting
[J]. Computer and Modernization,2019,(8):39-43.


[12]程志华, 吕炘宇.标准图元数控编程系统及其路径规划算法的研究与设计
[J].组合机床与自动化加工技术,2018,(10):77-79,84.

Cheng Z H,Lyu X Y. Research and design of the automatic numerical control programming system and its path planning algorithm
[J]. Modular Machine Tool & Automatic Manufacturing Technique,2018,(10):77-79,84.
服务与反馈:
本网站尚未开通全文下载服务】【加入收藏
《锻压技术》编辑部版权所有

中国机械工业联合会主管 北京机电研究所有限公司 中国机械工程学会塑性工程分会主办
联系地址:北京市海淀区学清路18号 邮编:100083
电话:+86-010-82415085 传真:+86-010-62920652
E-mail: fst@263.net(稿件) dyjsjournal@163.com(广告)
京ICP备07007000号-9