Time-dependent SHARC-routing

Algorithmica (New York)

Volumn 60, Issue 1, 2011, Pages 60-94

  Delling, Daniel ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Algorithm engineering; Graph algorithms; Time dependent shortest paths; Timetable information

Indexed keywords

ALGORITHM ENGINEERING; DIJKSTRA'S ALGORITHMS; EFFICIENT ALGORITHM; FAST TECHNIQUES; GRAPH ALGORITHMS; ROAD NETWORK; ROUTE PLANNING; SHORTEST PATH; SPEED-UPS; TIME-DEPENDENT; TIME-DEPENDENT NETWORKS; TIME-DEPENDENT SHORTEST PATHS; TIME-TABLE INFORMATION; TRAFFIC JAMS; TRANSPORTATION NETWORK;

GRAPH THEORY; MOTOR TRANSPORTATION; OPERATIONS RESEARCH; ROADS AND STREETS; TRAFFIC CONGESTION;

ALGORITHMS;

EID: 79952186628     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-009-9341-0     Document Type: Conference Paper

References (37)

1. Batz, V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09), pp. 97-105. SIAM, New York (2009)
2. Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. In: Munro, I., Wagner, D. (eds.) Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08), pp. 13-26. SIAM, New York (2008)
3. R. Bauer D. Delling 2009 SHARC: fast and robust unidirectional routing ACM J. Exp. Algorithmics 14 2.4 2.29 10.1145/1498698.1537599 Special Section on Selected Papers from ALENEX 2008
4. Brodal, G., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. (Pubitemid 40700007)
5. K. Cooke E. Halsey 1966 The shortest route through a network with time-dependent intermodal transit times J. Math. Anal. Appl. 14 493 498 192921 0173.47601 10.1016/0022-247X(66)90009-6
6. Dean, B.C.: Continuous-time dynamic shortest path algorithms. Master's thesis, Massachusetts Institute of Technology (1999)
7. Delling, D.: Time-dependent SHARC-routing. In: Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08). Lecture Notes in Computer Science, vol. 5193, pp. 332-343. Springer, Berlin (2008). Best Student Paper Award-ESA Track B
8. Delling, D., Nannicini, G.: Bidirectional core-based routing in dynamic time-dependent road networks. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08). Lecture Notes in Computer Science, vol. 5369, pp. 813-824. Springer, Berlin (2008)
9. Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Lecture Notes in Computer Science, vol. 4525, pp. 52-65. Springer, Berlin (2007)
10. 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. Lecture Notes in Computer Science, vol. 5515, pp. 117-139. Springer, Berlin (2009)
11. Delling, D., Sanders, P., Schultes, D., Wagner, D., Highway hierarchies star. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Path Computations: Ninth DIMACS Challenge. DIMACS Book. American Mathematical Society (2009, in press)
12. E.W. Dijkstra 1959 A note on two problems in connexion with graphs Numer. Math. 1 269 271 107609 0092.16002 10.1007/BF01386390
13. Disser, Y., Müller-Hannemann, M., Schnee, M.: Multi-criteria shortest paths in time-dependent train networks. In: McGeoch, C.C. (ed.) Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08). Lecture Notes in Computer Science, vol. 5038, pp. 347-361. Springer, Berlin (2008)
14. Flinsenberg, I.C.: Route Planning Algorithms for Car Navigation. PhD thesis, Technische Universiteit Eindhoven (2004)
15. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08). Lecture Notes in Computer Science, vol. 5038, pp. 319-333. Springer, Berlin (2008)
16. Goldberg, A.V., Harrelson, C.: Computing the shortest path: A*search meets graph theory. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), pp. 156-165 (2005) (Pubitemid 40851368)
17. Goldberg, A.V., Werneck, R.F.: Computing point-to-point shortest paths from external memory. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05), pp. 26-40. SIAM, New York (2005) (Pubitemid 43206496)
18. Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: efficient point-to-point shortest path algorithms. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06), pp. 129-143. SIAM, New York (2006) (Pubitemid 43774927)
19. Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better landmarks within reach. In: Demetrescu, C. (ed.) Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Lecture Notes in Computer Science, vol. 4525, pp. 38-51. Springer, Berlin (2007) (Pubitemid 350259659)
20. P.E. Hart N. Nilsson B. Raphael 1968 A formal basis for the heuristic determination of minimum cost paths IEEE Trans. Syst. Sci. Cybern. 4 100 107 10.1109/TSSC.1968.300136
21. Hilger, M., Köhler, E., Möhring, R.H., Schilling, H.: Fast point-to-point shortest path computations with arc-flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society (2009). To appear
22. D.E. Kaufman 1993 Fastest paths in time-dependent networks for intelligent vehicle-highway systems application J. Intell. Transp. Syst. 1 1 1 11 10.1080/10248079308903779
23. Köhler, E., Möhring, R.H., Schilling, H.: Acceleration of shortest path and constrained shortest path computation. In: Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05). Lecture Notes in Computer Science, pp. 126-138. Springer, Berlin (2005) (Pubitemid 41322440)
24. Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation und Mobilität-von der Forschung zur praktischen Anwendung, vol. 22, pp. 219-230. IfGI prints (2004)
25. Lauther, U.: An experimental evaluation of point-to-point shortest path calculation on roadnetworks with precalculated edge-flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society (2009). To appear
26. Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed up Dijkstra's algorithm. In: Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05). Lecture Notes in Computer Science, pp. 189-202. Springer, Berlin (2005) (Pubitemid 41322445)
27. Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speedup Dijkstra's algorithm. ACM J. Exp. Algorithmics 11(2.8) (2006)
28. Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A*search for time-dependent fast paths. In: McGeoch, C.C. (ed.) Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08). Lecture Notes in Computer Science, vol. 5038, pp. 334-346. Springer, Berlin (2008)
29. A. Orda R. Rom 1990 Shortest-path and minimum delay algorithms in networks with time-dependent edge-length J. ACM 37 3 607 625 1072271 0699.68074 10.1145/79147.214078 (Pubitemid 20723071)
30. Pellegrini, F.: SCOTCH: static mapping, graph, mesh and hypergraph partitioning, and parallel and sequential sparse matrix ordering package (2007)
31. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Towards realistic modeling of time-table information through the time-dependent approach. In: Proceedings of ATMOS Workshop 2003, pp. 85-103 (2004) (Pubitemid 40700012)
32. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM J. Exp. Algorithmics 12(2.4) (2007)
33. R Development Core Team. R: A language and environment for statistical computing (2004)
34. Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05). Lecture Notes in Computer Science, vol. 3669, pp. 568-579. Springer, Berlin (2005) (Pubitemid 41491557)
35. Sanders, P., Schultes, D.: Engineering highway hierarchies. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06). Lecture Notes in Computer Science, vol. 4168, pp. 804-816. Springer, Berlin (2006) (Pubitemid 44699700)
36. Schultes, D.: Route planning in road networks. PhD thesis, Universität Karlsruhe (TH), Fakultät für Informatik, February (2008)
37. Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Lecture Notes in Computer Science, vol. 4525, pp. 66-79. Springer, Berlin (2007) (Pubitemid 350259661)