A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network

摘要

In this paper, a new improved dynamic algorithm is proposed to find the optimal path in transit network, which uses the shortest travel time as primary object and least transfer times as second object. And the impacts of the real-time traffic information to the roads?? smooth, the passenger??s transfer times and changing price of public transportation line to the travel time are also taken into consideration in the new dynamic algorithm. A simple numerical example is given to show the new algorithm??s efficiency.