Candidate Sets for Alternative Routes in Road Networks (Extended Abstract)

Authors

  • Dennis Luxen Karlsruhe Institute of Technology (KIT)
  • Dennis Schieferdecker Karlsruhe Institute of Technology (KIT)

DOI:

https://doi.org/10.1609/socs.v4i1.18271

Keywords:

Route Planning, Alternative Routes, Shortest Path Algorithms

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.

SoCS 2013 Proceedings Cover

Downloads

Published

2021-08-20

Issue

Vol. 4 No. 1 (2013): Sixth Annual Symposium on Combinatorial Search

Section

Extended Abstracts