基于混合算法数控加工路径规划优化.docVIP

基于混合算法数控加工路径规划优化 　　摘 要： 对数控加工中的孔群加工路径规划优化方法进行研究。将孔群的加工路径规划问题与典型旅行商问题进行类比，建立刀具空行程最短的数学模型和适应度函数。针对常规混合算法不能够将两种算法进行融合，只是单纯叠加，无法在最佳时机进行算法转化，使得算法混合优势不够明显等问题，该文对混合算法进行改进。使用遗传算法得到若干优化解，并将其变成初始信息素从而改成初始信息素偏低问题。使用动态转移代替静态转移法将遗传算法切换到蚁群算法。算法后期，信息素更新方法使用动态挥发系数法，对交叉变异概率使用信息素和适应度进行动态调节，交叉变异位置使用信息素和启发信息决定。以一种机械零件的孔群加工为例，对研究的混合算法的加工路径规划优化方法进行实例分析，结果表明相比常规混合算法，该文研究的混合算法具有更高的求解精度和优化效果。 　　关键词： 数控加工； 孔群加工； 路径规划； 混合算法 　　中图分类号： TN911?34； TP18 文献标识码： A 文章编号： 1004?373X（2016）16?0055?03 　　Abstract： The optimization method of hole group machining path planning in NC machining is studied in this paper. The problem of hole group machining path planning is compared with the typical traveling salesman problem， and the mathematical model and fitness function of shortest air travel of cutting tool are set up. Since the conventional hybrid algorithm can not integrate the two algorithms together， but only a simple stack， and can not perform algorithm conversion in the best time， which makes the hybrid algorithm superiority unobvious， the hybrid algorithm is improved in this paper. The genetic algorithm is used to get a number of optimization solutions， which would be turned into the initial pheromone to change the situation that the initial pheromone is low. The genetic algorithm is switched to the ant colony algorithm by using the dynamic transfer instead of the static transfer method. In the latter stage， the dynamic volatile coefficient method is used in the pheromone updating method. The pheromone and adaptive degree are adopted to adjust the probability of cross mutation dynamically. The cross mutation position is determined by information elements and heuristic information. Taking the machining of a machine part as an example， the machining path planning optimization method of the hybrid algorithm is analyzed in this paper. The results show that the hybrid algorithm has higher accuracy and better effect in comparison with the conventional hybrid algorithm. 　　Keywords： NC machining； hole g