Core Routing on Dynamic Time-Dependent Road Networks

References

• Batz G. V., Delling D., Sanders P., Vetter C. Time-dependent contraction hierarchies. Proc. 11th Workshop Algorithm Engrg. Experiments (ALENEX'09) (2009) (SIAM, Philadelphia) 97–105Crossref, Google Scholar
• Bauer R., Delling D. SHARC: Fast and robust unidirectional routing. ACM J. Experiment. Algorithmics (2009) 14Article 2.4Crossref, Google Scholar
• Bauer R., Delling D., Sanders P., Schieferdecker D., Schultes D., Wagner D. Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm. ACM J. Experiment. Algorithmics (2010) 15Article 2.3Crossref, Google Scholar
• Cooke K. L., Halsey E. The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. (1966) 14(3):493–498Crossref, Google Scholar
• Cormen T. H., Leiserson C. E., Rivest R. L., Stein C.Introduction to Algorithms (2001) 2nd ed.(MIT Press, Cambridge, MA) Google Scholar
• Daganzo C. F. Reversibility of time-dependent shortest path problem. (1998) . Technical report, Institute of Transportation Studies, University of California, BerkeleyGoogle Scholar
• Dean B. C. Continuous-time dynamic shortest path algorithms. (1999) . Master's thesis, Massachussets Institute of Technology, Cambridge, MAGoogle Scholar
• Delling D. Time-dependent SHARC-routing. Algorithmica (2011) 60(1):60–94Crossref, Google Scholar
• Delling D., Nannicini G., Hong S.-H., Nagamochi H., Fukunaga T. Bidirectional core-based routing in dynamic time-dependent road networks. Proc. 19th Internat. Symposium on Algorithms and Computation (ISAAC 08), Vol. 5369 (2008) (Springer, Berlin) 813–824Lecture Notes in Computer ScienceCrossref, Google Scholar
• Delling D., Wagner D., Demetrescu C. Landmark-based routing in dynamic graphs. Proc. Sixth Internat. Conf. Experiment. Algorithms, Vol. 4525 (2007) (Springer, Berlin) 52–65Lecture Notes in Computer ScienceCrossref, Google Scholar
• Delling D., Sanders P., Schultes D., Wagner D., Lerner J., Wagner D., Zweig K. A. Engineering route planning algorithms. Algorithmics of Large and Complex Networks, Vol. 5515 (2009a) (Springer, Berlin) 117–139Lecture Notes in Computer ScienceCrossref, Google Scholar
• Delling D., Sanders P., Schultes D., Wagner D., Demetrescu C., Goldberg A. V., Johnson D. S. Highway hierarchies star. The Shortest Path Problem: Ninth DIMACS Implementation Challenge, Vol. 74 (2009b) (American Mathematical Society, Providence, RI) 141–174DIMACS BookCrossref, Google Scholar
• Dijkstra E. W. A note on two problems in connexion with graphs. Numerische Mathematik (1959) 1:269–271Crossref, Google Scholar
• Dreyfus S. E. An appraisal of some shortest-path algorithms. Oper. Res. (1969) 17(3):395–412Link, Google Scholar
• Geisberger R., Sanders P., Schultes D., Delling D., McGeoch C. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. Proc. 8th Workshop Experiment. Algorithms, Vol. 5038 (2008) (Springer, Berlin) 319–333Lecture Notes in Computer ScienceCrossref, Google Scholar
• Goldberg A. V., Harrelson C. Computing the shortest path: A* meets graph theory. Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA 2005) (2005) (SIAM, Philadelphia) 156–165Google Scholar
• Goldberg A. V., Werneck R. F., Demetrescu C., Sedgewick R., Tamassia R. Computing point-to-point shortest paths from external memory. Proc. 7th Workshop Algorithm Engrg. Experimentation (ALENEX 05) (2005) (SIAM, Philadelphia) 26–40Google Scholar
• Goldberg A. V., Kaplan H., Werneck R. F., Raman R., Sedgewick R., Stallman M. F. Reach for A*: Efficient point-to-point shortest path algorithms. Proc. 8th Workshop on Algorithm Engrg. Experiments (ALENEX 06) (2006) (SIAM, Philadelphia) 129–143Crossref, Google Scholar
• Goldberg A. V., Kaplan H., Werneck R. F., Demetrescu C. Better landmarks within reach. Proc. Sixth Internat. Conf. Experiment. Algorithms, Vol. 4525 (2007) (Springer, Berlin) 38–51Lecture Notes in Computer ScienceCrossref, Google Scholar
• Goldberg A. V., Kaplan H., Werneck R. F., Demetrescu C., Goldberg A. V., Johnson D. S. Reach for A*: Shortest path algorithms with preprocessing. The Shortest Path Problem: Ninth DIMACS Implementation Challenge, Vol. 74 (2009) (American Mathematical Society)93–139DIMACS BookCrossref, Google Scholar
• Hart E. P., Nilsson N. J., Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems, Sci. Cybernetics (1968) 4(2):100–107Crossref, Google Scholar
• Ikeda T., Tsu M., Imai H., Nishimura S., Shimoura H., Hashimoto T., Tenmoku K., Mitoh K. A fast algorithm for finding better routes by AI search techniques. Proc. IEEE Vehicle Navigation Inform. Systems Conf. (2004) (IEEE, Piscataway, NJ) 291–296Google Scholar
• Kaufman D. E., Smith R. L. Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. J. Intelligent Transportation Systems (1993) 1(1):1–11Google Scholar
• Kerner B. S.The Physics of Traffic: Empirical Freeway Pattern Features, Engineering Applications, and Theory (2004) (Springer, Berlin) Crossref, Google Scholar
• Lauther U., Raubal M., Sliwinsky A., Kuhn W. An extremely fast exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilität—Von der Forschung zur praktischen Anwendung, IfGI prints (2004) 22(Institut für Geoinformatik, Westfalische Wilhelms-Universität, Münster, Germany) 219–230Google Scholar
• Nannicini G., Delling D., Liberti L., Schultes D., McGeoch C. Bidirectional A* search for time-dependent fast paths. Proc. 8th Workshop Experiment. Algorithms, Vol. 5038 (2008) (Springer, Berlin) 334–346Lecture Notes in Computer ScienceCrossref, Google Scholar
• Orda A., Rom R. Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. J. ACM (1990) 37(3):607–625Crossref, Google Scholar
• Sanders P., Schultes D., Brodal G. S., Leonardi S. Highway hierarchies hasten exact shortest path queries. Proc. 13th Annual European Symposium on Algorithms (ESA 2005), Vol. 3669 (2005) (Springer, Berlin) 568–579Lecture Notes in Computer ScienceCrossref, Google Scholar
• Sanders P., Schultes D., Demetrescu C. Dynamic highway-node routing. Proc. Sixth Internat. Conf. Experiment. Algorithms, Vol. 4525 (2007) (Springer, Berlin) 66–79Lecture Notes in Computer ScienceGoogle Scholar