Candidate Sets for Alternative Routes in Road Networks
- 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
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.
Unable to display preview. Download preview PDF.