【摘要】：科技的發(fā)展,社會(huì)的進(jìn)步,使得大中型城市的人口急劇膨脹,城市居民的出行的需求劇增。同時(shí)電商的崛起加快了物流運(yùn)輸業(yè)的發(fā)展,使交通服務(wù)愈加供不應(yīng)求。大中型城市交通路網(wǎng)擁堵成為全球問(wèn)題。近年來(lái),國(guó)外一些專(zhuān)家學(xué)者不再聚焦于單個(gè)擁堵交叉口控制策略的研究,而是從整個(gè)交通路網(wǎng)的基本屬性——宏觀基本圖(MFD)出發(fā),將整個(gè)城市路網(wǎng)進(jìn)行子區(qū)劃分(劃分后的各個(gè)子區(qū)具有同質(zhì)MFD特征),對(duì)相鄰子區(qū)域之間采取邊界控制方法,控制區(qū)域間輸入和輸出交通流。實(shí)踐證明,這是解決交通擁堵的一種有效方法。我國(guó)關(guān)于MFD的研究剛剛起步。如何在已有城市交通基礎(chǔ)設(shè)施的基礎(chǔ)上,通過(guò)探究城市路網(wǎng)的MFD特性,進(jìn)行城市路網(wǎng)控制子區(qū)域劃分,設(shè)計(jì)有效的控制策略,成為解決城市交通擁堵的一個(gè)前沿課題。本文基于北京市望京地區(qū)浮動(dòng)車(chē)的實(shí)際數(shù)據(jù),提出了基于MFD的網(wǎng)格逐層的城市路網(wǎng)控制子區(qū)域劃分的新方法。同時(shí)從高效節(jié)能的角度考慮,本文提出僅對(duì)子區(qū)域邊界上的關(guān)鍵節(jié)點(diǎn)進(jìn)行邊界控制。充分考慮一般復(fù)雜網(wǎng)絡(luò)的基本特性和實(shí)際路網(wǎng)的拓?fù)浣Y(jié)構(gòu),提出一種切實(shí)可行的交通路網(wǎng)交叉口重要度的評(píng)價(jià)方法——基于m階鄰居節(jié)點(diǎn)重要度的評(píng)估算法,并通過(guò)仿真分析,與已有方法進(jìn)行分析和比較,驗(yàn)證了該算法具有較好的可行性和精準(zhǔn)性。為下一步實(shí)現(xiàn)部分路網(wǎng)節(jié)點(diǎn)的邊界控制提供理論依據(jù)。首先,本文對(duì)采集的北京市望京地區(qū)浮動(dòng)車(chē)數(shù)據(jù)進(jìn)行預(yù)處理。以高德地圖為基礎(chǔ),繪制出其路網(wǎng)結(jié)構(gòu)圖,統(tǒng)計(jì)各個(gè)路段信息。根據(jù)采集到GPS的車(chē)輛定位數(shù)據(jù),利用投影算法與道路進(jìn)行匹配。依據(jù)采集到的浮動(dòng)車(chē)的瞬時(shí)速度、車(chē)輛標(biāo)識(shí)、車(chē)輛狀態(tài)等數(shù)據(jù)計(jì)算出本文所需交通參量,如:車(chē)流量、平均速度、平均密度等。其次,利用所求交通參數(shù),研究整體路網(wǎng)的MFD特性;對(duì)研究區(qū)域進(jìn)行分析,采用網(wǎng)格逐層試湊疊加的方式進(jìn)行區(qū)域劃分,并以城市路網(wǎng)的MFD(宏觀基本圖)特性,如:均勻性、離散度低、滯環(huán)現(xiàn)象等,作為一系列的評(píng)價(jià)指標(biāo)用于評(píng)價(jià)區(qū)域劃分的結(jié)果。最后,對(duì)已有的一般復(fù)雜網(wǎng)絡(luò)關(guān)鍵節(jié)點(diǎn)選取評(píng)價(jià)方法和相關(guān)的道路交通指標(biāo)進(jìn)行了分析,選擇在實(shí)際路網(wǎng)中體現(xiàn)比較好的特性,如度值、繁忙度、緊密度中心性及介數(shù)中心性等,并在此基礎(chǔ)上提出一種新的基于m階鄰居節(jié)點(diǎn)重要度的關(guān)鍵交叉口評(píng)估方法,建立新的路網(wǎng)中關(guān)鍵交叉口的綜合評(píng)價(jià)指標(biāo)。采用基于蟻群算法的BP神經(jīng)網(wǎng)絡(luò)進(jìn)行評(píng)估過(guò)程中的權(quán)值優(yōu)化。與多種評(píng)價(jià)指標(biāo)進(jìn)行了對(duì)比和評(píng)估,表明本文方法的可行性和有效性。
[Abstract]:With the development of science and technology and the progress of society, the population of large and medium-sized cities expands rapidly, and the demand of urban residents to travel increases dramatically. At the same time, the rise of e-commerce accelerated the development of logistics industry, so that transport services more than demand. Traffic congestion in large and medium-sized cities has become a global problem. In recent years, some foreign experts and scholars no longer focus on the control strategy of a single congested intersection, but start from the basic attribute of the whole traffic network, which is the macroscopic basic diagram (MFD). The whole urban road network is divided into sub-areas (each sub-area has homogeneous MFD characteristics) and the boundary control method is adopted to control the input and output traffic flow between the adjacent sub-regions. Practice has proved that this is an effective method to solve traffic congestion. The research on MFD in China has just started. On the basis of the existing urban traffic infrastructure and by exploring the MFD characteristics of the urban road network, how to divide the control sub-area of the urban road network and design effective control strategies has become a frontier problem to solve the urban traffic congestion. Based on the actual data of floating vehicles in Wangjing area of Beijing, this paper presents a new method of dividing the control subareas of urban road network based on MFD. At the same time, from the point of view of high efficiency and energy saving, this paper presents boundary control only for the key nodes on the sub-region boundary. Considering the basic characteristics of general complex network and the topological structure of practical road network, a feasible evaluation method of intersection importance of traffic network is proposed, which is based on the evaluation algorithm of m-order neighbor node importance, and is analyzed by simulation. Compared with the existing methods, the proposed algorithm is proved to be feasible and accurate. It provides a theoretical basis for the next step to realize the boundary control of some road network nodes. Firstly, this paper preprocesses the floating vehicle data collected in Wangjing area of Beijing. Based on Amap, draw out its road network structure map, statistics each section information. According to the vehicle location data collected from GPS, the projection algorithm is used to match the road. Based on the collected data of floating vehicle's instantaneous speed, vehicle identification and vehicle status, the traffic parameters are calculated, such as: traffic flow, average speed, average density and so on. Secondly, the MFD characteristics of the whole road network are studied by using the traffic parameters sought, and the study area is analyzed, and the area is divided by the method of grid layer by layer superposition, and the MFD (macroscopic basic map) characteristics of the urban road network, such as uniformity, are used to divide the area. As a series of evaluation indexes, low dispersion and hysteresis are used to evaluate the results of regional division. Finally, the paper analyzes the existing methods of selecting and evaluating key nodes in general complex network and the related road traffic indexes, and chooses the better characteristics in the actual road network, such as degree value, busy degree, etc. On the basis of compactness centrality and meso-centrality, a new evaluation method for key intersections based on the importance of m-order neighbor nodes is proposed, and a new comprehensive evaluation index of key intersections in road network is established. The BP neural network based on ant colony algorithm is used to optimize the weights in the evaluation process. Compared with many evaluation indexes, the method is feasible and effective.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：U491

