A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A Dynamic Shortest Path Algorithm Using Multi-Step Ahead Link Travel Time Prediction
Route guidance systems provide motorists with step-by-step instructions on how to get from any origin to any destination in a network. The systems calculate the best route from a user-supplied origin to destination, based on each link travel time on the network. Most studies on the route guidance development have been carried out based on only one-step ahead prediction of the link travel time in order to calculate a dynamic shortest path. However, the multi-step ahead prediction process should be considered in order to represent realistically the time-varying traffic conditions of the upstream links on the dynamic time interval basis. In this paper, a multi-step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one-step and the multi-step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time-varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi-step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.
A Dynamic Shortest Path Algorithm Using Multi-Step Ahead Link Travel Time Prediction
Route guidance systems provide motorists with step-by-step instructions on how to get from any origin to any destination in a network. The systems calculate the best route from a user-supplied origin to destination, based on each link travel time on the network. Most studies on the route guidance development have been carried out based on only one-step ahead prediction of the link travel time in order to calculate a dynamic shortest path. However, the multi-step ahead prediction process should be considered in order to represent realistically the time-varying traffic conditions of the upstream links on the dynamic time interval basis. In this paper, a multi-step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one-step and the multi-step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time-varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi-step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.
A Dynamic Shortest Path Algorithm Using Multi-Step Ahead Link Travel Time Prediction
Lee, Young-Ihn (author) / Lee, Seungjae (author) / Lee, Shinhae (author) / Chon, Jeunggyu (author)
International Journal of Urban Sciences ; 8 ; 156-166
2004-10-01
11 pages
Article (Journal)
Electronic Resource
Unknown
| British Library Online Contents | 2008
Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
| British Library Online Contents | 2013
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
| DOAJ | 2016
| British Library Online Contents | 2010