Optimizing Cutting Sequences and Paths for Common-Edge Nested Parts

COMPUTER-AIDED DESIGN(2023)

引用 0|浏览9
暂无评分
摘要
Different from the normal nesting algorithm, common -edge nesting reduces the spacing between parts, improves the utilization rate of the sheet, and shortens the processing time. Although commonedge nested parts may be useful in theory, they are not practical for large-scale production due to their cutting limitations. Existing research either did not consider all common cutting constraints or used graph theory methods for global common cutting path planning. However, due to cutting thermal effects and sheet deformation, it is difficult to use global common cutting path planning in actual processing. Therefore, this paper proposes a cutting sequence optimization algorithm for common -edge nested parts that consider all cutting constraints and proposes an algorithm for generating and optimizing common cutting paths. Experiments show that the common cutting path optimization algorithm proposed in this paper can reduce about 70% of the air path compared with commercial software. Furthermore, comparison by optical microscopy shows that the quality of the actual machined part is not inferior to that of the part machined according to the cut path generated by the commercial software. (c) 2023 Elsevier Ltd. All rights reserved.
更多
查看译文
关键词
Common cutting,Cutting path,Common-edge omission,Traveling salesman problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要