KIT | KIT-Bibliothek | Impressum | Datenschutz

An Alternative Approach to Alternative Routes: HiDAR

Kobitzsch, Moritz

Abstract (englisch):
Alternatives to a shortest path are a common feature for modern navigation providers. In contrast to modern speed-up techniques, which are based on the unique distance between two locations within the map, computing alternative routes that might include slightly suboptimal routes seems a way more difficult problem. Especially testing a possible alternative route for its quality can so far only be done utilizing considerable computational overhead. This forces current solutions to settle for any viable alternative instead of finding the best alternative routes possible. In this paper we show a way on how to deal with this overhead in an effective manner, allowing for the computation of high quality alternative routes while maintaining competitive query times.



Originalveröffentlichung
DOI: 10.1007/978-3-642-40450-4_52
Scopus
Zitationen: 3
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Proceedingsbeitrag
Jahr 2013
Sprache Englisch
Identifikator ISBN: 978-3-642-40450-4
ISSN: 0302-9743, 1611-3349
KITopen-ID: 1000097632
Erschienen in Algorithms – ESA 2013. Ed.: H. Bodlaender
Verlag Springer, Berlin
Seiten 613–624
Serie Lecture Notes in Computer Science ; 8125
Schlagworte Short Path, Road Network, Alternative Route, Query Time, Short Path Tree
Nachgewiesen in Scopus
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page