基于蚁群算法的拥堵交通最短路径研究  

Shortest Path Algorithm of Congested Traffic Based on Ant Colony Algorithm

作　　者：杨浩雄[1,2] 王丹[1] 张敬蕤 

机构地区：[1]北京工商大学商学院,北京100048 [2]北京工商大学中国食品安全研究中心,北京100048 [3]北京工商大学计算机与信息工程学院,北京100048

出　　处：《计算机仿真》2015年第3期186-191,共6页Computer Simulation

基　　金：国家社会科学基金(11CGL105);北京市教委创新能力提升计划项目(PXM2013_014213_000100)

摘　　要：针对当前交通网络在路径选择研究中,存在只考虑静态交通网络的路径选择的问题,提出了利用蚁群算法的拥堵交通网络的最短路径算法,建立了采用Petri网的交通网络模型,运用蚁群算法对静态交通网络进行了最短路径求解,并加入天气状况、道路容量等动量建立动态交通网络。运用层次分析法并结合Petri网对交通拓扑图进行了最短路径的探索并进行了对比分析。研究结果表明在道路拥挤的情况下,动态交通网络下的路径算法可以为出行者找到更快捷方便的路线。In view of the deficiencies in the path selection research on current traffic network,This paper proposed a shortest path algorithm under congestion traffic network based on ant colony algorithm,built a traffic network model based on Petri nets,and used ant colony optimization to find the shortest path for the static traffic network.Then weather and road capacity were added to the model,which makes it become a dynamic traffic network. AHP combined with Petri network was used to find the shortest path based on the traffic topology map and make a comparative analysis. The results show that when road congestion occurs,the path algorithm for dynamic traffic network can be more convenient for travelers to find the route.

关 键 词：蚁群算法 最短路径 拥堵交通 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]