本文選題：城市交通 + 路徑選擇算法��； 參考：《西南交通大學(xué)》2014年博士論文

【摘要】：隨著社會經(jīng)濟(jì)的快速發(fā)展,城市道路網(wǎng)絡(luò)規(guī)模越來越龐大,但與此同時,汽車數(shù)量也在不斷增長。從目前交通狀況可以看出,城市交通系統(tǒng)的發(fā)展已無法滿足當(dāng)前人們?nèi)找嬖鲩L的交通需求,進(jìn)而引發(fā)的城市交通問題也愈發(fā)嚴(yán)重,交通擁堵、交通事故、道路阻塞等問題頻頻發(fā)生。從可持續(xù)發(fā)展的角度可知,城市規(guī)模不可能無限制地擴(kuò)張下去,土地資源將越來越有限,越來越稀缺,如何在有限的道路資源條件下緩解城市交通擁堵并提高道路網(wǎng)絡(luò)的交通承載能力已成為相關(guān)領(lǐng)域研究的重點和熱點問題。為揭示城市交通流的內(nèi)在機理,深入研究城市基礎(chǔ)道路網(wǎng)絡(luò)及建立在該網(wǎng)絡(luò)之上的其他復(fù)雜系統(tǒng)(如公交系統(tǒng))的拓?fù)浣Y(jié)構(gòu)特性,分析道路交通流及網(wǎng)絡(luò)交通流的動態(tài)特性,有助于進(jìn)一步探索緩解城市交通擁擠及提高城市路網(wǎng)吞吐量的交通誘導(dǎo)控制策略。所以,分析交通網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)復(fù)雜性及交通流復(fù)雜性對于城市交通問題研究至關(guān)重要。為此,本文圍繞城市交通網(wǎng)絡(luò)的結(jié)構(gòu)特征及交通動態(tài)路由選擇算法展開了深入研究。結(jié)合GIS與復(fù)雜網(wǎng)絡(luò)理論,通過引入多粒度的概念系統(tǒng)地研究了城市交通網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)特性,在此基礎(chǔ)上針對不同網(wǎng)絡(luò)結(jié)構(gòu)分析了交通流單向傳輸控制對整個網(wǎng)絡(luò)交通過程的影響;深入分析了交通擁塞的產(chǎn)生機理,采用引力場理論實現(xiàn)了對交通流傳輸過程中節(jié)點之間相互作用的描述和定義,進(jìn)而提出了基于節(jié)點引力場的動態(tài)路由選擇算法。具體來講,本論文的研究工作與成果主要有以下幾個方面：1、結(jié)合GIS網(wǎng)絡(luò)分析方法與復(fù)雜網(wǎng)絡(luò)理論,對復(fù)雜交通網(wǎng)絡(luò)模型的構(gòu)建原理做了有益的探索并進(jìn)行了相關(guān)統(tǒng)計分析,發(fā)現(xiàn)不同尺度下的路網(wǎng)均具有小世界和無標(biāo)度特性,并通過引入多粒度的概念建立了城市道路多粒度復(fù)雜路網(wǎng)模型,進(jìn)而分析了多粒度復(fù)雜路網(wǎng)的拓?fù)浣Y(jié)構(gòu)復(fù)雜性及整個城市道路網(wǎng)絡(luò)的可靠性。研究發(fā)現(xiàn),多粒度復(fù)雜路網(wǎng)模型具有無標(biāo)度特性,有助于更為準(zhǔn)確地分析城市道路網(wǎng)絡(luò)的魯棒性及脆弱性。2、為進(jìn)一步分析城市交通系統(tǒng)的復(fù)雜性,針對城市公交系統(tǒng),從乘客出行站點選擇認(rèn)知的角度出發(fā),引入站點服務(wù)區(qū)的概念,并采用Voronoi圖進(jìn)行站點服務(wù)區(qū)的確定。在此基礎(chǔ)上,分別針對公交站點網(wǎng)絡(luò)和公交線路網(wǎng)絡(luò)定義了公交服務(wù)可靠性指標(biāo)及相應(yīng)的攻擊策略。試驗證明,該公交系統(tǒng)可靠性分析方法可以較為準(zhǔn)確地描述城市公交系統(tǒng)的魯棒性及脆弱性。3、分析了實施交通流局部單向傳遞對整個網(wǎng)絡(luò)交通狀況的影響。分別以連接度和介數(shù)為約束條件,定義了兩個交通流單向傳遞約束模型,并通過對ER隨機網(wǎng)絡(luò)、WS小世界網(wǎng)絡(luò)和BA無標(biāo)度網(wǎng)絡(luò)等典型網(wǎng)絡(luò)模型的交通模擬試驗,得出了一個重要結(jié)論：對擁塞嚴(yán)重的節(jié)點實施交通流單向傳遞控制可以顯著地提高ER隨機網(wǎng)絡(luò)和WS小世界網(wǎng)絡(luò)的傳輸能力及緩解其網(wǎng)絡(luò)擁塞程度,但不能有效地提高BA無標(biāo)度網(wǎng)絡(luò)的交通承載能力。該研究成果對實施城市交通(大部分城市交通網(wǎng)絡(luò)被證實服從冪律分布,即為無標(biāo)度網(wǎng)絡(luò))誘導(dǎo)控制提供了重要的決策參考依據(jù)。4、提出利用引力場理論來研究交通流傳輸過程中節(jié)點之間的相互作用,建立對交通引力場的描述,定義具有普適意義的節(jié)點引力場方程,定義了任意傳輸路徑對數(shù)據(jù)包的引力計算公式,即將路徑對數(shù)據(jù)包的引力表達(dá)為路徑上所有節(jié)點對數(shù)據(jù)包的引力的平均值。在此基礎(chǔ)上,提出了一種基于節(jié)點引力場的動態(tài)路由選擇算法,即針對當(dāng)前數(shù)據(jù)包的所有鄰居節(jié)點到目標(biāo)節(jié)點的最短路徑,選擇最短路徑對數(shù)據(jù)包引力最大所對應(yīng)的鄰居節(jié)點作為下一個傳輸節(jié)點。模擬試驗證明,該路徑選擇算法較大地提高了整個網(wǎng)絡(luò)的傳輸能力,顯著地緩解了網(wǎng)絡(luò)的擁塞程度。5、為深入探討基于引力場理論的路由選擇策略的交通流動力學(xué)特性,引入路徑感知深度的概念,定義了在路徑感知深度約束下傳輸路徑對數(shù)據(jù)包的引力計算公式,并給出了相應(yīng)的引力路由選擇算法。試驗結(jié)果揭示了一個重要的動力學(xué)現(xiàn)象：當(dāng)路徑感知深度大于網(wǎng)絡(luò)平均距離長度時,該路由選擇算法可以顯著地提高整個網(wǎng)絡(luò)的傳輸能力,且網(wǎng)絡(luò)傳輸性能將不再隨路徑感知深度的持續(xù)增大而變化,網(wǎng)絡(luò)傳輸性能將進(jìn)入穩(wěn)定狀態(tài)。6、從引力均衡的角度,引入標(biāo)準(zhǔn)差的基本思想,認(rèn)為在節(jié)點引力場作用下或許存在一個最佳的臨界引力,且在該引力下的路由選擇過程更為高效�；谶@種假設(shè),建立了一個反映節(jié)點引力離散程度的數(shù)學(xué)模型,且基于該數(shù)學(xué)模型提出了一種新的引力場路由選擇算法。試驗結(jié)果表明,該路由選擇算法顯著地提高了網(wǎng)絡(luò)的傳輸能力,有效地均衡了網(wǎng)絡(luò)交通負(fù)載,在一定程度上該算法的性能優(yōu)于上述基于路徑節(jié)點引力平均值的路由選擇算法。
[Abstract]:With the rapid development of social economy, the scale of urban road network is becoming larger and larger, but at the same time, the number of cars is increasing. From the current traffic conditions, it can be seen that the development of urban traffic system can not meet the increasing demand for traffic, and the urban traffic problems are becoming more and more serious, traffic congestion, Traffic accidents, road congestion and other problems occur frequently. From the perspective of sustainable development, the scale of the city can not be expanded unrestricted, the land resources will become more and more limited and more and more scarce. How to alleviate traffic congestion under the limited road resources and raise the traffic carrying capacity of road network has become a relevant leader. In order to reveal the inner mechanism of urban traffic flow and to study the topological structure characteristics of urban basic road network and other complex systems (such as bus system) on the network, the dynamic characteristics of road traffic flow and network traffic flow are analyzed, which will help to further explore the relief of urban traffic. Therefore, the analysis of topology complexity and traffic flow complexity of traffic network is very important to the research of urban traffic problems. Therefore, this paper studies the structure characteristics of urban traffic network and the algorithm of traffic dynamic routing selection. It combines GIS and complexity. In the network theory, the topological structure of urban traffic network is studied by introducing the concept of multi granularity. On this basis, the influence of traffic flow control on the whole network traffic process is analyzed according to different network structures. The mechanism of traffic congestion is analyzed, and the traffic flow is realized by the gravitational field theory. The interaction between nodes in the transmission process is described and defined, and then the dynamic routing algorithm based on the node gravitational field is proposed. In particular, the research work and results of this paper are mainly as follows: 1, combining the GIS network analysis method and the complex network theory, the construction principle of the complex traffic network model is made. It is found that the road network under different scales has the characteristics of small world and scale-free, and the multi granularity complex road network model of urban road is established by introducing the concept of multi granularity, and then the complexity of topology structure of multi granularity complex road network and the reliability of the whole urban road network are analyzed. It is found that the multi granularity and complex road network model has the characteristics of scale free, which can help to analyze the robustness and vulnerability of urban road network more accurately. In order to further analyze the complexity of urban traffic system, the concept of site service area is introduced to the urban bus system, the concept of site service area is introduced, and the.2 is adopted, and Vo is adopted. On the basis of this, the reliability index of bus service and the corresponding attack strategy are defined on the basis of the bus station network and the bus line network. The test proves that the reliability analysis method of the bus system can describe the robustness and vulnerability of the urban public transportation system more accurately, and the analysis of.3 is more accurate. The effect of traffic flow local one-way transmission on the whole network traffic condition is implemented. Two traffic flow one-way transmission constraint models are defined respectively with the connection degree and the number of medials as constraints, and an important conclusion is drawn through the traffic simulation experiments of typical network models such as ER random network, WS small world network and BA scale-free network. The implementation of traffic flow control for congested nodes can significantly improve the transmission capacity of the ER random network and WS small world network and alleviate the network congestion, but it can not effectively improve the traffic carrying capacity of the BA scale-free network. From the power law distribution, which is an important reference basis for decision making for the scale-free network,.4, the gravitational field theory is used to study the interaction between nodes in the transport process of traffic flow, to establish a description of the gravitational field of traffic, to define the universal gravitational field equation with a universal meaning, and to define the arbitrary transmission path to the data packet. The gravitational calculation formula in which the gravitational expression of the path to the packet is expressed as the average value of the gravitational force of all nodes on the path on the path. On this basis, a dynamic routing algorithm based on the node gravitational field is proposed, that is to select the shortest path logarithm for the shortest path of all the neighbor nodes of the current packet to the target node. The simulation experiment shows that the path selection algorithm greatly improves the transmission capacity of the whole network, significantly alleviates the network congestion.5, and discusses the traffic flow mechanics characteristics of the routing strategy based on gravitational field theory, and introduces the path sense. In the concept of depth of knowledge, the gravitational calculation formula of the transmission path to data packets is defined under the path perception depth constraint, and the corresponding gravitational routing algorithm is given. The results of the experiment reveal an important dynamic phenomenon: the routing algorithm can be significantly raised when the path perception depth is greater than the average distance of the network. The transmission capability of the whole network and the transmission performance of the network will no longer vary with the continuous increase of path perception depth. The network transmission performance will enter the stable state.6. From the angle of gravitational equilibrium, the basic idea of the standard deviation is introduced. It is considered that there may be a best critical gravity under the action of the gravitational field of the node and under the gravitational force. The route selection process is more efficient. Based on this hypothesis, a mathematical model is established to reflect the degree of gravity discretization of nodes, and a new routing algorithm for gravitational field is proposed based on this model. The experimental results show that the routing algorithm significantly improves the transmission capacity of the network and effectively balances the network traffic negative. To a certain extent, the performance of the algorithm is better than that of the routing average algorithm based on the path node.

