城市交通时间最短路径计算模型及应用仿真

Algorithm and Simulation of Time-Dependent Shortest Paths of Urban Traffic

研究道路状态信息和路口固定延迟模型优化问题,城市交通时间最短路径(T'DSP)是统计意义上的最优路径,对个体车辆而言并非最优,主要原因在于没有考虑车辆通行与交通信号的时空相位关系。通过对上述关系的研究,提出了基于交通信号的路口延迟和时间最短路径(TLBSP)的计算模型及改进Dijkstra算法,适用于现有主要交通网络和交通规则,能实现交通信号控制下各车最短时间路径的计算。实验结果表明,TLBSP算法的时间最短路径优于距离最短路径算法和固定延时的TDSP算法,改进算法可应用于城市交通导航,能促使车辆在空间上合理分布,有利于缓解城市交通拥堵。

A delay model of at traffic junctions and an algorithm of the Traffic Light Based Shortest Paths （TLBSP） were proposed, and Dijkstra＇ s algorithm was improved also. The TLBSP algorithm can fit most traffic networks and traffic rules at present and can be calculated for each vehicle. The experimental results show that, the paths based on the TLBSP algorithm are more optimal than the path based on Distance Shortest Paths and TDSP with fixed delay. In addition, the algorithm can be applied to urban traffic navigation. It is beneficial to reasonable distribution of urban vehicle and alleviate urban traffic congestion.