摘要
提出了一种基于分治法思想的加工路径优化算法。该算法将槽特征加工路径的优化近似为旅行商问题(TSP),根据槽的分布对TSP路径进行几何分区,分别应用正交路径法、最近邻算法等求解,并将结果合并为完整路径。最后通过实际应用验证了该算法实现简单,求解速度快,优化结果同人工编排的加工路径非常接近,具有可行性和有效性。
In order to improve the NC machining efficiency of frame sharp aircraft structures and reduce idle running of milling cutter when machining multiple pockets, we propose an optimization method of machining path based on the idea of divide-and-conquer. The optimization of pockets machining path is approximated to Traveling Salesman Problem （ TSP）, and geometric regions are marked off according to pockets distribution. Each path of a region is separately optimized by perpendicular path algorithm or nearest neighbor algorithm, ere, and then the paths are combined into a complete one. Finally, practical application proves that this method is easy to be implemented, the optimization is fast and the result is close to manual solution, so the method is feasible and effective.
出处
《机械科学与技术》
CSCD
北大核心
2008年第10期1253-1256,1260,共5页
Mechanical Science and Technology for Aerospace Engineering
关键词
特征加工
加工路径优化
旅行商问题
feature machining
optimization of machining path
traveling salesman problem
