本文選題：應急救援 + 交通管制　； 參考：《山東師范大學》2017年碩士論文

【摘要】：隨著社會經(jīng)濟的快速發(fā)展和城市人口的不斷增加,私家車數(shù)量正迅速增多,城市特別是較大城市的交通問題也變得越來越嚴重,道路擁擠、交通堵塞等問題已嚴重干擾著人們的正常出行。當城市某地發(fā)生突發(fā)緊急狀況時,需要從各個地方向該地進行及時的應急物資輸送。為保證物資的有效運輸,有關(guān)決策機構(gòu)往往采取較為嚴格的交通管制措施。在城市應急救援期間實施臨時交通管制措施有利于對受災區(qū)域?qū)嵤┛焖倬仍?但過度的管制必然會對社會居民正常出行產(chǎn)生較為嚴重的負面影響。為了保證物資的有效運輸,同時盡量降低因交通管制所造成的居民出行成本,因此對管制方案進行合理的優(yōu)化就變得尤為重要。為此,本文提出了城市應急救援期間地面臨時交通管制優(yōu)化方案。對方案進行優(yōu)化的目的是在保證應急物資的及時運達的同時,最大程度降低因交通管制對居民正常出行的影響。為求解出臨時交通管制方案,本文做了如下工作:(1)構(gòu)建臨時交通管制方案數(shù)學模型。模型目標函數(shù)用于最小化擾民程度,擾民程度通過對比管制前后社會車輛通過各路段的路阻變化情況均值刻畫。目標約束函數(shù)為管制時長,考慮到管制需提前實施,管制時長為車輛通過應急通道時間與車輛通過應急通道各路段最長時間之和。(2)路段管制類型的啟發(fā)式選擇和基于引力模型改進的BPR函數(shù)。通過引入邊介數(shù)及路段重要性指標,對于相對重要路段采取相對寬松的管制類型。通過引入引力模型對管制后路網(wǎng)車流量進行調(diào)整,計算管制后車輛通過各路段時間。(3)構(gòu)建臨時交通管制方案求解算法。方案的求解是一個反復迭代的過程,考慮到路網(wǎng)結(jié)構(gòu)的復雜性,需管制路段數(shù)量眾多,路段管制類型多樣的特點,本文構(gòu)建了基于改進遺傳算法的臨時交通管制方案求解算法,同時給出了最優(yōu)臨時管制方案對應的車流繞行方案。本文通過Sioux-Fall路網(wǎng)實驗算例及Flintbury路網(wǎng)實驗算例對模型及求解算法進行驗證,從驗證結(jié)果可知,模型可快速給出應急情況下的臨時交通管制優(yōu)化方案,即可在滿足救援需求的同時降低管制方案的負面影響�？紤]到應急救援期間城市臨時交通管制的現(xiàn)實意義,本文基于模型及算法研究并結(jié)合實際路網(wǎng)情況在Net Logo平臺上設(shè)計并實現(xiàn)了臨時交通管制優(yōu)化系統(tǒng)。
[Abstract]:With the rapid development of social economy and the continuous increase of urban population, the number of private cars is increasing rapidly. The traffic problems in cities, especially in larger cities, are becoming more and more serious, and the roads are congested. Traffic jams and other problems have seriously interfered with people's normal travel. When a sudden emergency occurs in a city, it is necessary to carry out timely delivery of emergency supplies from various places to the city. In order to ensure the effective transportation of materials, the decision-making organizations often take strict traffic control measures. The implementation of temporary traffic control measures during the period of urban emergency rescue is conducive to the rapid rescue of the affected areas, but excessive control will inevitably have a more serious negative impact on the normal travel of social residents. In order to ensure the effective transportation of materials and reduce the travel cost caused by traffic control, it is very important to optimize the control scheme reasonably. Therefore, this paper puts forward the optimization scheme of ground temporary traffic control during urban emergency rescue. The purpose of optimizing the scheme is to ensure the timely arrival of emergency supplies and to minimize the impact of traffic control on residents' normal travel at the same time. In order to solve the temporary traffic control scheme, this paper does the following work: 1) construct the mathematical model of temporary traffic control scheme. The objective function of the model is used to minimize the degree of disturbance, and the degree of disturbance is characterized by comparing the changes of road resistance between different sections of road before and after the control. The objective constraint function is the length of the control, considering that the control needs to be implemented in advance, The length of control is the heuristic selection and the improved BPR function based on gravity model for the control type of vehicle passing through the emergency passage and the sum of the longest time of the vehicle passing through each section of the emergency passage. By introducing edge mediums and road section importance index, relatively loose control type is adopted for relative important road sections. By introducing the gravity model to adjust the traffic flow of the road network after the control, the algorithm of solving the temporary traffic control scheme is constructed by calculating the time of the vehicle passing through each section of the road after the control. The solution of the scheme is a iterative process. Considering the complexity of the road network structure, the number of sections to be regulated and the various types of road control, this paper constructs a temporary traffic control scheme solving algorithm based on improved genetic algorithm. At the same time, the traffic bypass scheme corresponding to the optimal temporary control scheme is given. In this paper, the model and algorithm are verified by Sioux-Fall road network experiment and Flintbury road network experiment. From the verification results, the model can quickly give the optimization scheme of temporary traffic control in emergency situations. Can meet the rescue needs while reducing the negative impact of regulatory programs. Considering the practical significance of urban temporary traffic control during emergency rescue, this paper designs and implements a temporary traffic control optimization system on Net Logo platform based on the research of model and algorithm and combining with the actual road network situation.
【學位授予單位】：山東師范大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：U491.4;TP311.52

