Research on Shortest Path Algorithm With a Consideration of Waiting Time

Abstract:

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 in this paper. Based on the assumption that the section travel times are fixed, a new labeling algorithm which is the CWTSI-SP algorithm (shortest path algorithm by taking the waiting time at signalized intersections into consideration) is presented to solve SP problem. The numeral experiment results demonstrate that with the CWTSI-SP algorithm he features of the shortest path and travel time which related to departure time at origin are analyzed. CWTSI-SP algorithm is efficiency in dynamic traffic loading analysis.