基于复杂网络的城市路网结构分析方法(英文)  

Analysis method of urban road network structure based on complex network

作　　者：张卫华[1] 杨博[1] 陈俊杰[1] 

机构地区：[1]合肥工业大学交通运输工程学院,安徽合肥230009

出　　处：《交通运输工程学报》2012年第5期64-71,共8页Journal of Traffic and Transportation Engineering

基　　金：National Natural Science Foundation of China(51178158);Special Fund for Basic Scientific Research of Ceatral Colleges(2010HGZY0010)

摘　　要：在城市道路网络的基础上,探讨了应用复杂网络理论的可行性和有效性。运用Dijkstra最短路径算法和Space L方法建立初始拓扑网络,并建立了节点度、边度和节点路阻的特性指标模型。在反映路网功能真实性的前提下,优化了拓扑网络,并以某市中心城区道路交通数据为例进行实例分析。分析结果表明:在初始网络中,节点度数的均值为2.850 0,标准差为0.670 8;节点路阻的平均值为84.680 0s,标准差为11.768 8s;在优化网络中,节点度数的均值为38.750 0,标准差为24.683 0,节点路阻的平均值为91.780 0s,标准差为18.862 8s;东西向边的平均度数为42.00,南北向边的平均度数为29.86,内部边的平均度数为55.00,外部边的平均度数为28.33。在优化网络中,当度数较大的节点在路网中失稳时,在非拥挤状态下,最短路径路阻增大,而在拥挤状态下,网络会瘫痪。度数较大的节点与真实路网中交叉口重要程度相符,能够体现交叉口重要程度的差异性。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.

关 键 词：交通规划 城市路网 最短路径 复杂网络 DIJKSTRA算法 SPACE L方法 

分 类 号：U491.13[交通运输工程—交通运输规划与管理]