Fast routing in very large public transportation networks using transfer patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6346 LNCS, Issue PART 1, 2010, Pages 290-301

  Bast, Hannah ^a,b   Carlsson, Erik ^b   Eigenwillig, Arno ^b   Geisberger, Robert ^b,c   Harrelson, Chris ^b   Raychev, Veselin ^b   Viger, Fabien ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b GOOGLE   (Switzerland)

^c KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; GEOGRAPHIC LOCATION; GOOGLE MAPS; MULTI-CRITERIA; NETWORK SIZE; OPTIMAL RESULTS; PRECOMPUTE; PUBLIC TRANSPORTATION; PUBLIC TRANSPORTATION NETWORKS; QUERY TIME; SHORTEST PATH; SYSTEM-BASED; TRANSFER PATTERNS;

COST FUNCTIONS;

ALGORITHMS;

EID: 78249239772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15775-2_25     Document Type: Conference Paper

References (13)

1. Extended version of this paper, http://ad.informatik.uni-freiburg.de/ papers
2. Bast, H.: Car or public transport - two worlds. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 355-367. Springer, Heidelberg (2009)
3. Berger, A., Delling, D., Gebhardt, A., Müller-Hannemann, M.: Accelerating time-dependent multi-criteria timetable information is harder than expected. In: ATMOS 2009. Dagstuhl Seminar Proceedings (2009)
4. Delling, D.: Time-dependent SHARC-routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 332-343. Springer, Heidelberg (2008)
5. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009)
6. Disser, Y., Müller-Hannemann, M., Schnee, M.: Multi-criteria shortest paths in time-dependent train networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 347-361. Springer, Heidelberg (2008)
7. Geisberger, R.: Contraction of timetable networks with realistic transfers. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 71-82. Springer, Heidelberg (2010)
8. Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. Commun. ACM 26, 670-676 (1983)
9. Möhring, R.H.: Verteilte Verbindungssuche im öffentlichen Personenverkehr: Graphentheoretische Modelle und Algorithmen. In: Horster, P. (ed.) Angewandte Mathematik - insbesondere Informatik, pp. 192-220. Vieweg (1999)
10. Müller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable information: Models and algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 67-90. Springer, Heidelberg (2007)
11. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.D.: Efficient models for timetable information in public transportation systems. J. Exp. Algorithmics 12 (2007)
12. Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66-79. Springer, Heidelberg (2007)
13. Theune, D.: Robuste und effiziente Methoden zur Lösung von Wegproblemen. Teubner (1995)