改进蚁群算法在交通分配模型中的应用

发布时间：2018-07-02 23:10

本文选题：交通分配 + 交叉口延误　；参考：《郑州大学学报(工学版)》2017年02期

【摘要】：为了更加准确快速地搜索到最优路径,通过分析车流经过信控交叉口的到达和驶离状况,提出一种考虑交叉口信控延误的改进蚁群算法模型.首先,用交叉口的信控延误和路段行走时间对基本蚁群算法的信息素更新方程进行改进,建立全新的信息素更新模型;其次,通过应用改进后蚁群算法对路网各路段的车流量进行分批分配,设计考虑交叉口延误的路段增量分配流程;最后,基于java程序语言,对路网的流量分配进行仿真,并且和基本蚁群算法对路网运行质量进行对比分析.结果表明,改进后的蚁群算法能够降低路网中路段和交叉口使用率,具有良好的寻优性,并能有效均衡路网流量和缓解交叉口的通行压力.
[Abstract]:In order to search the optimal path more accurately and quickly, an improved ant colony algorithm model is proposed by analyzing the arrival and departure of traffic flow through the signal-controlled intersection. Firstly, the pheromone updating equation of the basic ant colony algorithm is improved by using the signal-control delay and the walking time of the intersection, and a new pheromone updating model is established. By using the improved ant colony algorithm to distribute the traffic flow of each section of the road network in batches, the incremental flow of road sections considering intersection delay is designed. Finally, based on java program language, the flow distribution of road network is simulated. And compared with the basic ant colony algorithm to analyze the network operation quality. The results show that the improved ant colony algorithm can reduce the utilization rate of sections and intersections in the road network, have good optimization, and can effectively balance the network flow and alleviate the traffic pressure at intersections.
【作者单位】：江苏大学汽车与交通工程学院;东南大学城市智能交通江苏省重点实验室;
【基金】：江苏省高校自然科学基金资助项目(13KJB580003) 江苏省城市智能交通重点实验室开放研究经费资助项目(JTKF2014004) 江苏大学高级专业人才科研启动基金资助项目(12JDG056)
【分类号】：U491.123

【相似文献】