Candidate Sets for Alternative Routes in Road Networks
Abstract:
We present a fast algorithm with preprocessing for computing multiple good alternative routes in road networks. Our approach is based on single via node routing on top of Contraction Hierarchies and achieves superior quality and efficiency compared to previous methods. The algorithm has neglectable memory overhead.
| Zugehörige Institution(en) am KIT | Institut für Theoretische Informatik (ITI) |
| Publikationstyp | Proceedingsbeitrag |
| Publikationsjahr | 2012 |
| Sprache | Englisch |
| Identifikator | ISBN: 978-3-642-30850-5 ISSN: 0302-9743, 1611-3349 KITopen-ID: 1000097641 |
| Erschienen in | Experimental Algorithms. Ed.: R. Klasing |
| Verlag | Springer-Verlag |
| Seiten | 260-270 |
| Serie | Lecture Notes in Computer Science ; 7276 |
| Nachgewiesen in | Dimensions Scopus |
| Globale Ziele für nachhaltige Entwicklung |