Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A Tractable Class of Algorithms for Reliable Routing in Stochastic Networks

6 references·5 citing·28 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
2005Arriving on Time164 cited
2006Optimal Routing for Maximizing the Travel Time Reliability101 cited
2006Arriving-on-Time Problem35 cited

Cited by

2019An Efficient Monte Carlo-Based Probabilistic Time-Dependent Routing Calculation Targeting a Server-Side Car Navigation System14 cited
2017Eco-reliable path finding in time-variant and stochastic networks12 cited
2011An adaptive routing system for location-aware mobile devices on the road network11 cited
2015Stability of Transportation Networks Under Adaptive Routing Policies8 cited
2014Dynamic Assignment with User Information in Multimodal Networks5 cited

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