【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2014
【分類號】：U491.112

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 薛明;劉春;肖學(xué)年;;基于WebGIS的復(fù)雜城市交通網(wǎng)絡(luò)信息服務(wù)[J];測繪通報;2011年12期

2 王杰臣,張偉,毛海城;GIS網(wǎng)絡(luò)分析的圖簡化方法研究[J];測繪學(xué)報;2001年03期

3 劉漢麗;周成虎;朱阿興;李霖;;多子群遺傳神經(jīng)網(wǎng)絡(luò)模型用于路口短時交通流量預(yù)測[J];測繪學(xué)報;2009年04期

4 謝順平;馮學(xué)智;魯偉;;基于道路網(wǎng)絡(luò)分析的Voronoi面域圖構(gòu)建算法[J];測繪學(xué)報;2010年01期

5 李清泉;李秋萍;方志祥;;一種基于時空擁擠度的應(yīng)急疏散路徑優(yōu)化方法[J];測繪學(xué)報;2011年04期

6 方敏,孫勁光,楊勇;基于流量控制的路由選擇算法[J];遼寧工程技術(shù)大學(xué)學(xué)報(自然科學(xué)版);2002年06期

7 汪秉宏;周濤;王文旭;楊會杰;劉建國;趙明;殷傳洋;韓筱璞;謝彥波;;當(dāng)前復(fù)雜系統(tǒng)研究的幾個方向[J];復(fù)雜系統(tǒng)與復(fù)雜性科學(xué);2008年04期

