基于蚁群算法的交通控制与诱导协同研究  

Study on Cooperation of Traffic Control and Route Guidance Based on Ant Algorithm

作　　者：谷远利[1] 李善梅[2] 邵春福[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044 [2]天津市交通建筑设计院,天津300201

出　　处：《系统仿真学报》2008年第10期2754-2756,2761,共4页Journal of System Simulation

基　　金：科技部“973”项目(2006CB705500)

摘　　要：以路网总行程时间最小为目标,兼顾路网流量的均衡,建立了城市交通控制与诱导的协同模型。引入了蚁群算法的思想,并利用此算法对模型进行求解,得到最佳路径和最佳信号配时方案;最后采用小型路网进行仿真试验,通过跟实际的交通流对比,表明此方法能有效均衡路网流量,并能有效节约路网的总行程时间。A cooperation model of urban traffic control and route guidance was built with targets at minimizing the total travel time of the road network and equilibrium of traffic flow. The idea of ant algorithm was adopted to solve the model and get the best route and signal timing. At last, a small road network was used to verify the method. The results show that this method can equilibrate traffic flow and decrease the total travel time obviously in the comparison with the real traffic flow.

关 键 词：交通流诱导 交通控制 协同 蚁群算法 仿真 

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