車輛自組織網(wǎng)絡(luò)環(huán)境下動態(tài)路徑誘導系統(tǒng)的建模與優(yōu)化策略研究
本文關(guān)鍵詞:車輛自組織網(wǎng)絡(luò)環(huán)境下動態(tài)路徑誘導系統(tǒng)的建模與優(yōu)化策略研究 出處:《山東大學》2014年博士論文 論文類型:學位論文
更多相關(guān)文章: 博弈論 前景理論 路徑選擇 動態(tài)路徑誘導 車輛自組織網(wǎng)絡(luò) 智能交通系統(tǒng)
【摘要】:隨著城市化進程的加快和汽車工業(yè)的發(fā)展,現(xiàn)有城市道路的通行能力與不斷增長的交通需求之間的矛盾變得日益尖銳,交通擁堵現(xiàn)象日益突出。應(yīng)用智能交通系統(tǒng)對交通流進行有效地控制與誘導,以緩解交通擁堵,提供暢通和有序的交通環(huán)境,是目前各個國家面對交通問題所采用的重要手段。 車輛自組織網(wǎng)絡(luò)(Vehicular Ad Hoc Networks,VANET)作為一個新興的研究領(lǐng)域,逐漸受到人們的關(guān)注。現(xiàn)有的交通管理系統(tǒng)大都利用交通控制中心處理路況信息,車輛節(jié)點只作為信息的接收方。利用VANET實現(xiàn)車輛間的相互通信,能夠使車輛節(jié)點獲得實時的路況信息,動態(tài)調(diào)整行駛路線,從而實現(xiàn)動態(tài)路徑選擇,有效地提高了行駛效率。 本文以大規(guī)模城市復雜路網(wǎng)作為研究背景,采用前景理論、博弈論、蜜蜂群體優(yōu)化策略等理論和方法,研究VANET環(huán)境下動態(tài)路徑誘導系統(tǒng)的建模與優(yōu)化策略,通過劃分交通誘導小區(qū)、限制搜索區(qū)域、建立路徑選擇模型、優(yōu)化路徑尋優(yōu)算法等一系列手段,建立一套全面高效的動態(tài)路徑誘導系統(tǒng)。主要研究工作如下: 論文首先論述了課題的研究目的與意義,然后分別介紹了車輛自組織網(wǎng)絡(luò)和動態(tài)路徑誘導系統(tǒng)的國內(nèi)外研究現(xiàn)狀,分析了車輛自組織網(wǎng)絡(luò)的發(fā)展與應(yīng)用前景,以及目前動態(tài)路徑誘導系統(tǒng)存在的問題。在此基礎(chǔ)上,提出了一系列的動態(tài)路徑誘導模型與優(yōu)化策略。 針對交通狀況的復雜性、時變性、不確定性,本文建立了一種基于前景理論的路徑選擇模型。模型考慮了由于出行者的主觀能動性而導致的不完全理性交通行為特征,能夠一定程度上克服期望效用理論的不足,準確地描述不確定交通條件下出行者的決策過程,更接近于出行者的實際行為模式。 結(jié)合實際課題研究的需要,為克服Dijkstra算法在復雜路網(wǎng)中難以滿足動態(tài)路徑誘導實時性要求的不足,提出了一種閾值限制搜索區(qū)域的動態(tài)路徑誘導算法,并成功應(yīng)用于復雜城市交通路網(wǎng)的動態(tài)路徑誘導模型系統(tǒng),實現(xiàn)了城市道路交通系統(tǒng)的實時動態(tài)最優(yōu)路徑搜索。該算法在Dijkstra算法的基礎(chǔ)上,引入閾值限制搜索區(qū)域的搜索機制,根據(jù)實際路網(wǎng)的空間分布特性,通過合理設(shè)置搜索區(qū)域的限定閾值,有效縮減了算法的搜索規(guī)模,提高了算法的運算效率,適合于復雜城市路網(wǎng)動態(tài)誘導系統(tǒng)的最優(yōu)路徑實時搜索。 為了克服車輛自組織網(wǎng)絡(luò)中車輛間的無線通信受到距離等因素的影響,提出了一種基于Shapley值的動態(tài)交通小區(qū)博弈劃分方法,為路徑誘導系統(tǒng)提供合理有效的交通子區(qū)。該方法以路網(wǎng)中的路段為基本單位,利用相似度確定交通小區(qū)核,并將交通小區(qū)劃分過程抽象為博弈過程,以Shapley值作為博弈收斂判據(jù),進行博弈迭代直至收斂,從而實現(xiàn)交通小區(qū)的劃分。算法能夠準確可靠的實現(xiàn)交通小區(qū)的劃分,同時降低了交通誘導系統(tǒng)路徑尋優(yōu)的復雜度,提升了誘導系統(tǒng)的實時性能。 在本文提出的交通誘導小區(qū)基礎(chǔ)上,進一步提出了一種蜜蜂啟發(fā)式分區(qū)路徑誘導算法,為路徑誘導系統(tǒng)提供合理有效的最優(yōu)路徑。算法模擬生物系統(tǒng)中的蜜蜂覓食現(xiàn)象,對各誘導小區(qū)同步并行進行路徑尋優(yōu),從而快速準確獲取最優(yōu)路徑,并能保證算法提供全局最優(yōu)路徑。 在前述研究的基礎(chǔ)上,本文對通勤交通行為帶來的城市道路擁堵問題進行了研究。針對通勤行為的特點,以預測信息精度和路況熟悉程度作為參數(shù),提出了一種基于博弈論的路徑選擇模型,為通勤者提供可靠的路徑選擇方案。該模型提供的最優(yōu)路徑能夠準確描繪通勤者日常的路徑選擇決策過程,能夠提供給通勤者可靠的通勤路徑。 最后設(shè)計并開發(fā)了基于中間件的動態(tài)路徑誘導系統(tǒng)仿真平臺,實現(xiàn)了交通信息的發(fā)布與動態(tài)路徑誘導功能,同時也為本文建立的模型和提出的算法提供一個可靠的仿真環(huán)境,為驗證模型的有效性和算法的先進性提供有力的技術(shù)支持。 基于上述研究成果,論文最后對全文進行了總結(jié),并對下一步的研究工作進行了展望,為后續(xù)的研究提供了可能的方向。
[Abstract]:With the development of city and accelerate the process of automobile industry, the contradiction between the traffic demand of existing city road traffic capacity and increasing the increasingly sharp, traffic congestion has become increasingly prominent. The application of intelligent transportation system to effectively control and guidance on the traffic flow, to alleviate traffic congestion, provide smooth and orderly traffic environment. Is an important means of various countries face the traffic problems.
Vehicle self-organizing network (Vehicular Ad Hoc Networks, VANET) as a new research field, has gradually attracted people's attention. Most of the traffic control center to deal with the traffic information and traffic management system of the existing vehicle nodes only as the receiver of information. To achieve mutual communication between vehicles using VANET, can make the vehicle obtain real-time node traffic information, dynamic adjustment of the route, in order to achieve dynamic path selection, effectively improves the running efficiency.
Based on the large-scale city complex network as the research background, based on prospect theory, game theory, bee colony optimization strategy theory and method of dynamic route guidance system under the environment of VANET modeling and optimization strategy, by dividing the traffic induced area, limiting the search region, establish a route choice model, optimal path optimization algorithm and a series of means to establish a comprehensive and efficient dynamic route guidance system. The main research work is as follows:
This paper first discusses the purpose and significance of the subject, and then introduces the research status of domestic ad hoc networks and dynamic route guidance system of vehicles, analyzes the development and application prospect of vehicular ad hoc networks, and the dynamic route guidance system problems. On this basis, put forward a series of dynamic path induced model and optimization strategy.
According to the traffic condition complexity, time-varying, uncertainty, this paper established a path choice model based on prospect theory. The model considers the irrational traffic behavior caused by the subjective initiative of travelers, to a certain extent overcome the expected utility theory, accurately describe uncertain traffic conditions the decision-making process for passengers, more close to the practice of travelers.
According to the actual needs of this research, to overcome the Dijkstra algorithm in the complex network is difficult to meet the requirement of real-time dynamic route guidance problem, put forward a threshold limit induced by dynamic path searching area algorithm, and successfully applied to the complex dynamic path of city traffic guidance model system, realize the real-time dynamic optimal path of city road traffic the search. The algorithm based on Dijkstra algorithm, by introducing the threshold mechanism of restricted searching area, according to the distribution characteristics of actual network space, by reasonably setting the search area limit threshold, effectively reduces the size of the search algorithm to improve the computing efficiency of the algorithm, suitable for complex dynamic system optimal induction of city road network the real-time path search.
In order to overcome the vehicles affected by factors such as distance from the wireless communication network between vehicles, presents a Shapley dynamic traffic zone division method based on game theory, provide a reasonable and effective traffic sub district for route guidance system. In this method, the road network in the road as the basic unit, determine the traffic area using kernel similarity. And the traffic zone division is the process of abstraction as a game process, using Shapley as the convergence criterion of game, game iteration until convergence, so as to realize the traffic zone division algorithm. The algorithm can accurately and reliably realize the traffic zone division, while reducing the complexity of traffic guidance system path optimization, enhance the real-time performance of the guidance system.
Based on the proposed cell induced traffic, further proposes a heuristic partition bee routing algorithm, provides the optimal path for the reasonable and effective route guidance system. Foraging phenomena in biological systems bee simulation algorithm, the induction of cell synchronization and walk path optimization, which quickly and accurately obtain the optimal path, and to ensure the algorithm provides a global optimal path.
On the basis of previous research, this paper brings to the city road congestion of commuter traffic behavior was studied. According to the characteristics of commuting behavior, in order to predict the information accuracy and familiarity with the road as a parameter, put forward a path choice model based on game theory, provide a reliable path for commuter optimal path selection scheme. This model can accurately describe the decision-making process of the daily commuter route selection, to provide commuter commuter path reliable.
Finally, the design and development of the dynamic route guidance system simulation platform based on middleware, to achieve the traffic information release and dynamic route guidance function, but also for the model and the proposed algorithm provides a reliable simulation environment, provides a powerful technical support for advanced to verify the validity of the model and algorithm.
Based on the above research results, the final part of the paper is summarized, and the next research work is prospected, which provides a possible direction for further research.
【學位授予單位】:山東大學
【學位級別】:博士
【學位授予年份】:2014
【分類號】:U495
【參考文獻】
相關(guān)期刊論文 前10條
1 關(guān)宏志;浦亮;;基于演化博弈理論的有限理性交通選擇行為模型[J];北京工業(yè)大學學報;2010年08期
2 徐京華;劉建川;李永樹;;基于ArcGIS的動態(tài)路徑誘導系統(tǒng)研究[J];測繪通報;2008年06期
3 胡中華;趙敏;;基于人工蜂群算法的機器人路徑規(guī)劃[J];電焊機;2009年04期
4 周素紅;閆小培;;基于居民通勤行為分析的城市空間解讀——以廣州市典型街區(qū)為案例[J];地理學報;2006年02期
5 申悅;柴彥威;;基于GPS數(shù)據(jù)的城市居民通勤彈性研究——以北京市郊區(qū)巨型社區(qū)為例[J];地理學報;2012年06期
6 孟偉;韓學東;洪炳昒;;蜜蜂進化型遺傳算法[J];電子學報;2006年07期
7 蘇永云,晏克非,黃翔,朱培康;車輛導航系統(tǒng)的動態(tài)最優(yōu)路徑搜索方法研究[J];系統(tǒng)工程;2000年04期
8 楊兆升,初連禹;動態(tài)路徑誘導系統(tǒng)的研究進展[J];公路交通科技;2000年01期
9 張赫,楊兆升,王煒;基于實時交通流信息的中心式動態(tài)路徑誘導系統(tǒng)行車路線優(yōu)化技術(shù)研究[J];公路交通科技;2004年09期
10 欒琨;雋志才;宗芳;;通勤者出行方式與出行鏈選擇行為研究[J];公路交通科技;2010年06期
相關(guān)博士學位論文 前3條
1 劉鴻飛;VANET信息廣播模型與優(yōu)化方法研究[D];重慶大學;2009年
2 龔勃文;大規(guī)模路網(wǎng)下中心式動態(tài)交通誘導系統(tǒng)關(guān)鍵技術(shù)研究[D];吉林大學;2010年
3 廖遠;一對一最短路徑算法研究及車載導航系統(tǒng)設(shè)計[D];南昌大學;2012年
,本文編號:1392290
本文鏈接:http://sikaile.net/kejilunwen/jiaotonggongchenglunwen/1392290.html