Candidate Sets for Alternative Routes in Road Networks

  • Dennis Luxen
  • Dennis Schieferdecker
Conference paper

DOI: 10.1007/978-3-642-30850-5_23

Volume 7276 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Luxen D., Schieferdecker D. (2012) Candidate Sets for Alternative Routes in Road Networks. In: Klasing R. (eds) Experimental Algorithms. SEA 2012. Lecture Notes in Computer Science, vol 7276. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Dennis Luxen
    • 1
  • Dennis Schieferdecker
    • 1
  1. 1.Karlsruhe Institute of TechnologyKarlsruheGermany