Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

The dynamic shortest path problem with time-dependent stochastic disruptions

Sever, Derya, Zhao, Lei, Dellaert, Nico, Demir, Emrah, Van Woensel, Tom and De Kok, Ton 2018. The dynamic shortest path problem with time-dependent stochastic disruptions. Transportation Research Part C: Emerging Technologies 92 , pp. 42-57. 10.1016/j.trc.2018.04.018
Item availability restricted.

[img] PDF - Accepted Post-Print Version
Restricted to Repository staff only until 1 May 2019 due to copyright restrictions.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (727kB)


The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Business (Including Economics)
Publisher: Elsevier
ISSN: 0968-090X
Date of First Compliant Deposit: 20 April 2018
Date of Acceptance: 20 April 2018
Last Modified: 01 Nov 2018 16:34

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics