The dynamic shortest path problem with time-dependent stochastic disruptions

Derya D Sever; Lei Zhao; Nico Dellaert; Emrah Demir; Tom Van Woensel; A.G. de Kok

doi:10.1016/j.trc.2018.04.018

ScienceGate Book Chapters

JOURNAL ARTICLE

The dynamic shortest path problem with time-dependent stochastic disruptions

Derya D Sever Lei Zhao Nico Dellaert Emrah Demir Tom Van Woensel A.G. de Kok

Year: 2018 Journal: Transportation Research Part C Emerging Technologies Vol: 92 Pages: 42-57 Publisher: Elsevier BV

DOI: 10.1016/j.trc.2018.04.018

Get Full-Text PDF Get Analytical Report

Keywords:

Markov decision process Dynamic programming Mathematical optimization Shortest path problem Computer science Bellman equation Path (computing) K shortest path routing Time horizon Cluster analysis Markov process Markov chain Mathematics Graph Theoretical computer science Artificial intelligence

Metrics

Cited By

7.84

FWCI (Field Weighted Citation Impact)

Refs

0.97

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

Traffic control and management

Physical Sciences → Engineering → Control and Systems Engineering

Transportation and Mobility Innovations

Physical Sciences → Engineering → Automotive Engineering

The dynamic shortest path problem with time-dependent stochastic disruptions

Metrics

Citation History

Topics

Related Documents

Research on Dynamic Stochastic Shortest Path Problem

The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks

The Stochastic Time-Varying Shortest Path Problem

Reinforcement Learning for Shortest Path Problem on Stochastic Time-Dependent Road Network

Finding Risk-Averse Shortest Path with Time-Dependent Stochastic Costs