We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are locally optimal. We formally define the problem of finding alternative routes with a single via vertex, develop efficient algorithms for it, and evaluate them experimentally. Our algorithms are efficient enough for practical use and compare favorably with previous methods in both speed and solution quality. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Abraham, I., Delling, D., Goldberg, A. V., & Werneck, R. F. (2010). Alternative routes in road networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6049 LNCS, pp. 23–34). https://doi.org/10.1007/978-3-642-13193-6_3
Mendeley helps you to discover research relevant for your work.