基于Dijkstra改进算法的城市交通阻塞研究

Research on Urban Traffic Congestion Based on Dijkstra Improved Algorithm

为缓解交通阻塞的发生,以合肥市城区交通为研究对象,利用调查得到的路况信息以及各道路的交通生成量和吸引量对不同道路赋予不同阻塞权重;再将其作为参数引入到Dijkstra算法中;最后采用Python脚本对Dijkstra算法进行改进。该算法已应用于合肥市交通阻塞路径规划中,结果表明该算法生成的最佳路径有效避开了拥堵路段。

In order to ease traffic congestion, taking Hefei City urban traffic as the research object, we gave different congestion weights to different roads by using the investigation of traffic information and road traffic generation and attraction at first. And then, taking the weight as a parameter, we introduced it into Dijkstra algorithm, and used Python scripts to improve Dijkstra algorithm. Finally, we applied the improved algorithm into Hefei City traffic congestion path planning. The result shows that the optimal path generated by this algorithm can effectively avoid the traffic congestion.