Alternative routes in road networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6049 LNCS, Issue , 2010, Pages 23-34

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

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE ROUTES; EFFICIENT ALGORITHM; PRACTICAL USE; ROAD NETWORK; SHORTEST PATH; SOLUTION QUALITY;

MOTOR TRANSPORTATION; ROADS AND STREETS;

ALGORITHMS;

EID: 78650672099     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_3     Document Type: Conference Paper

References (14)

1. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: SODA, pp. 782-793 (2010).
2. Cambridge Vehicle Information Technology Ltd. Choice Routing (2005), http://www.camvit.com.
3. Dantzig, G.B.: Linear Programming and Extensions. Princeton Univ. Press, Princeton (1962).
4. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009).
5. Delling, D., Wagner, D.: Pareto Paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 125-136. Springer, Heidelberg (2009).
6. Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): 9thDIMACS Implementation Challenge - Shortest Paths (2006), http://www.dis.uniroma1.it/ ~challenge9/.
7. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959).
8. Eppstein, D.: Finding the k shortest paths. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1994), pp. 154-165 (1994).
9. Geisberger, R., Kobitzsch, M., Sanders, P.: Route Planning with Flexible Objective Functions. In: ALENEX, pp. 124-137. SIAM, Philadelphia (2010).
10. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319-333. Springer, Heidelberg (2008).
11. Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol. 74, pp. 93-139. American Mathematical Society, Providence (2009).
12. Gutman, R.J.: Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: ALENEX, pp. 100-111. SIAM, Philadelphia (2004).
13. Hansen, P.: Bricriteria Path Problems. In: Fandel, G., Gal, T. (eds.)MultipleCriteria Decision Making: Theory and Application, pp. 109-127. Springer, Heidelberg (1979).
14. Martins, E.Q.: On a Multicriteria Shortest Path Problem. European Journal of Operational Research 26(3), 236-245 (1984).