Shortest path problem considering on-time arrival probability

337 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach (2011, background): “4 shortest path problem, and by Nie and Wu (2009b) for the reliable routing problem.”
Most reliable path-finding algorithm for maximizing on-time arrival probability (2017, methodology): “In recent years, there is a resurgence of interest in the studies of stochastic shortest path problems for considering travel time uncertainties in congested road networks (Nie and Wu 2009; Chen et al. 2012; Yang and Zhou 2014; Shahabi, Unnikrishnan, and Boyles 2015).”
Optimal Path Problems with Second-Order Stochastic Dominance Constraints (2012, methodology): “An alternative way to solve Problem (4) is to use a modified label-correcting algorithm presented in Nie & Wu (2009b).”
Modeling Heterogeneous Risk-Taking Behavior in Route Choice: A Stochastic Dominance Approach (2011, methodology): “The above algorithm does not have a polynomial complexity, as shown in Miller-Hooks (1997) and Nie and Wu (2009a).”