本文選題：復雜網(wǎng)絡 + 城市公交網(wǎng)絡�。� 參考：《西南交通大學》2014年碩士論文

【摘要】：隨著各地城鎮(zhèn)化進程的不斷加快、機動車保有量持續(xù)增長,城市內交通擁堵問題日益突顯出來。城市公交是一種便利、廉價、環(huán)境友好的出行方式,所以它成為了解決城市擁堵的問題的關鍵。城市公交系統(tǒng)是一個典型的復雜巨系統(tǒng),傳統(tǒng)的研究方法在宏觀和微觀層面難以統(tǒng)一,而復雜網(wǎng)絡作為一種新興的研究復雜系統(tǒng)的方法,正越來越多的被用來研究城市公交系統(tǒng)各方面的問題。連通性是一個城市公交網(wǎng)絡服務水平的重要評價指標,公交網(wǎng)絡連通性的好壞直接關系到市民出行方式的選擇。如何評價公交網(wǎng)絡中站點對連通性的影響,進而找出網(wǎng)絡中的關鍵點,也是對公交網(wǎng)絡進行優(yōu)化所需要迫切解決的問題。 論文以公交網(wǎng)絡的兩種抽象方式：公交站點網(wǎng)絡模型和公交換乘網(wǎng)絡模型為基礎,,提出了一種在保證換乘次數(shù)最少的情況下公交站點間最短路徑長度的算法,并以Visual Studio2010為平臺實現(xiàn)了此算法,進而對公交網(wǎng)絡連通性進行了兩個方面的分析：1.提出符合乘客出行習慣的網(wǎng)絡全局效率作為評價公交網(wǎng)絡連通性的指標；2.提出將以此算法為基礎求得的節(jié)點介數(shù)作為評價節(jié)點對連通性影響程度的評價指標。 論文最后對武漢市公交網(wǎng)絡進行了數(shù)據(jù)搜集,建立其公交站點網(wǎng)絡和公交換乘網(wǎng)絡下的鄰接矩陣,以此為基礎對其特征值進行了計算和分析,實證了武漢市公交網(wǎng)絡的復雜性。計算了武漢市公交網(wǎng)絡符合乘客出行習慣的網(wǎng)絡效率,比之不考慮乘客出行習慣,效率下降了31%,但平均換乘次數(shù)保證為最少的1.45次。計算了公交網(wǎng)絡節(jié)點介數(shù),通過對比分析得到：公交站點對網(wǎng)絡連通性的影響大小與它的直連站點數(shù)目多少無關系,但是與其換乘性能有比較大的相關性。
[Abstract]:With the acceleration of urbanization and the continuous growth of vehicle ownership, traffic congestion in cities is becoming increasingly prominent. Urban public transport is a convenient, cheap and environmentally friendly way to travel, so it becomes the key to solve the problem of urban congestion. Urban public transport system is a typical complex giant system, traditional research methods are difficult to unify in macro and micro level, and complex network is a new method to study complex system. More and more are being used to study all aspects of urban transit system. Connectivity is an important index to evaluate the service level of a city's public transport network, and the connectivity of public transport network is directly related to the choice of citizens' travel mode. How to evaluate the impact of bus stations on connectivity and then find out the key points in the network is also an urgent problem to be solved for the optimization of public transport network. Based on two abstract modes of bus network: bus station network model and bus transfer network model, an algorithm of shortest path length between bus stations is proposed in this paper. The algorithm is implemented on the platform of Visual Studio2010, and then the connectivity of public transport network is analyzed from two aspects: 1. The global efficiency of the network, which accords with the travel habits of passengers, is proposed as an index to evaluate the connectivity of public transport networks. The number of nodes based on this algorithm is used as an evaluation index to evaluate the influence of nodes on connectivity. Finally, the paper collects the data of Wuhan bus network, establishes the adjacent matrix of bus station network and bus transfer network, calculates and analyzes its characteristic value, and demonstrates the complexity of Wuhan bus network. The network efficiency of Wuhan bus network in line with passengers' travel habits is calculated. The efficiency of Wuhan bus network is reduced by 31and the average transfer times are guaranteed to be the least 1.45 times compared with those without considering passengers' travel habits. The number of nodes in public transport network is calculated. Through comparative analysis, it is concluded that the influence of bus stations on network connectivity has no relation with the number of direct stations, but it has a relatively large correlation with its transfer performance.
【學位授予單位】：西南交通大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：U491.17

【參考文獻】

相關期刊論文 前10條

1 趙金山,狄增如,王大輝;北京市公共汽車交通網(wǎng)絡幾何性質的實證研究[J];復雜系統(tǒng)與復雜性科學;2005年02期

2 譚躍進;吳俊;鄧宏鐘;朱大智;;復雜網(wǎng)絡抗毀性研究綜述[J];系統(tǒng)工程;2006年10期

3 孫琳,姜德平;Matlab動態(tài)仿真在混沌控制與同步中的應用研究[J];長沙理工大學學報(自然科學版);2004年02期

4 王U，

本文編號：1965229