摘要
钣金件切割路径优化问题类似于TSP问题,但是路径优化中的零件却不能像TSP问题中的城市一样可以作为点来处理。首先对拍样图中的零件大小进行分类,以遗传算法为基础对排样图中的较大零件生成切割顺序,然后应用改进的最近插入法将未进入排序的较小零件进行插入,最后应用打孔点选择方法动态地选择符合工艺的切割起始点。本方法很好的满足了生产工艺对顺着切、避免频繁抬刀和割嘴碰撞等问题,同时也获得了较短的切割路径,提高了切割效率和质量。
Sheet metal cutting path optimization problems is similar to the TSP problem,but the part is not like the city in a TSP problem that can be handled as a point.The parts are classified according to the size of them,and generate cutting sequence for the big parts with the improved genetic algorithm,then insert unsorted small parts into sequence with improved nearest insertion,finally choosing cutting starting point dynamically with punch point selection method.It is not only following the cutting process requirements of avoiding frequent cutting nozzle and avoiding collision but also getting a shorter cutting path.
出处
《机械设计与制造》
北大核心
2014年第3期34-36,40,共4页
Machinery Design & Manufacture
基金
江苏省科技支撑计划项目(BE2010170)
关键词
切割路径优化
遗传算法
最近插入法
打孔点选择
Cutting Path Optimization
Genetic Algorithm
Nearest Insertion
Punch Point Selection
