The dynamic shortest path problem with time-dependent stochastic disruptions

Derya Sever, Lei Zhao, Nico Dellaert, Emrah Demir, Tom van Woensel, Ton de Kok

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

10 Citaten (Scopus)
4 Downloads (Pure)

Samenvatting

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.

Originele taal-2Engels
Pagina's (van-tot)42-57
Aantal pagina's16
TijdschriftTransportation Research. Part C: Emerging Technologies
Volume92
DOI's
StatusGepubliceerd - 1 jul 2018

Vingerafdruk Duik in de onderzoeksthema's van 'The dynamic shortest path problem with time-dependent stochastic disruptions'. Samen vormen ze een unieke vingerafdruk.

Citeer dit