This paper develops a simple, robust framework for the problem of finding the route with the least expected travel time from any node to any given destination in a stochastic and time-dependent network. Spatial and temporal link travel time correlations are both considered in the proposed solution, which is based on a dynamic programming approach. In particular, the spatial correlation is represented by a Markovian property of the link states, in which each link is assumed to experience congested or uncongested conditions. The temporal correlation is manifested through the time-dependent expected link travel time given the condition of the link traversed. The framework enables the use of a route guidance system, in which at any decision node within a network, a decision can be made on the basis of current traffic information about which node to take next to achieve the shortest expected travel time to the destination. Numerical examples are presented to illustrate the computational steps involved in the framework to make route choices and to demonstrate the effectiveness of the proposed solution.
Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
Transportation Research Record: Journal of the Transportation Research Board
Transportation Research Record: Journal of the Transportation Research Board ; 2338 , 1 ; 58-66
2013-01-01
Article (Journal)
Electronic Resource
English
Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
Online Contents | 2013
|A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
DOAJ | 2015
|Finding the k reliable shortest paths under travel time uncertainty
Online Contents | 2016
|Shortest paths in randomly time varying networks
IEEE | 2001
|