An efficient route computation approach for large graphs

Proceedings of the 30th Chinese Control Conference, CCC 2011

Volumn , Issue , 2011, Pages 5537-5541

  Song, Qing ^a   Wang, Xiaofan ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Heuristics; Hierarchical; Large Graphs; Shortest Path Algorithm

Indexed keywords

COMPLEX SEARCHES; EFFICIENT ROUTING; HEURISTICS; HIERARCHICAL; HIERARCHICAL GRAPH MODEL; HIERARCHICAL ROUTING ALGORITHM; LARGE GRAPHS; LARGE NETWORKS; NETWORK OPTIMIZATION; NEW YORK CITY; ROAD NETWORK; ROUTE COMPUTATION; SEARCH SPACES; SHORTEST PATH ALGORITHMS; SUBGRAPHS; TRANSPORTATION PROBLEM;

ALGORITHMS; MOTOR TRANSPORTATION; TRAFFIC CONTROL;

GRAPH THEORY;

EID: 80053086598     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, MA: Athena Scientific, 1998.
2. R. E. Tarjan, Data Structures and Network Algorithms. Philadelphia, PA: SIAM, 1993.
3. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math., 1: 269-271, 1959.
4. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34(3): 596-615, 1987.
5. I. Pohl, Bi-directional search, Mach. Intell., 6: 127-140, 1971.
6. D. Wagner and T. Willhalm, Geometric containers for efficient shortest-path computation, ACM J. Exp. Algor., 10(1.3): 1-30, 2005.
7. R. Möhring, H. Schilling, B. Schütz, D. Wagner, and T. Willhalm, Partitioning graphs to speed up Dijkstra's algorithm, ACM J. Exp. Algor., 11(2.8): 1-29, 2006.
8. J. Maue, P. Sanders, and D. Matijevic, Goal directed shortest path queries using precomputed cluster distances, ACM J. Exp. Algor., 14(3.2): 1-27, 2009.
9. R. Rajagopalan, K. G. Mehrotra, C. K. Mohan, and P. K. Varshney, Hierarchical path computation approach for large graphs, IEEE Trans. Aerosp. Electron. Syst., 44(2): 427-440, 2008.
10. Y. W. Huang, N. Jing, and E. A. Rundensteiner, Effective graph clustering for path queries in digital map database, CIKM, Rockville, 1996: 215-222.
11. S. Jung and S. Pramanik, An efficient path computation model for hierarchically structured topographical road maps, IEEE Trans. Knowl. Data Eng., 14(5): 1029-1046, 2002.
12. F. D. Duan, A faster algorithm for shortest path-SPFA, J. Southwest Jiao Tong Univ., 29(2):207-212,1994 (in Chinese).
13. Q. Song and X. F. Wang, Efficient routing on large road networks using hierarchical communities, IEEE Trans. Intell. Transp. Syst., 12(1): 132-140, 2011.
14. http://www.dis.uniroma1.it/~challenge9/download.shtml