Adaptive Transit Routing in Stochastic Time-Dependent Networks

References

• Chriqui C, Robillard P (1975) Common bus lines. Transportation Sci. 9(2):115–121.Link, Google Scholar
• de Cea J, Fernández E (1993) Transit assignment for congested public transport systems: An equilibrium model. Transportation Sci. 27(2):133–147.Link, Google Scholar
• Gentile G, Nguyen S, Pallottino S (2005) Route choice on transit networks with online information at stops. Transportation Sci. 39(3):289–297.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
• Hickman MD (1994) Assessing the impact of real-time information on transit passenger behavior. Unpublished doctoral thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Hickman MD, Bernstein DH (1997) Transit service and path choice models in stochastic and time-dependent networks. Transportation Sci. 31(2):129–146.Link, Google Scholar
• Hickman MD, Wilson NH (1995) Passenger travel time and path choice implications of real-time transit information. Transportation Res. Part C: Emerging Tech. 3(4):211–226.Crossref, 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
• 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 (1998) Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transportation Res. Record 1645:143–151.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
• Nguyen S, Pallottino S (1988) Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 37(2):176–186.Crossref, Google Scholar
• Nguyen S, Pallottino S (1989) Hyperpaths and shortest hyperpaths combinatorial optimization. Simeone B, ed. Combinatorial Optimization, Lecture Notes Math., Vol. 1403 (Springer-Verlag, Berlin Heidelberg), 258–271.Crossref, Google Scholar
• Nguyen S, Pallottino S, Gendreau M (1998) Implicit enumeration of hyperpaths in a logit model for transit networks. Transportation Sci. 32(1):54–64.Link, Google Scholar
• Nielsen L, Pretolani D, Andersen K (2004) K shortest paths in stochastic time-dependent networks. Technical report WP-L-2004-05, Department of Accounting, Finance and Logistics, Aarhus School of Business, Aarhus, Denmark.Google Scholar
• Nielsen LR, Andersen KA, Pretolani D (2003) Bicriterion shortest hyperpaths in random time-dependent networks. IMA J. Management Math. 14(3):271–303.Crossref, 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
• Polychronopoulos GH, Tsitsiklis JN (1996) Stochastic shortest path problems with recourse. Networks 27(2):133–143.Crossref, Google Scholar
• Powell WB (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality (John Wiley & Sons, Hoboken, NJ).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
• Provan JS (2003) A polynomial-time algorithm to find shortest paths with recourse. Networks 41(2):115–125.Crossref, Google Scholar
• Rambha T (2012) Adaptive routing in schedule based stochastic time-dependent transit networks. Unpublished master’s thesis, University of Texas at Austin, Austin.Google Scholar
• Spiess H, Florian M (1989) Optimal strategies: A new assignment model for transit networks. Transportation Res. Part B: Methodological 23(2):83–102.Crossref, 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
• Wu JH, Florian M, Marcotte P (1994) Transit equilibrium assignment: A model and solution algorithms. Transportation Sci. 28(3): 193–203.Link, Google Scholar