摘要
平面切割中的文件往往是经由排样软件处理后的DXF文件,如果根据DXF文件中图元顺序初步生成的加工轨迹作为切割加工的顺序,那么将导致空行程增多,生产效率降低,并且加大设备损耗。提出一种基于动态旅行商问题(DTSP)模型的贪婪算法对切割路径进行优化,并通过运算实例说明了本算法的有效性。
The file of a plane cutting is often a DXF file processed by layout so[tware, using the trajectory generated by DXF iile sequence as cutting order will lead to the increase of empty travel, which will make the production efficiency lower and lead to the equipmentrs wear and tear. In this paper, a greedy algorithm based on dynamic traveling salesman problem （DTSP） model is proposed, which is used to optimize the cutting path, and the effectiveness of the algorithm is verified through a calculation example.
出处
《机械工程与自动化》
2017年第5期87-88,共2页
Mechanical Engineering & Automation
基金
广东省应用型科技研发专项资金项目(2015B090922003)
佛山市科技创新团队项目(2015IT100072)
关键词
切割路径优化
动态旅行商问题
贪婪算法
cutting path optimization
dynamic traveling salesmen problem
greedy algorithm
