本文選題：城市道路交通網(wǎng)絡(luò) + 復(fù)雜網(wǎng)絡(luò)　； 參考：《長(zhǎng)沙理工大學(xué)》2015年碩士論文

【摘要】：城市道路交通網(wǎng)絡(luò)具有復(fù)雜網(wǎng)絡(luò)特性,級(jí)聯(lián)失效是城市道路交通網(wǎng)絡(luò)的重要特征。建立城市道路交通網(wǎng)絡(luò)級(jí)聯(lián)失效模型,分析級(jí)聯(lián)失效的傳播過程,探尋級(jí)聯(lián)失效預(yù)防與控制措施,提高城市道路交通網(wǎng)絡(luò)的運(yùn)行安全性、可靠性,具有重要的理論及實(shí)際意義。本文研究城市道路交通網(wǎng)絡(luò)級(jí)聯(lián)失效的預(yù)防策略,通過對(duì)重要路段與重要節(jié)點(diǎn)進(jìn)行擴(kuò)容,可以預(yù)防級(jí)聯(lián)失效的發(fā)生,主要研究工作包括：(1)考慮級(jí)聯(lián)失效的事件性重要路段(節(jié)點(diǎn))識(shí)別模型研究。根據(jù)城市道路交通網(wǎng)絡(luò)中路段(節(jié)點(diǎn))特征,將其重要路段(節(jié)點(diǎn))分為常規(guī)性和事件性兩類�；趧h除法,提出考慮級(jí)聯(lián)失效的事件性重要路段(節(jié)點(diǎn))識(shí)別方法,認(rèn)為邊(節(jié)點(diǎn))刪除后引發(fā)的級(jí)聯(lián)失效后果越嚴(yán)重,說明該邊(節(jié)點(diǎn))越重要,從而可以有效的選擇事件性重要路段(節(jié)點(diǎn))。(2)考慮級(jí)聯(lián)失效的重要路段與重要節(jié)點(diǎn)擴(kuò)容策略。本文解決了擴(kuò)容策略的兩個(gè)關(guān)鍵問題：1)擴(kuò)容路段和節(jié)點(diǎn)的選擇；2)路段與節(jié)點(diǎn)擴(kuò)容量的優(yōu)化確定。首先根據(jù)重要性初選擴(kuò)容的重要路段與重要節(jié)點(diǎn),然后不斷試算擴(kuò)容量,根據(jù)擴(kuò)容后的效果終選擴(kuò)容的重要路段(節(jié)點(diǎn))及其最佳擴(kuò)容倍數(shù)。最后給出了計(jì)算流程,并進(jìn)行了試驗(yàn)分析,驗(yàn)證了該算法的有效性。(3)考慮級(jí)聯(lián)失效的路口路段聯(lián)合擴(kuò)容策略。道路交通網(wǎng)絡(luò)是通過路段和路口連接的整體,單獨(dú)的路口擴(kuò)容策略、路段擴(kuò)容策略往往不能有效的提高整個(gè)路網(wǎng)的通行能力(或提高路網(wǎng)抵抗級(jí)聯(lián)失效的能力)。因此,本文提出了路口路段的聯(lián)合擴(kuò)容策略。即首先選定需擴(kuò)容的整體單元集；分別試算整體單元中的路段和節(jié)點(diǎn)的擴(kuò)容量,求得整體擴(kuò)容量；然后選取擴(kuò)容量最小的整體單元為最佳擴(kuò)容整體單元,其對(duì)應(yīng)的擴(kuò)容量為最佳擴(kuò)容量。最后給出了詳細(xì)的計(jì)算流程,并通過試驗(yàn)分析,驗(yàn)證了該算法的有效性。
[Abstract]:Urban road traffic network has complex network characteristics, cascade failure is an important feature of urban road traffic network. It is of great theoretical and practical significance to establish a cascade failure model of urban road traffic network, to analyze the process of cascade failure propagation, to explore the prevention and control measures of cascade failure, and to improve the safety and reliability of urban road traffic network. In this paper, the prevention strategy of cascade failure of urban road traffic network is studied. By expanding the capacity of important road sections and important nodes, the cascade failure can be prevented. The main research work includes: (1) the identification model of event important sections (nodes) considering cascade failure. According to the characteristics of road sections (nodes) in urban road traffic networks, the important road sections (nodes) are divided into two categories: routine and event. Based on the deletion method, this paper proposes an event recognition method for important sections (nodes) considering cascade failure. It is considered that the more serious the consequence of cascade failure caused by edge (node) deletion, the more important the side (node) is. Therefore, the event-important section (node). (_ 2) can be effectively selected to consider the cascade failure of the important section and important node expansion strategy. In this paper, two key problems of expansion strategy are solved: 1) selection of expansion sections and nodes, and 2) optimal determination of expansion capacity of sections and nodes. First, according to the importance of the primary expansion of important sections and important nodes, and then continue to try to calculate the expansion capacity, according to the effect of the expansion of the final selection of important sections (nodes) and the best expansion multiple. Finally, the calculation flow is given, and the experimental analysis is carried out to verify the effectiveness of the algorithm. (3) the joint capacity expansion strategy of intersection considering cascade failure is proposed. The road traffic network is a whole through the link between the road section and the intersection. The expansion strategy of the road link can not effectively improve the capacity of the whole road network (or the ability of the road network to resist the cascade failure). Therefore, this paper puts forward the joint expansion strategy of intersections. That is, first of all, select the whole unit set that needs to be expanded; try to calculate the expansion capacity of the section and node in the whole unit, and then select the whole unit with the smallest expansion capacity as the optimal expansion integral unit, The corresponding expanding capacity is the optimum capacity. Finally, the detailed calculation flow is given, and the validity of the algorithm is verified by experimental analysis.
【學(xué)位授予單位】：長(zhǎng)沙理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：U491

【參考文獻(xiàn)】

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

1 劉漳輝;陳國(guó)龍;湯振立;李冬銀;;加權(quán)復(fù)雜網(wǎng)絡(luò)相繼故障的節(jié)點(diǎn)動(dòng)態(tài)模型研究[J];小型微型計(jì)算機(jī)系統(tǒng);2013年12期

2 王明偉;;區(qū)域公路網(wǎng)瓶頸路段識(shí)別分析研究[J];中外公路;2012年04期

3 王正武;況愛武;王賀杰;;考慮級(jí)聯(lián)失效的交通網(wǎng)絡(luò)節(jié)點(diǎn)重要度測(cè)算[J];公路交通科技;2012年05期

4 高潔;;交通運(yùn)輸網(wǎng)絡(luò)節(jié)點(diǎn)重要度評(píng)價(jià)體系研究[J];聊城大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年03期

5 涂穎菲;楊超;陳小鴻;;路網(wǎng)拓?fù)浯嗳跣约瓣P(guān)鍵路段分析[J];同濟(jì)大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年03期

6 唐小勇;程琳;徐上;;地震條件下公路網(wǎng)關(guān)鍵路段識(shí)別(英文)[J];Journal of Southeast University(English Edition);2009年04期

7 胡一z，

本文編號(hào)：2060379