Efficient data management in support of shortest-path computation

4th ACM SIGSPATIAL International Workshop on Computational Transportation Science 2011, CTS'11, in Conjunction with ACM SIGSPATIAL GIS 2011

Volumn , Issue , 2011, Pages 28-33

  Efentakis, Alexandros ^a   Pfoser, Dieter ^a   Voisard, Agnès ^b  

^a INSTITUTE FOR THE MANAGEMENT OF INFORMATION SYSTEMS   (Greece)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

cell manager; HBA; OpenStreetMap; shortest path computation

Indexed keywords

ALGORITHMIC SOLUTIONS; COMPUTATION PERFORMANCE; DEGREE OF CHANGE; EXPERIMENTAL EVALUATION; HBA; MAIN MEMORY; OPENSTREETMAP; PRE-COMPUTATION; ROAD NETWORK; SHORTEST PATH COMPUTATIONS; SHORTEST PATH PROBLEM; SHORTEST-PATH;

GRAPH THEORY; HIGHWAY ADMINISTRATION; MOTOR TRANSPORTATION; ROADS AND STREETS;

INFORMATION MANAGEMENT;

EID: 83455266522     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2068984.2068990     Document Type: Conference Paper

References (15)

1. H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast routing in road networks with transit nodes. Science, 316(5824):566, 2007. (Pubitemid 46683135)
2. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
3. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: faster and simpler hierarchical routing in road networks. In Proceedings of the 7th international conference on Experimental algorithms, WEA'08, pages 319-333, Berlin, Heidelberg, 2008. Springer-Verlag.
4. A. V. Goldberg and C. Harrelson. Computing the shortest path: A*search meets graph theory. In 16th ACM-SIAM Symposium on Discrete Algorithms, pages 156-165, 2004.
5. A. V. Goldberg, H. Kaplan, and R. F. Werneck. Reach for A*: Efficient point-to-point shortest path algorithms. In Workshop on Algorithm Engineering and Experiments, pages 129-143, 2006.
6. A. V. Goldberg and R. F. F. Werneck. Computing point-to-point shortest paths from external memory. In Algorithm Engineering and Experimentation, pages 26-40, 2005.
7. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4:100-107, 1968.
8. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20:359-392, December 1998. (Pubitemid 128689516)
9. J. Maue, P. Sanders, and D. Matijevic. Goal directed shortest path queries using precomputed cluster distances. In 5th Workshop on Experimental Algorithms (WEA), Number 4007 IN LNCS, pages 316-328. Springer, 2006.
10. R. H. Möhring, H. Schilling, B. Schütz, D. Wagner, and T. Willhalm. Partitioning graphs to speedup dijkstra's algorithm. J. Exp. Algorithmics, 11, February 2007.
11. D. Pfoser, A. Efentakis, A. Voisard, and C. Wenk. A new perspective on efficient and dependable vehicle routing. In Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS '09, pages 388-391, New York, NY, USA, 2009. ACM.
12. D. Pfoser, N. Tryfona, and A. Voisard. Dynamic travel time maps - enabling efficient navigation. In Proceedings of the 18th International Conference on Scientific and Statistical Database Management, pages 369-378, Washington, DC, USA, 2006. IEEE Computer Society.
13. P. Sanders and D. Schultes. Highway hierarchies hasten exact shortest path queries. In European Symposium on Algorithms, pages 568-579, 2005.
14. P. Sanders and D. Schultes. Engineering fast route planning algorithms. In Proceedings of the 6th international conference on Experimental algorithms, WEA'07, pages 23-36, Berlin, Heidelberg, 2007. Springer-Verlag.
15. P. Sanders, D. Schultes, and C. Vetter. Mobile route planning. In Proceedings of the 16th annual European symposium on Algorithms, ESA '08, pages 732-743, Berlin, Heidelberg, 2008. Springer-Verlag.