Skip to main content
Conference Proceedings

Candidate sets for alternative routes in road networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7276 LNCS 260-270
DOI: 10.1007/978-3-642-30850-5_23
24Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Luxen, D., & Schieferdecker, D. (2012). Candidate sets for alternative routes in road networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7276 LNCS, pp. 260–270). https://doi.org/10.1007/978-3-642-30850-5_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free