共边排样件激光切割路径的规划

排样软件的应用使材料利用率得到了很大提高，然而后续切割软件若不能保证有效地切割零件、保证零件质量及提高生产率，则排样软件在材料利用率上获得的收益将丧失。基于图论学理论，建立了规则与非规则零件共边排样时激光切割路径规划的数学模型，给出了在充分考虑加工质量、加工效率、制造成本情况下的激光切割路径优化目标：打孔点最少以及切割中割嘴空行程最短。提出了满足激光切割工艺要求的三个切割路径优化算法：用于求解理想情况下共边切割路径优化问题的一个新的欧拉回路算法；基于奇度顶点完全图最小权最大匹配算法来求解一般情况下共边切割路径优化问题的算法；利用废料区域进一步减少打孔点的处理策略与求解算法。给出了各种算法的运行实例，验证了所提出的算法的有效性。

Nozzle Path Planning of Edge-Shared Nested Workpiece in Laser Cutting

Nesting software optimizes material yield, but if the parts cannot be cut efficiently, ensuring part quality and increased the throughput, the savings gained in material efficiency are lost. Based on graph theory, the mathematical model of nozzle path planning problem for the laser cutting of the edge shared nested regular or irregular parts is established in this paper. The optimization objective of the problem is defined as minimum pierce points and shortest vacant path of nozzle in edge shared cutting, which includes machining quality, efficiency and manufacturing cost. Three algorithms to solve the problem are presented that can meet the laser cutting technics. The first algorithm is a new Eulerian trail algorithm to solve the problem under ideal circumstances, The second algorithm uses the algorithm based on the minimum weight and maximum matching algorithms of complete graph with the vertices of odd degree to solve the problem under general circumstances, The third algorithm uses the scrap areas to investigate further reduction in the number of pierce points. Every sort of application instance of the three algorithms mentioned is presented and their validity is testified.