Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times

References

• Bellman R (1958) On a routing problem. Quart. Appl. Math. 16(1):87–90.Crossref, Google Scholar
• Boyles SD (2006) Reliable routing with recourse in stochastic, time-dependent transportation networks. Unpublished Master’s thesis, University of Texas, Austin.Google Scholar
• Carrion C, Levinson D (2012) Value of travel time reliability: A review of current evidence. Transportation Res. Part A 46(4):720–741.Google Scholar
• Chabini I (2000) Minimum expected travel times in stochastic time-dependent networks revisited. Internal report, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Chen BY, Lam WHK, Sumalee A, Li ZL (2012) Reliable shortest path finding in stochastic networks with spatial correlated link travel times. Internat. J. Geographical Inform. Sci. 26(2):365–386.Crossref, Google Scholar
• Ding J, Gao S, Jenelius E, Rahmani M, Huang H, Ma L, Pereira F, Ben-Akiva M (2014) Routing policy choice set generation in stochastic time-dependent networks: Case studies for Stockholm, Sweden, and Singapore. Transportation Res. Record 2466:76–86.Crossref, Google Scholar
• Dong W, Vu H, Nazarathy Y, Vo B, Li M, Hoogendoorn S (2013) Shortest paths in stochastic time-dependent networks with link travel time correlation. Transportation Res. Record 2338:58–66.Crossref, Google Scholar
• Fan Y, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Networks Spatial Econom. 6(3):333–344.Crossref, Google Scholar
• Fan YY, Kalaba RE, Moore JEI (2005a) Arriving on time. J. Optim. Theory Appl. 127(3):497–513.Crossref, Google Scholar
• Fan YY, Kalaba RE, Moore JEI (2005b) Shortest paths in stochastic networks with correlated link costs. Comput. Math. Appl. 49(9–10):1549–1564.Crossref, Google Scholar
• Gao S (2005) Optimal adaptive routing and traffic assignment in stochastic time-dependent networks. Unpublished doctoral thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Gao S, Chabini I (2002) The best routing policy problem in stochastic time-dependent networks. Transportation Res. Record 1783:188–196.Crossref, Google Scholar
• Gao S, Chabini I (2006) Optimal routing policy problems in stochastic time-dependent networks. Transportation Res. Part B 40(2):93–122.Crossref, Google Scholar
• Gao S, Huang H (2012) Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks. Transportation Res. Part C 21(1):196–213.Crossref, 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 46(5):579–598.Crossref, Google Scholar
• Miller-Hooks E (1997) Optimal routing in time-varying, stochastic networks: Algorithms and implementation. Unpublished doctoral thesis, University of Texas, Austin.Google Scholar
• Miller-Hooks E (2001) Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37(1):35–52.Crossref, Google Scholar
• Miller-Hooks E, Mahmassani HS (2000) Least expected time paths in stochastic, time-varying transportation networks. Transportation Sci. 34(2):198–215.Link, Google Scholar
• Nie Y, Wu X (2009a) Reliable a priori shortest path problem with limited spatial and temporal dependencies. Lam WHK, Wong SC, Lo HK, eds. Transportation and Traffic Theory 2009: Golden Jubilee (Springer, New York), 169–195.Crossref, Google Scholar
• Nie Y, Wu X (2009b) Shortest path problem considering on-time arrival probability. Transportation Res. Part B 43(6):597–613.Crossref, Google Scholar
• Opasanon S, Miller-Hooks E (2006) Multicriteria adaptive paths in stochastic, time-varying networks. Eur. J. Oper. Res. 173(1):72–91.Crossref, Google Scholar
• Polychronopoulos GH, Tsitsiklis JN (1996) Stochastic shortest path problems with recourse. Networks 27(2):133–143.Crossref, Google Scholar
• Pretolani D (2000) A directed hyperpath model for random time dependent shortest paths. Eur. J. Oper. Res. 123(2):315–324.Crossref, Google Scholar
• Pretolani D, Nielsen LR, Andersen KA, Ehrgott M (2009) Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Oper. Res. Lett. 37(3):201–205.Crossref, Google Scholar
• Psaraftis HN, Tsitsiklis JN (1993) Dynamic shortest paths in acyclic networks with Markovian arc cost. Oper. Res. 41(1):91–101.Link, Google Scholar
• Rachtan P, Huang H, Gao S (2013) Spatio-temporal link speed correlations: An empirical study. Transportation Res. Record 2390:34–43.Crossref, Google Scholar
• Samaranayake S, Blandin S, Bayen A (2012) A tractable class of algorithms for reliable routing in stochastic networks. Transportation Res. Part C 20(1):199–217.Crossref, Google Scholar
• von Neumann J, Morgenstern O (1944) Theory of Games and Economic Behavior (Princeton University Press, Princeton, NJ).Google Scholar
• Waller ST, Ziliaskopoulos AK (2002) On the online shortest path problem with limited arc cost dependencies. Networks 40(4):216–227.Crossref, Google Scholar
• Yang B, Miller-Hooks E (2004) Adaptive routing considering delays due to signal operations. Transportation Res. Part B 38(5):385–413.Crossref, Google Scholar