当前位置:主页 > 科技论文 > 交通工程论文 >

重庆市公共交通网络复杂性研究

发布时间:2018-01-07 01:37

  本文关键词:重庆市公共交通网络复杂性研究 出处:《重庆交通大学》2014年硕士论文 论文类型:学位论文


  更多相关文章: 复杂网络 城市公共交通网络 拓扑参数 小世界特性


【摘要】:伴随科学技术的迅猛发展,人们对网络的认识越来越深入。近年来,来自生物、数学、计算机、经济等不同学科领域的研究者对复杂网络越来越关注,成为现代研究的一个热点。城市公共交通网络作为城市客运方面重要的基础设施,对城市的经济发展和市民生活水平的提高起到至关重要的作用,公共交通线路的规划与运营对人们的出行有着重要影响。 本文采用复杂网络的基本理论,以实证研究为向导,从重庆市公共交通系统的网络拓扑结构出发,按照Space-L方法构建了重庆市常规公共交通站点网络、重庆市常规公共交通线路网络以及重庆市广义公共交通站点网络、重庆市广义公共交通线路网络四个模型。通过分析这四个网络模型中一些重要的拓扑参数,如网络节点的度与度分布、聚集系数以及最短路径距离,利用计算机编程来对这些参数进行相关的分析及统计,得到重庆市不同公共交通网络模式下的各种拓扑参数值,并进行相关的说明,,本文主要的内容可以分下面三部分讲述。 首先,本文针对重庆市常规公共交通网络建立了以常规公共交通站点为节点、站点间是否有公共交通线路相连为边的站点网络以及以常规公共交通线路为节点、线路之间是否经过相同的站点为边的线路网络。然后分别对这两个网络的有关度、度分布、聚类系数以及最短路径距离做了相关的计算和分析,最后得出常规公共交通的站点网络的度、聚类系数以及最短路径距离的平均值分别为2.49、0.115和14.0541,并且前两者服从幂律分布,后者服从高斯分布,而对于线路网络得出居民日常出行的平均换乘次数为2.2236次; 其次,在常规公共交通网络的基础上加入重庆市轨道交通,形成重庆市广义公共交通网络。然后按照相同的建模方法针对重庆市广义公共交通网络的站点网络以及线路网络的度、度分布、聚类系数以及最短路径距离进行编程计算及分析,分析得出在加入轨道交通后,重庆市的公共交通网络的相关拓扑参数都得到了一定程度的优化。 最后,对本文的研究数据进行总结分析,然后对重庆市公共交通节点网络进行蓄意和随机两种攻击模式下的研究。证明了重庆市公共交通网络在蓄意攻击下表现出较强的脆弱性以及在随机攻击下表现出较强的鲁抗性;最后提出了有关后续研究的一些方向以及注意事项。
[Abstract]:With the rapid development of science and technology, people have more and more in-depth understanding of the network. In recent years, researchers from biology, mathematics, computer, economics and other different disciplines pay more and more attention to complex networks. As an important infrastructure in urban passenger transport, urban public transport network plays a vital role in the economic development of the city and the improvement of the standard of living of the citizens. The planning and operation of public transportation lines have an important impact on people's travel. In this paper, the basic theory of complex network and empirical research are used to guide the network topology of Chongqing public transportation system. According to the Space-L method, the network of Chongqing public transport stations, the Chongqing public transport line network and the general public transport station network of Chongqing are constructed. By analyzing some important topological parameters of the four network models, such as the degree and degree distribution of network nodes, the aggregation coefficient and the shortest path distance. Using computer programming to carry on the correlation analysis and statistics to these parameters, get the various topological parameters value under the different public transportation network mode of Chongqing, and carry on the related explanation. The main content of this paper can be divided into the following three parts. First of all, this paper establishes a conventional public transport station as a node for Chongqing public transport network. Whether there is a network of stations where public transport lines are connected to each other and where conventional public transport lines are used as nodes. Then the correlation degree, degree distribution, clustering coefficient and shortest path distance of the two networks are calculated and analyzed. Finally, the average values of station network, clustering coefficient and shortest path distance of conventional public transport are 2.49 and 14.0541respectively, and the former two are distributed according to power law. The latter is distributed from Gao Si, and for the line network, the average number of daily commutations is 2.2236; Secondly, on the basis of the conventional public transport network, join the Chongqing rail transit. Then according to the same modeling method, it aims at the degree and degree distribution of the station network and the line network of Chongqing generalized public transport network. The clustering coefficient and the shortest path distance are calculated and analyzed by programming. It is concluded that the relevant topological parameters of public transport network in Chongqing have been optimized to a certain extent after the addition of rail transit. Finally, the research data of this paper are summarized and analyzed. Then, the paper studies Chongqing public transport node network under two attack modes: intentional attack and random attack. It is proved that Chongqing public transport network shows strong vulnerability under intentional attack and random attack. Strong resistance to Lu; Finally, some directions and points for attention about the follow-up research are put forward.
【学位授予单位】:重庆交通大学
【学位级别】:硕士
【学位授予年份】:2014
【分类号】:U491.17

【参考文献】

相关期刊论文 前8条

1 俞桂杰;彭语冰;褚衍昌;;复杂网络理论及其在航空网络中的应用[J];复杂系统与复杂性科学;2006年01期

2 顾前;杨旭华;王万良;王波;;基于复杂网络的城市公共交通网络研究[J];计算机工程;2008年20期

3 杨雅琴;杨进才;曹继伟;;基于仿真平台的复杂网络建模研究[J];计算机与数字工程;2006年03期

4 王U

本文编号:1390439


资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/jiaotonggongchenglunwen/1390439.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户c5de2***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com