Arrive in Time by Train with High Probability

References

• Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transportation Sci. 50(2):608–626.Link, Google Scholar
• Berger A, Gebhardt A, Müller-Hannemann M, Ostrowski M (2011) Stochastic delay prediction in large train networks. Caprara A, Kontogiannis S, eds. 11th Workshop Algorithmic Approaches Transportation Modeling, Optim., Systems, ATMOS, OASIcs, Vol. 20 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 100–111.Google Scholar
• Böhmová K, Mihalák M, Pröger T, Šrámek R, Widmayer P (2013) Robust routing in urban public transportation: How to find reliable journeys based on past observations. Frigioni D, Stiller S, eds. 13th Workshop Algorithmic Approaches Transportation Modeling, Optim., Systems, ATMOS, OASIcs, Vol. 33 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 27–41.Google Scholar
• Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, MA).Google Scholar
• Darwiche A (2009) Modeling and Reasoning with Bayesian Networks (Cambridge University Press, New York).Crossref, Google Scholar
• Dibbelt J, Pajor T, Strasser B, Wagner D (2013) Intriguingly simple and fast transit routing. Bonifaci V, Demetrescu C, Marchetti-Spaccamela A, eds. Experimental Algorithms. SEA 2013, Lecture Notes Comput. Sci., Vol. 7933 (Springer, Berlin Heidelberg),43–54.Crossref, Google Scholar
• Fan Y, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Networks Spatial Econom. 6(3–4):333–344.Crossref, Google Scholar
• Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transportation Res. Part B: Methodological 32(7):499–516.Crossref, Google Scholar
• Goerigk M, Heße S, Müller-Hannemann M, Schmidt M, Schöbel A (2013) Recoverable robust timetable information. Frigioni D, Stiller S, eds. 13th Workshop Algorithmic Approaches Transportation Modeling, Optim., Systems, ATMOS, OASIcs, Vol. 33 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 1–14.Google Scholar
• Goerigk M, Knoth M, Müller-Hannemann M, Schmidt M, Schöbel A (2011) The price of robustness in timetable information. Caprara A, Kontogiannis S, eds. 11th Workshop Algorithmic Approaches Transportation Modeling, Optim., Systems, ATMOS, OASIcs, Vol. 20 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 76–87.Google Scholar
• Goerigk M, Schmidt M, Schöbel A, Knoth M, Müller-Hannemann M (2014) The price of strict and light robustness in timetable information. Transportation Sci. 48(2):225–242.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
• Keyhani MH, Schnee M, Weihe K, Zorn HP (2012) Reliability and delay distributions of train connections. Delling D, Liberti L, eds. 12th Workshop Algorithmic Approaches Transportation Modeling, Optim., Systems, ATMOS, OASIcs, Vol. 25 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 35–46.Google Scholar
• Müller-Hannemann M, Schnee M (2007) Finding all attractive train connections by multi-criteria Pareto search. Geraets F, Kroon L, Schoebel A, Wagner D, Zaroliagis CD, eds. Algorithmic Methods for Railway Optimization, Lecture Notes Comput. Sci., Vol. 4359 (Springer, Berlin Heidelberg), 246–263.Crossref, Google Scholar
• Nielsen LR, Pretolani D, Andersen KA (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, Pretolani D, Andersen KA (2006) Bicriterion a priori route choice in stochastic time-dependent networks. Technical Report WP-L-2006-10, Department of Business Studies, Aarhus School of Business, Aarhus, Denmark.Google Scholar
• Nikolova E, Brand M, Karger DR (2006) Optimal route planning under uncertainty. Proc. Sixteenth Internat. Conf. Automated Planning Scheduling, 131–141.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
• Pretolani D (1998) 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
• Samaranayake S, Blandin S, Bayen A (2011) A tractable class of algorithms for reliable routing in stochastic networks. Procedia—Soc. Behav. Sci. 17:341–363.Crossref, Google Scholar
• Samaranayake S, Blandin S, Bayen AM (2012) Speedup techniques for the stochastic on-time arrival problem. Delling D, Liberti L, eds. 12th Workshop Algorithmic Approaches Transportation Modeling, Optim., Systems, ATMOS, OASIcs, Vol. 25 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 83–96.Google Scholar
• Schnee M (2009) Fully realistic multi-criteria timetable information systems. Unpublished doctoral thesis, Technische Universität Darmstadt, Darmstadt, Germany.Google Scholar
• Schwierczek K (2016) Computing joint delay distributions for trains in railway networks. Unpublished Bachelor’s thesis, Technische Universität Darmstadt, Darmstadt, Germany. http://tuprints.ulb.tu-darmstadt.de/5204/.Google Scholar