Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Dynamic shortest path problems: Hybrid routing policies considering network disruptions

7 references·7 citing·32 second hop

FromToDepth

this work references cited by second hop

References

1986The Fastest Path through a Network with Random Time-Dependent Travel Times404 cited
2000Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks310 cited
1998Expected shortest paths in dynamic and stochastic traffic networks285 cited
2005Optimal routing policy problems in stochastic time-dependent networks241 cited
2001An adaptive routing algorithm for in-vehicle route guidance systems with real-time information149 cited
2011Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks82 cited
2005State Space Reduction for Nonstationary Stochastic Shortest Path Problems With Real-Time Traffic Information62 cited

Cited by

2022Data-Driven Optimization for Dynamic Shortest Path Problem Considering Traffic Safety29 cited
2015Implementation of Dynamic Traffic Routing for Traffic Congestion: A Review22 cited
2019Model and methods to address urban road network problems with disruptions21 cited
2022A framework for efficient dynamic routing under stochastically varying conditions17 cited
2016A bi-objective model to address disruptions on unidirectional road networks**This project is funded by the Beijing YuanZhi Tiancheng Technology Co. Ltd, China.6 cited
2021A study of rerouting beyond ad hoc decision making3 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2023

Finding the Optimal Shortest Path in Stochastic Networks Using the Markov Decision Process (MDP)

3 cited