一种车辆路径规划的新型蚁群算法研究  

The Research of An Newly Ant colony Algorithm of Vehicle Route Planning

作　　者：赵冬玲[1] 杨艳[1] 潘正运[2] 

机构地区：[1]济源职业技术学院,河南济源454650 [2]解放军信息工程大学,河南济源450001

出　　处：《电子器件》2014年第3期519-523,共5页Chinese Journal of Electron Devices

基　　金：2012年河南省科技厅科技攻关项目(122102210471)

摘　　要：通过引入变异机制和3种不同策略对蚁群算法进行了改进来提高收敛速度和寻找更优解,以满足对车辆路径规划的求解,其目标是实现车辆的路径规划,使得汽车总的行驶路程最短和所需汽车的数量最少。仿真实验表明,引入变异机制的蚁群算法能够有效地解决带有容量限制的车辆路径规划问题,提高了物流配送效率。The mutation mechanism and three different strategies are introduced to improve the convergence speed and searching better solution, which is to solve the vehicle path planning. The ultimate goal is to realize the vehicle path planning, making the car total travel the shortest distance and the required number of cars minimum. The experiments data show that introducing the mutation mechanism of ant colony algorithm can solve the vehicle with capacity limitation routing problem effectively and improve the efficiency of logistic distribution.

关 键 词：车辆路径规划 蚁群算法 变异机制 仿真 

分 类 号：U491.1[交通运输工程—交通运输规划与管理]