分步求解切割路径的优化算法研究  

Research on Optimization Algorithm for Solving the Cutting Path Step by Step

作　　者：徐晟逸 苏平[1] 邓晖飞 

机构地区：[1]广东工业大学机电工程学院,广东广州510006

出　　处：《机电工程技术》2014年第9期81-84,103,共5页Mechanical & Electrical Engineering Technology

摘　　要：为实现切割路径优化,提升加工效率,提出了分步求解切割路径的思想。第一步:引用坐标中心点概念,确定所有图案切割点,实现切割路径优化问题向旅行商问题的转化。第二步:设计遗传算子,在MATLAB下实现遗传算法对旅行商问题的仿真求解。与采用最邻近算法确定切割点方法的结果对比,前者最优路径(8 845.2 mm)为后者最优路径(9 652.0 mm)的91.6%,证明了提出算法的可行性。To achieve the cutting path optimization and improve processing efficiency, this paper proposes a thought of solve the cutting path step by step. The first step is to cite the conception of center point of coordinates, determine all pattern’s cutting point to achieve the transformation of the cutting path optimization problem to the TSP. The second step is to design the genetic operators and realize the simulation of solving the TSP by GA in the MATLAB. Compared the method using the nearest neighbor algorithm to determine all the cutting points, the best path（8845.2mm） of use the center point of coordinates is 91.6%of the latter’s best path （9655.8mm）.Demonstrated the feasibility of the proposed algorithm.

关 键 词：切割路径优化 旅行商问题 遗传算法 最邻近算法 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]