考虑交叉口等待时间的最短路径算法研究

在甄别等待时间和延误的基础上,首先提出了信号交叉口处等待时间函数,并分析了信号交叉口处等待时间特性;其次,在假设路段行程时间固定的基础上重新定义路网的邻接矩阵,提出信号交叉口属性表,并结合重新定义的路网参数,将信号交叉口等待时间引入算法之中,提出了新的标号算法,即考虑信号交叉口等待时间的最短路径算法(CWTSI SP algorithm),用以求解本文网络最短路径问题.数值试验的结果表明,CWTSI SP算法考虑了信号交叉口的等待时间,并分析了最短路径和最短行程时间随开始时间的不同而变化的特性.算法具有较好的效率,并贴近交通现象本质,对于动态交通流分析具有良好的实用性.

Research on Shortest Path Algorithm With a Consideration of Waiting Time

The paper presents a function of waiting time at signalized intersection and the waiting time characteristics are first analyzed. Then, the link matrix is re defined and the attribute table of the signalized intersection is given. Based on the assumption that the section travel times are fixed, a new labeling algorithm, the CWTSI SP algorithm, which is the shortest path algorithm by taking the waiting time at signalized intersections into consideration, is presented to solve shortest path(SP) problem. The numeral experiment results demonstrate that with the CWTSI SP algorithm the features of the shortest path and travel time related to departure time at origin are analyzed. The CWTSI SP algorithm is efficient in dynamic traffic loading analysis.