【參考文獻】

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

1 鄭文萍;張浩杰;王杰;;基于稠密子圖的社區(qū)發(fā)現(xiàn)算法[J];智能系統(tǒng)學報;2016年03期

2 李琦;郭仁擁;楊文娟;;考慮禁左條件的用戶均衡交通配流模型與算法[J];數(shù)學的實踐與認識;2015年19期

3 柳坐宮;錢勇生;曾俊偉;;不同道路特大交通事故特征分析及預防對策研究[J];中國公共安全(學術(shù)版);2015年03期

4 高云峰;韓皓;胡華;;信號控制交叉口交通行為的簡單二維元胞傳輸模型[J];系統(tǒng)工程理論與實踐;2015年01期

5 李雙琳;馬祖軍;;震后交通管制下多出救點應急物資調(diào)運問題[J];管理科學學報;2014年05期

6 胡云超;申金升;黃愛玲;;城市貨運交通管制情景下城市配送多目標優(yōu)化效益研究[J];交通運輸系統(tǒng)工程與信息;2012年06期

7 王樹西;吳政學;;改進的Dijkstra最短路徑算法及其應用研究[J];計算機科學;2012年05期

8 龍科軍;陳群;;道路網(wǎng)絡(luò)交叉口“禁左”交通組織優(yōu)化[J];北京工業(yè)大學學報;2011年06期

9 戢曉峰;;城市交通擁擠管理關(guān)鍵技術(shù)研究進展[J];中國交通信息產(chǎn)業(yè);2008年12期

10 黃貴玲;高西全;靳松杰;談飛洋;;基于蟻群算法的最短路徑問題的研究和應用[J];計算機工程與應用;2007年13期

相關(guān)博士學位論文 前3條

1 張喜平;城市復雜交通網(wǎng)絡(luò)級聯(lián)動力學與路段重要性評估研究[D];西南交通大學;2014年

2 劉剛;基于復雜網(wǎng)絡(luò)理論的交通流動態(tài)特性研究[D];西南交通大學;2014年

3 胡云超;城市物流可持續(xù)發(fā)展研究[D];北京交通大學;2013年

相關(guān)碩士學位論文 前2條

1 霍慧鳴;網(wǎng)絡(luò)中的平均介數(shù)研究[D];青海師范大學;2014年

2 賴君;基于路段飽和度的動態(tài)交通擁擠定價研究[D];西南交通大學;2013年

，

本文編號：1835956