Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Ranking paths in stochastic time-dependent networks

11 references·4 citing·35 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
2001An adaptive routing algorithm for in-vehicle route guidance systems with real-time information149 cited
2000Adaptive least-expected time paths in stochastic, time-varying transportation and data networks147 cited
2012Optimal paths in dynamic networks with dependent random link travel times95 cited
2011Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks82 cited
1997Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks71 cited
2004Route Choice in Stochastic Time-Dependent Networks33 cited
2009Optimal Information Location for Adaptive Routing28 cited
2012Decremental algorithm for adaptive routing incorporating traveler information21 cited

Cited by

2017Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation17 cited
2015Solving the K-shortest paths problem in timetable-based public transportation systems13 cited
2021Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks

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

10 cited

2024Reliable Routing Strategies on Urban Transportation Networks6 cited