KIT | KIT-Bibliothek | Impressum | Datenschutz
Open Access Logo
§
Volltext
URN: urn:nbn:de:swb:90-219977

Advanced Route Planning in Transportation Networks

Geisberger, Robert

Abstract:
We present fast and efficient algorithms for routing in road and public transit networks. An algorithm for public transit can handle very large and poorly structured networks in a fully realistic scenario. Algorithms to answer flexible shortest path queries consider additional query parameters, such as edge weight or restrictions. Finally, specialized algorithms compute sets of related shortest path distances for time-dependent distance table computation, ride sharing and closest POI location.


Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Hochschulschrift
Jahr 2011
Sprache Englisch
Identifikator KITopen ID: 1000021997
Verlag Karlsruhe
Abschlussart Dissertation
Fakultät Fakultät für Informatik (INFORMATIK)
Institut Institut für Theoretische Informatik (ITI)
Prüfungsdaten 04.02.2011
Referent/Betreuer Prof. P. Sanders
Schlagworte algorithm engineering, shortest paths, Dijkstra, road network, public transit
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page