Alternative routes in road networks

ACM Journal of Experimental Algorithmics

Volumn 18, Issue 1, 2013, Pages

  Abraham, Ittai ^a   Delling, Daniel ^a   Goldberg, Andrew V ^a   Werneck, Renato F ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Alternative paths; Route planning; Shortest paths; Speed up techniques

Indexed keywords

EID: 84878069651     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/2444016.2444019     Document Type: Conference Paper

References (18)

1. ABRAHAM, I., DELLING, D., GOLDBERG, A. V., AND WERNECK, R. F. 2010a. Alternative routes in road networks. In Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10). Springer, 23-34.
2. ABRAHAM, I., FIAT, A., GOLDBERG, A. V., AND WERNECK, R. F. 2010b. Highway dimension, shortest paths, and provably efficient algorithms. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10). 782-793.
3. BADER, R., DEES, J., GEISBERGER, R., AND SANDERS, P. 2011. Alternative route graphs in road networks. In Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11). Springer, 21-32.
4. CAMBRIDGE VEHICLE INFORMATION TECHNOLOGY LTD. 2005. Choice routing. http://www.camvit.com.
5. CHEN, Y., BELL, M. G. H., AND BOGENBERGER, K. 2007. Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system. IEEE Trans. Intell. Transp. Syst. 8, 1, 14-20.
6. DANTZIG, G. B. 1962. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
7. DELLING, D., SANDERS, P., SCHULTES, D., AND WAGNER, D. 2009. Engineering route planning algorithms. In Algorithmics of Large and Complex Networks, J. Lerner, D. Wagner, and K. Zweig, Eds., Springer, 117-139.
8. DELLING, D. AND WAGNER, D. 2009. Pareto paths with SHARC. In Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09). Springer, 125-136.
9. DEMETRESCU, C., GOLDBERG, A. V., AND JOHNSON, D. S., Eds. 2006. Proceedings of the DIMACS Implementation Challenge: Shortest Paths.
10. DIJKSTRA, E.W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1, 269-271.
11. EPPSTEIN, D. 1994. Finding the k shortest paths. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS'94). 154-165.
12. GEISBERGER, R., KOBITZSCH, M., AND SANDERS, P. 2010. Route planning with flexible objective functions. In Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10). SIAM, 124-137.
13. GEISBERGER, R., SANDERS, P., SCHULTES, D., AND DELLING, D. 2008. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In Proceedings of the 7th International Conference on Experimental Algorithms (WEA'08). Springer, 319-333.
14. GOLDBERG, A. V., KAPLAN, H., AND WERNECK, R. F. 2009. Reach for A*: Shortest path algorithms with preprocessing. In The Shortest Path Problem: Ninth DIMACS Implementation Challenge, C. Demetrescu, A. V. Goldberg, and D. S. Johnson, Eds., American Mathematical Society, 93-139.
15. GUTMAN, R. J. 2004. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In Proceedings of the 6thWorkshop on Algorithm Engineering and Experiments (ALENEX'04). SIAM, 100-111.
16. HANSEN, P. 1979. Bricriteria path problems. In Multiple Criteria Decision Making: Theory and Application, G. Fandel and T. Gal, Eds., Springer, 109-127.
17. MARTINS, E. Q. 1984. On a multicriteria shortest path problem. Euro. J. Oper. Res. 26, 3, 236-245.
18. SCHULTES, D. AND SANDERS, P. 2007. Dynamic highway-node routing. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Springer, 66-79.