SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Optimal Path Finding Method Study Based on Stochastic Travel Time
4 references·0 citing·16 second hop
Optimal Path Finding Method Study Based on Stochastic Travel Time (2013)Optimal Path Finding Method Study Based o…Arriving-on-Time Problem: Discrete Algorithm That Ensures Convergence (2006)Arriving-on-Time Problem: Dis…Shortest paths in stochastic networks with correlated link costs (2005)Shortest paths in stochastic …Heuristic techniques for accelerating hierarchical routing on road networks (2002)Heuristic techniques for acce…Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)Least Expected Time Paths in …The Fastest Path through a Network with Random Time-Dependent Travel Times (1986)Expected shortest paths in dynamic and stochastic traffic networks (1998)Shortest path problem considering on-time arrival probability (2009)Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach (2011)Finding most reliable paths on networks with correlated and shifted log–normal travel times (2013)Arriving on Time (2005)An outer approximation algorithm for the robust shortest path problem (2013)The α-reliable path problem in stochastic road networks with link correlations: A moment-matching-based path finding algorithm (2018)Application of a Technique for Research and Development Program Evaluation (1959)Introduction to Stochastic Programming (1997)Optimal routing policy problems in stochastic time-dependent networks (2005)Adaptive route choices in risky traffic networks: A prospect theory approach (2009)Introduction to Stochastic Programming (2011)State Space Reduction for Nonstationary Stochastic Shortest Path Problems With Real-Time Traffic Information (2005)Optimal Route Based on Dynamic Programming for Road Networks (2008)Dynamic optimal route search algorithm for car navigation systems with preferences by dynamic programming (2010)
this work references cited by second hop

References

  • 2000Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks312 cited
  • 2005Shortest paths in stochastic networks with correlated link costs132 cited
  • 2002Heuristic techniques for accelerating hierarchical routing on road networks104 cited
  • 2006Arriving-on-Time Problem: Discrete Algorithm That Ensures Convergence60 cited

Cited by

No citing works inside the corpus for this window.

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