Algorithms for most reliable routes on stochastic and time-dependent networksAditya Prakash2020-06-13articleTransportation Research Part B Methodological28 citationsclosedNo readable copy stored yet — this record is metadata only.Transportation Planning and OptimizationReliability and Maintenance OptimizationComplexity and Algorithms in GraphsAbstractNo abstract was published for this record.Citations in this libraryStored only when both papers are in the corpus — 28 citations exist upstream.References2000Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks2009Shortest path problem considering on-time arrival probability2009The α-reliable mean-excess traffic equilibrium model with stochastic travel times2005Optimal routing policy problems in stochastic time-dependent networks2009Adaptive route choices in risky traffic networks: A prospect theory approach2000Adaptive least-expected time paths in stochastic, time-varying transportation and data networks2011Distributions of travel time variability on urban roads2011Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approachCited by2022Adaptive personalized routing for vulnerable road users