Reliable Routing Strategies on Urban Transportation Networks

References

• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
• Al-Shboul MA (2017) Infrastructure framework and manufacturing supply chain agility: The role of delivery dependability and time to market. Supply Chain Management 22(2):172–185.Crossref, Google Scholar
• Bell MG, Trozzi V, Hosseinloo SH, Gentile G, Fonzone A (2012) Time-dependent hyperstar algorithm for robust vehicle navigation. Transportation Res. Part A Policy Practice 46(5):790–800.Crossref, Google Scholar
• Bixby RE (2002) Solving real-world linear programs: A decade and more of progress. Oper. Res. 50(1):3–15.Link, Google Scholar
• Cabrera N, Medaglia AL, Lozano L, Duque D (2020) An exact bidirectional pulse algorithm for the constrained shortest path. Networks 76(2):128–146.Crossref, Google Scholar
• Chen A, Zhou Z (2010) The α-reliable mean-excess traffic equilibrium model with stochastic travel times. Transportation Res. Part B Methodological 44(4):493–513.Crossref, Google Scholar
• Chen BY, Lam WH, Li Q, Sumalee A, Yan K (2013) Shortest path finding problem in stochastic time-dependent road networks with stochastic first-in-first-out property. IEEE Trans. Intelligent Transportation Systems 14(4):1907–1917.Crossref, Google Scholar
• Chen BY, Lam WH, Sumalee A, Li Q, Tam ML (2014) Reliable shortest path problems in stochastic time-dependent networks. J. Intelligent Transportation Systems 18(2):177–189.Crossref, Google Scholar
• Chen P, Tong R, Yu B, Wang Y (2020) Reliable shortest path finding in stochastic time-dependent road network with spatial-temporal link correlations: A case study from Beijing. Expert Systems Appl. 147:113192.Crossref, Google Scholar
• Clark K, Peters SA, Tomlinson M (2005) The determinants of lateness: Evidence from British workers. Scottish J. Political Econ. 52(2):282–304.Crossref, Google Scholar
• Corredor-Montenegro D, Cabrera N, Akhavan-Tabatabaei R, Medaglia AL (2021) On the shortest α−reliable path problem. TOP 29(1):287–318.Crossref, Google Scholar
• Dial R, Glover F, Karney D, Klingman D (1979) A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9(3):215–248.Crossref, Google Scholar
• Duque D, Medaglia AL (2019) An exact method for a class of robust shortest path problems with scenarios. Networks 74(4):360–373.Crossref, Google Scholar
• Florio AM, Absi N, Feillet D (2021) Routing electric vehicles on congested street networks. Transportation Sci. 55(1):238–256.Link, Google Scholar
• Gallo G, Pallottino S (1986) Shortest path methods: A unifying approach. Gallo G, Sandi C, eds. Netflow at Pisa (Springer, Berlin, Heidelberg), 38–64.Crossref, Google Scholar
• Gao S (2005) Optimal adaptive routing and traffic assignment in stochastic time-dependent networks. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Gao S, Huang H (2012) Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks. Transportation Res. Part C Emerging Tech. 21(1):196–213.Crossref, Google Scholar
• Gao S, Frejinger E, Ben-Akiva M (2010) Adaptive route choices in risky traffic networks: A prospect theory approach. Transportation Res. Part C Emerging Tech. 18(5):727–740.Crossref, Google Scholar
• Gómez A, Mariño R, Akhavan-Tabatabaei R, Medaglia AL, Mendoza JE (2016) On modeling stochastic travel and service times in vehicle routing. Transportation Sci. 50(2):627–641.Link, Google Scholar
• Guo Z, Wallace SW, Kaut M (2019) Vehicle routing with space- and time-correlated stochastic travel times: Evaluating the objective function. INFORMS J. Comput. 31(4):654–670.Link, Google Scholar
• Hall RW (1986) The fastest path through a network with random time-dependent travel times. Transportation Sci. 20(3):182–188.Link, Google Scholar
• Huang H, Gao S (2012) Optimal paths in dynamic networks with dependent random link travel times. Transportation Res. Part B Methodological 46(5):579–598.Crossref, Google Scholar
• Huang H, Gao S (2018) Trajectory-adaptive routing in dynamic networks with dependent random link travel times. Transportation Sci. 52(1):102–117.Link, Google Scholar
• Huang Y, Zhao L, Van Woensel T, Gross JP (2017) Time-dependent vehicle routing problem with path flexibility. Transportation Res. Part B Methodological 95:169–195.Crossref, Google Scholar
• Johnson DB (1973) A note on Dijkstra’s shortest path algorithm. J. ACM 20(3):385–388.Crossref, Google Scholar
• Kershenbaum A (1981) A note on finding shortest path trees. Networks 11(4):399–400.Crossref, Google Scholar
• Kucharski R, Fielbaum A, Alonso-Mora J, Cats O (2021) If you are late, everyone is late: Late passenger arrival and ride-pooling systems’ performance. Transportmetrica A Transportation Sci. 17(4):1077–1100.Crossref, Google Scholar
• Li D, Weng P, Karabasoglu O (2016) Finding risk-averse shortest path with time-dependent stochastic costs. Sombattheera C, Stolzenburg F, Lin F, Nayak A, eds. 10th Internat. Workshop Multidisciplinary Trends Artificial Intelligence (Springer, Berlin, Heidelberg), 99–111.Google Scholar
• Lozano L, Medaglia AL (2013) On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1):378–384.Crossref, Google Scholar
• Lozano L, Duque D, Medaglia AL (2016) An exact algorithm for the elementary shortest path problem with resource constraints. Transportation Sci. 50(1):348–357.Link, Google Scholar
• Mahmassani HS, Hou T, Dong J (2012) Characterizing travel time variability in vehicular traffic networks: Deriving a robust relation for reliability analysis. Transportation Res. Rec. 2315(1):141–152.Crossref, Google Scholar
• Michail D, Kinable J, Naveh B, Sichi JV (2020) JGraphT—A Java library for graph data structures and algorithms. ACM Trans. Math. Software 46(2):1–29.Crossref, Google Scholar
• Miller-Hooks ED (2001) Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37(1):35–52.Crossref, Google Scholar
• Miller-Hooks ED, Mahmassani HS (2000) Least expected time paths in stochastic, time-varying transportation networks. Transportation Sci. 34(2):198–215.Link, Google Scholar
• Nie YM, Wu X (2009) Shortest path problem considering on-time arrival probability. Transportation Res. Part B Methodological 43(6):597–613.Crossref, Google Scholar
• Nielsen LR (2004) Route choice in stochastic time-dependent networks. University of Aarhus, Aarhus, Denmark.Google Scholar
• Nielsen LR, Andersen KA, Pretolani D (2014) Ranking paths in stochastic time-dependent networks. Eur. J. Oper. Res. 236(3):903–914.Crossref, Google Scholar
• Niemi T, Hameri AP, Kolesnyk P, Appelqvist P (2020) What is the value of delivering on time? J. Adv. Management Res. 17(4):473–503.Crossref, Google Scholar
• Pallottino S (1984) Shortest-path methods: Complexity, interrelations and new propositions. Networks 14(2):257–267.Crossref, Google Scholar
• Pan Y, Sun L, Ge M (2013) Finding reliable shortest path in stochastic time-dependent network. Procedia Soc. Behav. Sci. 96:451–460.Crossref, Google Scholar
• Prakash AA (2018) Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks. Transportation Res. Part B Methodological 108:127–147.Crossref, Google Scholar
• Prakash AA (2020) Algorithms for most reliable routes on stochastic and time-dependent networks. Transportation Res. Part B Methodological 138:202–220.Crossref, Google Scholar
• Prakash AA, Srinivasan KK (2017) Finding the most reliable strategy on stochastic and time-dependent transportation networks: A hypergraph based formulation. Networks Spatial Econom. 17(3):809–840.Crossref, Google Scholar
• Pretolani D (2000) A directed hypergraph model for random time dependent shortest paths. Eur. J. Oper. Res. 123(2):315–324.Crossref, Google Scholar
• Rambha T, Boyles SD, Waller ST (2016) Adaptive transit routing in stochastic time-dependent networks. Transportation Sci. 50(3):1043–1059.Link, Google Scholar
• Srinivasan KK, Prakash A, Seshadri R (2014) Finding most reliable paths on networks with correlated and shifted log–normal travel times. Transportation Res. Part B Methodological 66:110–128.Crossref, Google Scholar
• Stabler B, Bar-Gera H, Sall E (2016) Transportation networks for research. Accessed October 10, 2019, https://github.com/bstabler/TransportationNetworks.Google Scholar
• Susilawati S, Taylor MA, Somenahalli SV (2013) Distributions of travel time variability on urban roads. J. Adv. Transportation 47(8):720–736.Crossref, Google Scholar
• Wu X, Nie YM (2011) Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach. Procedia Soc. Behav. Sci. 17:382–404.Crossref, Google Scholar
• Yamín D, Medaglia AL, Prakash AA (2022) Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks. Comput. Oper. Res. 141:105671.Crossref, Google Scholar
• Yang L, Zhou X (2014) Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem. Transportation Res. Part B Methodological 59:22–44.Crossref, Google Scholar
• Yang L, Zhou X (2017) Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations. Transportation Res. Part B Methodological 96:68–91.Crossref, Google Scholar