基于拥堵指数的改进蜂群算法在DVRP中的应用  

Application of Improved Bee Colony Algorithm Based on Congestion Factor to the DVRP

作　　者：梁振球[1] 

机构地区：[1]广东技术师范学院计算机与网络中心,广州510665

出　　处：《计算机系统应用》2015年第9期252-255,共4页Computer Systems & Applications

基　　金：广东技术师范学院2012年度校级科研项目(12KJY15)

摘　　要：城市道路在不同时段、突发情况下的通畅程度存在较大的差异,对物流成本的影响已不容忽视.静态车辆路径规划不能反应路况的变化,因此本文引入分时段的拥堵指数,以总成本最小为目标函数,并采用规避高峰期区域的种群初始化算法,构造出改进的蜂群算法.实验结果表明,采用改进蜂群算法进行路径规划,由于能回避拥堵路段,因此虽然不是最短的运输路径,但却能实现更低的总体运输成本.Roads unobstructed degree there is a big difference at different times or emergency situations, the impact on logistics costs cannot be ignored. Static vehicle route planning cannot feedback the changes of road traffic situation. Therefore, this paper introduces sub-periods of congestion coefficient, the total cost minimization as the objective function, using the population initialization algorithm with circumvention to construct improved bee colony algorithm. The experimental results show that due to using improved bee colony algorithm can be avoided road congestion, although not the shortest transport route, but it can achieve lower overall transportation costs.

关 键 词：拥堵指数 蜂群算法 动态车辆路径规划(DVRP) 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]