基于改进蚁群算法的机械加工零件物流配送路径研究  

Study on The Logistics and Distribution Path of Mechanical Processing Parts Based on Improved Ant Colony Algorithm

作　　者：余冬财 朱华炳[1] 王烽 高崧 姚卫杰 YU Dong-cai;ZHU Hua-bing;WANG Feng;GAO Song;YAO Wei-jie(School of Mechanical Engineering,Hefei University of Technology,Hefei 230009,China)

机构地区：[1]合肥工业大学机械工程学院,合肥230009

出　　处：《组合机床与自动化加工技术》2020年第9期180-184,共5页Modular Machine Tool & Automatic Manufacturing Technique

摘　　要：针对机械加工过程中,蜗轮减速器零件的工艺路线问题,考虑车辆负载、配送路径长度与时间惩罚等约束,为了规划出最优配送方案,构造以运输成本最小为优化目标的调度模型,采用改进蚁群算法进行模型求解。将时间窗、节约矩阵作为先验信息引入状态转移策略以及对信息素更新的优化,采用蚁群算法对蜗轮减速器零件的配送路线问题进行求解,寻求最优配送方案以及对VRP问题的基准算例仿真,与其他算法对比,表明了该文算法的有效性。In view of the process of machining, the process path of the worm wheel reducer parts, taking into account the constraints of vehicle load, distribution path length and time penalty, in order to plan the optimal distribution plan, construct the scheduling model with the minimum transportation cost as the optimization target, and use the improved ant colony algorithm to solve the model. Using time window and saving matrix as a priori information to introduce state transfer strategy and optimization of pheromone update, using ant colony algorithm to solve the distribution route problem of worm wheel reducer parts, seeking optimal distribution scheme and benchmark study simulation of VRP problem, compared with other algorithms, shows the validity of this algorithm.

关 键 词：蜗轮减速器 工艺路线 车辆路径问题 蚁群算法 

分 类 号：TH16[机械工程—机械制造及自动化] TG506[金属学及工艺—金属切削加工及机床]