Efficient routing on large road networks using hierarchical communities

IEEE Transactions on Intelligent Transportation Systems

Volumn 12, Issue 1, 2011, Pages 132-140

  Song, Qing ^a   Wang, Xiaofan ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Community structure; heuristics; hierarchical routing; road networks

Indexed keywords

COMPUTER NETWORKS; GRAPH THEORY; MOTOR TRANSPORTATION; NETWORK ROUTING; ROADS AND STREETS; SOCIAL SCIENCES; TRANSPORTATION;

COMMUNITY STRUCTURES; HEURISTICS; HIERARCHICAL COMMUNITIES; HIERARCHICAL COMMUNITY STRUCTURES; HIERARCHICAL GRAPH MODEL; HIERARCHICAL ROUTING ALGORITHM; HIERARCHICAL ROUTINGS; ROAD NETWORK;

ROUTING ALGORITHMS;

EID: 85027948452     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2010.2072503     Document Type: Article

References (36)

1. R. V. Helgason, J. L. Kennington, and B. D. Stewart, "The one-to-one shortest-path problems: An empirical analysis with the two-tree Dijkstra algorithm," Comput. Optim. Appl., vol. 2, no. 1, pp. 47-75, Jun. 1993.
2. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numer. Math., vol. 1, no. 1, pp. 269-271, Dec. 1959.
3. M. L. Fredman and R. E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms," J. ACM, vol. 34, no. 3, pp. 596- 615, Jul. 1987.
4. E. P. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst. Sci. Cybern., vol. SSC-4, no. 2, pp. 100-107, Jul. 1968.
5. I. Chabini and S. Lan, "Adaptations of the A*algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks," IEEE Trans. Intell. Transp. Syst., vol. 3, no. 1, pp. 60-74, Mar. 2002. (Pubitemid 135706833)
6. Y. Y. Chen, M. G. H. Bell, and K. Bogenberger, "Reliable pretrip multipath planning and dynamic adaptation for a centralize d road navigation system," IEEE Trans. Intell. Transp. Syst., vol. 8, no. 1, pp. 14-20, Mar. 2007.
7. J.-A. Fernández-Madrigal and J. González, "Multihierarchical graph search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 1, pp. 103- 113, Jan. 2002. (Pubitemid 34325619)
8. D. Schleicher, L. M. Bergasa, M. Ocaña, R. Barea, and M. E. López, "Real-time hierarchical outdoor SLAM based on stereovision and GPS fusion," IEEE Trans. Intell. Transp. Syst., vol. 10, no. 3, pp. 440-452, Sep. 2009.
9. L. Fu, D. Sun, and L. R. Rilett, "Heuristic shortest path algorithms for transportation applications: State of the art," Comput. Oper. Res., vol. 33, no. 11, pp. 3324-3343, Nov. 2006. (Pubitemid 43333228)
10. B. Liu, "Route finding by using knowledge about the road network," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 27, no. 4, pp. 436-448, Jul. 1997. (Pubitemid 127770713)
11. G. R. Jagadeesh, T. Srikanthan, and K. H. Quek, "Heuristic techniques for accelerating hierarchical routing on road networks," IEEE Trans. Intell. Transp. Syst., vol. 3, no. 4, pp. 301-309, Dec. 2002.
12. Y. L. Chou, H. E. Romeijn, and R. L. Smith, "Approximating shortest paths in large-scale networks with an application to intelligent transportation systems," INFORMS J. Comput., vol. 10, no. 2, pp. 79-163, Feb. 1998.
13. P. Sanders and D. Schultes, "Highway hierarchies hasten exact shortest path queries," in Proc. ESA, Mallorca, Spain, Oct. 2005, pp. 568-579. (Pubitemid 41491557)
14. D. Schultes and P. Sanders, "Dynamic highway-node routing," in Proc. 6th Workshop Exp. Algorithms, Rome, Italy, Jun. 2007, pp. 66-79. (Pubitemid 350259661)
15. R. Rajagopalan, K. G. Mehrotra, C. K. Mohan, and P. K. Varshney, "Hierarchical path computation approach for large graphs," IEEE Trans. Aerosp. Electron. Syst., vol. 44, no. 2, pp. 427-440, Apr. 2008.
16. Z.Wang, O. Che, L. Chen, and A. Lim, "An efficient shortest path computation system for real road networks," in Proc. IEA/AIE, Annecy, France, Jun. 2006, pp. 711-720. (Pubitemid 44089721)
17. Y. W. Huang, N. Jing, and E. A. Rundensteiner, "Effective graph clustering for path queries in digital map database," in Proc. CIKM, Rockville, MD, Nov. 1996, pp. 215-222.
18. M. B. Habbal, H. N. Koutsopoulos, and S. R. Lerman, "A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures," Transp. Sci., vol. 28, no. 4, pp. 292-308, Nov. 1994.
19. S. Idwan and W. Etaiwi, "Computing breadth first search in large graph using hMetis partitioning," Eur. J. Sci. Res., vol. 29, no. 2, pp. 215-221, 2009.
20. S. Jung and S. Pramanik, "An efficient path computation model for hierarchically structured topographical road maps," IEEE Trans. Knowl. Data Eng., vol. 14, no. 5, pp. 1029-1046, Sep. 2002. (Pubitemid 35242613)
21. S. H. Strogatz, "Exploring complex networks," Nature, vol. 410, no. 6825, pp. 268-276, Mar. 2001. (Pubitemid 32216604)
22. S. Kaza, J. Xu, B. Marshall, and H. Chen, "Topological analysis of criminal activity networks: Enhancing transportation security," IEEE Trans. Intell. Transp. Syst., vol. 10, no. 1, pp. 83-91, Mar. 2009.
23. L. Li, X. Li, C. Cheng, C. Chen, G. Ke, D. D. Zeng, and W. T. Scherer, "Research collaboration and ITS topic evolution: 10 years at T-ITS," IEEE Trans. Intell. Transp. Syst., vol. 11, no. 3, pp. 517-523, Sep. 2010.
24. X. F. Wang, "Complex networks: Topology, dynamics and synchronization," Int. J. Bifurcat. Chaos, vol. 12, no. 5, pp. 885-916, May 2002. (Pubitemid 34866986)
25. X. F. Wang and G. R. Chen, "Complex networks: Small-world, scale-free and beyond," IEEE Circuits Syst. Mag., vol. 3, no. 1, pp. 6-20, Sep. 2003.
26. A. Clauset, C. Moore, and M. E. J. Newman, "Hierarchical structure and the prediction of missing links in networks," Nature, vol. 453, no. 7191, pp. 98-101, May 2008. (Pubitemid 351630323)
27. Z. N. Oltvai and A.-L. Barabási, "Life's complexity pyramid," Science, vol. 298, no. 5594, pp. 763-764, Oct. 2002.
28. M. Girvan and M. E. J. Newman, "Community structure in social and biological networks," Proc. Nat. Acad. Sci., vol. 99, no. 12, pp. 7821- 7826, Jun. 2002. (Pubitemid 34650963)
29. A. Lancichinetti, S. Fortunato, and J. Kertész, "Detecting the overlapping and hierarchical community structure of complex networks," New J. Phys., vol. 11, no. 3, pp. 1-18, Mar. 2009.
30. M. E. J. Newman and M. Gircan, "Finding and evaluating community structure in networks," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 69, no. 2, p. 026 113, Feb. 2004.
31. V. D. Blondel, J. L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," J. Stat. Mech., vol. 2008, no. 10, p. P10 008, Oct. 2008.
32. S. Fortunato, "Community detection in graphs," Phys. Rep., vol. 486, no. 3-5, pp. 75-174, Feb. 2010.
33. F. D. Duan, "A faster algorithm for shortest path-SPFA," J. Southwest Jiaotong Univ., vol. 29, no. 2, pp. 207-212, 1994, (in Chinese).
34. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, MA: Athena Scientific, 1998, pp. 76-78.
35. J. W. Essam and M. E. Fisher, "Some basic definitions in graph theory," Rev. Mod. Phys., vol. 42, no. 2, pp. 271-288, Apr. 1970.
36. [Online]. Available: http://www.dis.uniroma1.it/~challenge9/download. shtml