Time-dependent route planning

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

Volumn 5868 LNCS, Issue , 2009, Pages 207-230

  Delling, Daniel ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FAST COMPUTATION; PUBLIC TRANSPORTATION; REAL WORLD DATA; ROAD NETWORK; ROUTE PLANNING; SPEED-UPS; TIME-DEPENDENT; TIME-DEPENDENT NETWORKS; TIME-DEPENDENT SHORTEST PATHS;

MOTOR TRANSPORTATION; TRANSPORTATION ROUTES;

ONLINE SYSTEMS;

EID: 77956298183     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05465-5_8     Document Type: Conference Paper

References (32)

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 2009), pp. 97-105. SIAM, Philadelphia (2009)
2. Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM Journal of Experimental Algorithmics, 2.4-2.29 14 (2009); special Section on Selected Papers from ALENEX 2008
3. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. In: McGeoch, C. C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 303-318. Springer, Heidelberg (2008)
4. Cooke, K., Halsey, E.: The Shortest Route Through a Network with Time-Dependent Intermodal Transit Times. Journal of Mathematical Analysis and Applications 14, 493-498 (1966)
5. Dean, B. C.: Continuous-Time Dynamic Shortest Path Algorithms. Master's thesis, Massachusetts Institute of Technology (1999)
6. Delling, D.: Time-Dependent SHARC-Routing. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 332-343. Springer, Heidelberg (2008)
7. Delling, D.: Engineering and Augmenting Route Planning Algorithms. PhD thesis, Universität Karlsruhe (TH), Fakultät für Informatik (2009)
8. Delling, D.: Time-Dependent SHARC-Routing. Algorithmica, July 2009. Special Issue: European Symposium on Algorithms (2008)
9. Delling, D., Nannicini, G.: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 812-824. Springer, Heidelberg (2008)
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. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009)
11. Delling, D., Wagner, D.: Landmark-Based Routing in Dynamic Graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 52-65. Springer, Heidelberg (2007)
12. Delling, D., Wagner, D.: Pareto Paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 125-136. Springer, Heidelberg (2009)
13. Dijkstra, E. W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959)
14. 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)
15. * Search Meets Graph Theory. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156-165 (2005)
16. 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 2005), pp. 26-40. SIAM, Philadelphia (2005)
17. Hart, P. E., Nilsson, N., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4, 100-107 (1968)
18. 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 Path Computations: Ninth DIMACS Challenge. DIMACS Book, vol. 24. American Mathematical Society (to appear, 2009)
19. Ikeda, T., Hsu, M.-Y., Imai, H., Nishimura, S., Shimoura, H., Hashimoto, T., Tenmoku, K., Mitoh, K.: A fast algorithm for finding better routes by AI search techniques. In: Proceedings of the Vehicle Navigation and Information Systems Conference (VNSI 1994), pp. 291-296. ACM Press, New York (1994)
20. Kaufman, D. E., Smith, R. L.: Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Application. Journal of Intelligent Transportation Systems 1(1), 1-11 (1993)
21. Köhler, E., Möhring, R. H., Schilling, H.: Acceleration of Shortest Path and Constrained Shortest Path Computation. In: Nikoletseas, S. E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 126-138. Springer, Heidelberg (2005)
22. 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)
23. Lauther, U.: An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road-networks with Precalculated Edge-Flags. In: Demetrescu, C., Goldberg, A. V., Johnson, D. S. (eds.) Shortest Path Computations: Ninth DIMACS Challenge. DIMACS Book, vol. 24, American Mathematical Society (to appear, 2009)
24. Möhring, R. H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: artitioning Graphs to Speed Up Dijkstra's Algorithm. In: Nikoletseas, S. E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 189-202. Springer, Heidelberg (2005)
25. Möhring, R. H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics 11, 2. 8 (2006)
26. * Search for Time-Dependent Fast Paths. In: McGeoch, C. C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 334-346. Springer, Heidelberg (2008)
27. Orda, A., Rom, R.: Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the ACM 37(3), 607-625 (1990)
28. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics 12, Article 2.4 (2007)
29. Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. In: Brodal, G. S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568-579. Springer, Heidelberg (2005)
30. Schulz, F., Wagner, D., Weihe, K.: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. In: Vitter, J. S., Zaroliagis, C. D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 110-123. Springer, Heidelberg (1999)
31. Sedgewick, R., Vitter, J. S.: Shortest Paths in Euclidean Graphs. Algorithmica 1(1), 31-48 (1986)
32. Wagner, D., Willhalm, T.: Drawing Graphs to Speed Up Shortest-Path Computations. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005), pp. 15-24. SIAM, Philadelphia (2005)