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.
Candidate Sets for Alternative Routes in Road Networks - Extended Abstract
6th Annual Symposium on Combinatorial Search (SoCS 2013)
|Links:||PDF (Poster)PDF (Abtract)|
Leavenworth, WA, USA
Dennis Luxen, Dennis Schieferdecker