|Table of Contents|

Analysis method of urban road network structure based on complex network(PDF)

《交通运输工程学报》[ISSN:1671-1637/CN:61-1369/U]

Issue:
2012年05期
Page:
64-71
Research Field:
交通运输规划与管理
Publishing date:

Info

Title:
Analysis method of urban road network structure based on complex network
Author(s):
ZHANG Wei-hua;  YANG Bo;  CHEN Jun-jie
School of Transportation Engineering, Hefei University of Technology, Hefei 230009, Anhui, China
Keywords:
traffic engineering;  urban road network;  shortest path;  complex network;  Dijkstra algorithm;  Space L method
PACS:
U491.13
DOI:
-
Abstract:
Based on urban road network, the feasibility and effectiveness of complex network theory application were analyzed. By using Dijkstra shortest path algorithm and Space L method, the initial topology network was built, and the characteristic index models of the degree of node, the degree of edge and the road impedance of node were set up. Under the premise of reflecting the reality of road network function, the initial topology network was optimized, and empirical analysis was carried out by using road traffic data in a central urban area. Analysis result shows that in the initial topology network, the average node degree is 2.850 0 and the standard deviation of node degree is 0.670 8. The average road impedance of node is 84.680 0 s and the standard deviation is 11.768 8 s. While in the optimal topology network, the average node degree is 38.750 0 and the standard deviation of node degree is 24.683 0. The average road impedance of nodes is 91.780 0 s and the standard deviation is 18.862 8 s. The average degree of east-west road section is 42.00, the average degree of north-south road section is 29.86, the average degree of internal section is 55.00, and the average degree of external road section is 28.33. In the optimal topology network, when the node with large degree is not stable, the road impedance of shortest path will increase in non-crowded state, and the road network will be paralyzed in crowded state. The node with higher degree is accord with the importance degree of intersection in real road network, and the difference of importance degree for intersection can be more reflected. 4 tabs, 6 figs, 15 refs.

References:

[1] GUO Ji-fu, GAO Yong, WEN Hui-min. Assessment methodology of connect reliability based on substituted route[J]. Journal of Highway and Transportation Research and Development, 2007, 24(7): 91-94.
[2] CHEN A, YANG Hai, LO H K, et al. Capacity reliability of a road network: an assessment methodology and numerical results[J]. Transportation Research Part B: Methodological, 2002, 36(3): 225-252.
[3] CHEN A, YANG Hai, LO H K, et al. A capacity related reliability for transportation networks[J]. Journal of Advanced Transportation, 1999, 33(2): 183-200.
[4] WATTS D J, STROGATZ S H. Collective dynamics of ‘small-world' networks[J]. Nature, 1998, 393(6684): 440-442.
[5] BARABASI A L, ALBERT R. Emergence of scaling in random networks[J]. Science, 1999, 286(5439): 509-512.
[6] ALBERT R, BARABASI A L. Statistical mechanics of complex networks[J]. Reviews Modern Physics, 2002, 74(1): 47-97.
[7] JIANG Bing, CLARAMUNT C. A structural approach to the model generalisation of an urban street network[J]. Geoinformatical, 2004, 8(2): 157-171.
[8] PORTA S, CRUCITT I P, LATORA V. The network analy-sis of urban streets: a dual approach[J]. Physica A, 2006, 369(2): 853-866.
[9] LAMMER S, GEHLSEN B, HELBIG D. Scaling laws in the spatial structure of urban road networks[J]. Physica A, 2006, 363(1): 89-95.
[10] LATORA V, MARCHIORI M. Efficient behavior of small-world networks[J]. Physical Review Letters, 2001, 87(1): 1-4.
[11] ANDREA D M, MARC B, ALESSANDRO C, et al. The structure of inter-urban traffic: a weighted network analysis[J]. Environment and Planning B: Planning and Design, 2007, 34(5): 905-924.
[12] GAO Zi-you, WU Jian-jun, MAO Bao-hua, et al. Study on the complexity of traffic networks and related problems[J]. Journal of Transportation Systems Engineering and Information Technology, 2005, 5(2): 79-83.
[13] GAO Zi-you, LI Ke-ping, LI Xin-gang, et al. Scaling laws of the network traffic flow[J]. Physica A, 2007, 380(1): 577-584.
[14] JIANG Bing. A topological pattern of urban street networks: universality and peculiarity[J]. Physica A, 2007, 384(2): 647-655.
[15] MA Jia-qi, BAI Yan, HAN Bao-ming. Characteristic analysis of basic unit and complex network for urban rail transit[J]. Journal of Traffic and Transportation Engineering, 2010, 10(4): 65-70.

Memo

Memo:
-
Last Update: 2012-11-05