【參考文獻(xiàn)】

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

1 馬萬(wàn)經(jīng);廖大彬;;網(wǎng)絡(luò)交通流宏觀基本圖:回顧與前瞻[J];武漢理工大學(xué)學(xué)報(bào)(交通科學(xué)與工程版);2014年06期

2 盧守峰;王杰;劉改紅;邵維;;基于流量和出租車(chē)GPS數(shù)據(jù)的城市道路網(wǎng)絡(luò)宏觀基本圖[J];公路交通科技;2014年09期

3 林曉輝;;基于MFD的路網(wǎng)周邊交通控制策略與仿真[J];中外公路;2014年04期

4 張喜平;李永樹(shù);劉剛;王蕾;;節(jié)點(diǎn)重要度貢獻(xiàn)的復(fù)雜網(wǎng)絡(luò)節(jié)點(diǎn)重要度評(píng)估方法[J];復(fù)雜系統(tǒng)與復(fù)雜性科學(xué);2014年03期

5 杜怡曼;吳建平;賈宇涵;許明;;基于宏觀基本圖的區(qū)域交通總量動(dòng)態(tài)調(diào)控技術(shù)[J];交通運(yùn)輸系統(tǒng)工程與信息;2014年03期

6 任曉龍;呂琳媛;;網(wǎng)絡(luò)重要節(jié)點(diǎn)排序方法綜述[J];科學(xué)通報(bào);2014年13期

7 許明;吳建平;杜怡曼;謝峰;肖云鵬;;基于三部圖的路網(wǎng)節(jié)點(diǎn)關(guān)鍵度排序方法[J];北京郵電大學(xué)學(xué)報(bào);2014年S1期

8 姬楊蓓蓓;;基于仿真實(shí)驗(yàn)驗(yàn)證宏觀基本圖的存在性[J];武漢理工大學(xué)學(xué)報(bào)(交通科學(xué)與工程版);2013年05期

9 王建強(qiáng);代磊磊;李婭;王運(yùn)霞;;基于交通流運(yùn)行特征的城市干線關(guān)鍵交叉口判別方法[J];交通信息與安全;2013年03期

10 盧凱;徐建閩;鄭淑鑒;王世明;;協(xié)調(diào)控制子區(qū)快速動(dòng)態(tài)劃分方法研究[J];自動(dòng)化學(xué)報(bào);2012年02期

相關(guān)會(huì)議論文 前1條

1 鐘章建;黃瑋;馬萬(wàn)經(jīng);姚佼;;面向協(xié)調(diào)控制的交通小區(qū)劃分算法設(shè)計(jì)與實(shí)現(xiàn)[A];2008第四屆中國(guó)智能交通年會(huì)論文集[C];2008年

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

1 杜雨弦;復(fù)雜網(wǎng)絡(luò)中節(jié)點(diǎn)重要度評(píng)估算法的研究[D];西南大學(xué);2015年

2 馬囡囡;加權(quán)復(fù)雜網(wǎng)絡(luò)節(jié)點(diǎn)重要度分析及其在城市交通網(wǎng)絡(luò)中的應(yīng)用[D];長(zhǎng)沙理工大學(xué);2013年

3 趙強(qiáng);基于關(guān)鍵交叉口交通狀態(tài)判別的配時(shí)參數(shù)計(jì)算[D];吉林大學(xué);2007年

4 陳曉明;交通控制子區(qū)動(dòng)態(tài)劃分指標(biāo)研究[D];吉林大學(xué);2007年

，

本文編號(hào)：2265897