8 高自友;吳建軍;;出行者博弈、網(wǎng)絡(luò)結(jié)構(gòu)與城市交通系統(tǒng)復(fù)雜性[J];復(fù)雜系統(tǒng)與復(fù)雜性科學(xué);2010年04期

9 呂琳媛;陸君安;張子柯;閆小勇;吳曄;史定華;周海平;方錦清;周濤;;復(fù)雜網(wǎng)絡(luò)觀察[J];復(fù)雜系統(tǒng)與復(fù)雜性科學(xué);2010年Z1期

10 田志立，周海濤;交通分布修正引力模型的應(yīng)用[J];公路交通科技;1996年01期

相關(guān)博士學(xué)位論文 前5條

1 凌翔;復(fù)雜網(wǎng)絡(luò)上交通過程的動態(tài)特性研究[D];中國科學(xué)技術(shù)大學(xué);2011年

2 張水艦;基于GIS-T的城市交通最優(yōu)路徑誘導(dǎo)算法研究[D];西南交通大學(xué);2010年

3 王丹;復(fù)雜網(wǎng)絡(luò)擁塞分析與路由策略研究[D];東北大學(xué);2009年

4 吳建軍;城市交通網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)復(fù)雜性研究[D];北京交通大學(xué);2008年

5 胡一z，

本文編號：1832619