Study on the Complexity of Traffic Networks and Related Problems

Abstract

Abstract: According to the network topology，real networks generally include：Completely Regular Networks. Completely Random Networks，Small-world networks and Scale-free Networks．This paper briefly summarizes the generation， the properties and the achievements in the complex networks and mainly studies the complexity of traffic networks and related problems．Furthermore，the scale-free characteristics and the degree distribution of urban transit network are proposed，and the experiment example of Beijing transit network is given． Moreover，in theory,we propose the method to determine the “hub” nodes in urban transit networks，which iS also the key problem of traffic networks．The further works are given from theory and application in the paper，which may offer new research methods and theory supports for the planning，designing，construction and management of traffic networks．

Key words: traffic networks, complexity, scale-free, small-world

摘要： 按照网络拓扑结构特征划分，我们经常接触到的实际网络有完全规划网络（Completely Regular Networks）、安全随机网络（Completely Random Networks）、小世界网络（Small-world Networks）和无标度网络(Scale-free Networks)．系统地对无标度网络的形成、特性和代表性研究成果进行简要总结，重点探讨交通运输网络的复杂性和相关问题，研究了城市公交网络的无标度特性及度分布指数，并以北京市公交网络为例完成了实证分析．进一步从理论上给出了怎样找到公交网络中的枢纽站点这一难题的研究思路、整体框架及求解算法，这是交通运输网络复杂性及其相关问题研究的关键．还分别从理论与应用两个层面给出了下一步研究工作的总体思路，为交通管理部门进行交通运输网络规划、设计、建设和管理提供了科学的研究手段和理论支持．

关键词: 交通运输网络, 复杂性, 无标度, 小世界

GAO Zi—you,WU Jian—jun,MAO Bao—hua,HUANG Hai—jun. Study on the Complexity of Traffic Networks and Related Problems[J]. Journal of Transportation Systems Engineering and Information Technology, 2005, 5(2): 79-84 .

高自友,吴建军,毛保华,黄海军. 交通运输网络复杂性及其相关问题的研究[J]. 交通运输系统工程与信息, 2005, 5(2): 79-84 .

Add to citation manager EndNote|Ris|BibTeX

URL: http://www.tseit.org.cn/EN/abstract/abstract17239.shtml

http://www.tseit.org.cn/EN/Y2005/V5/I2/79

References

[1] Amaral L A N．Scala A，Barthelemy M，Stanley H.E. Proc. Natl. Acad. Sci. (USA)，2000，97：11149．
[2] Barabasi A—L，Albert R．Emergence of scaling in random networks [J]．Science，1999，286：509．
[3] Barabasi A—L，Bonabeau E．Scale—free networks[J]．Scientific American，5(2003)60．
[4] Qinghua Chen，Dinghua Shi．The modeling of scale—free networks [J]．Physica A，2004，335：240．
[5] Goh K —I，Kahng B，Kim D．Packet transport and load distribution in scale-free network models[J]．Physica A ，2003，318:72．
[6] Bin Jiang， Christophe Claramunt． Topological analysis of urban street networks[J]．Environment and Planning B，2004，31：151．
[7] Konstantin Klemm ，Victor M Eguiluz．Highly clustered scale-free networks [J]．Physical review E，2002，65：036123．
[8] Vito Latora， M assimo Marchiori． Is the Boston subway a small-world network?[J]．Physica A，2002，31 4：1O9．
[9] May R M ，Lloyd A L．Infection dynamics on scale free networks [J]. Phys．Rev．E，2001，64：066112．
[10]Moore C， Newman M E J． Epidemics and percolation in small world networks[J]．Phys．Rev．E，2000，61：5678．
[11] Moore C，Newman M E J．Exact solution of site and bond percolation on small world networks[J]．Phys Rev E，2000，62：7059．
[12] Romualdo Pastor—Satorras， Alessandro Vespignani． Epidemic spreading in scale-free networks[J]．Phys．Rev．Lett．，2001，85：3200．
[13] Parongama Sen， Subinay Dasgupta， Arnab Chatterjee，Sreeram P A，Mukherjee G，Manna S S． Small—world properties of the Indian Railway
network，arXiv：cond—mat／02085 35，2002．
[14] W u J J，Gao ZY，HuangH J，SunH J．Generation of small-world networks with utility preferential attachment[R]．Technical Report of Institute of Systems Science， Beijing Jiaotong University，2004b．
[15] W u J J，Gao Z Y，Huang H J，Sun H J．Random and preferential attachment with aging[R]． Technical Report of Institute of Systems Sc ience， Beijing Jiaotong University，2004c．
[16] Wu J J，Gao Z Y，Sun H J． Simulation Traffic Congestion with SIR Model， preprint in Mod. Phys．Lett．B，2004.
[17] Wu J J，Gao Z Y，Sun H J，Huang H J．Urban transit as a scale-free network[J]．Mod．Phys．Lett．B，2004a，18：1043．
[18] Data come from：http：//www．ee1．gov．en，http：//www. bjbus．corn．