The dynamic shortest path problem with time-dependent stochastic disruptions

Sever, Derya, Zhao, Lei, Dellaert, Nico, Demir, Emrah ORCID: https://orcid.org/0000-0002-4726-2556, 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

Preview

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (727kB) | Preview

Abstract

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:	05 Dec 2024 09:00
URI:	https://orca.cardiff.ac.uk/id/eprint/110845

Citation Data

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

Actions (repository staff only)

Edit Item