【摘要】：為了及時(shí)識(shí)別出突發(fā)事件下城市道路的關(guān)鍵路段,以構(gòu)建最短應(yīng)急救援路徑,本文提出了一套完整流程.首先,針對路網(wǎng)在應(yīng)急條件下的貧信息環(huán)境特征,設(shè)計(jì)一種基于模糊綜合評判的行程時(shí)間估算方法.然后,考慮救援人員的應(yīng)急心理和經(jīng)驗(yàn)選擇行為,構(gòu)建面向廣義阻抗的GERT(Graph Evaluation and Review Technique)網(wǎng)絡(luò)模型.最后,運(yùn)用Dijkstra算法獲得救援路徑完成關(guān)鍵路段識(shí)別.以成都市某區(qū)域?qū)嶋H交通網(wǎng)絡(luò)為算例進(jìn)行驗(yàn)證,結(jié)果表明:基于2種模糊算子估算路段行程速度,其絕對誤差為2.722 km/h,精度較高;與傳統(tǒng)關(guān)鍵路段識(shí)別方法相比,GERT網(wǎng)絡(luò)模型能更好地反映行程時(shí)間和路段擁擠度對路徑選擇行為的影響(擬合度80.95%),并將重要度識(shí)別技術(shù)從路網(wǎng)降低到路徑層面,效果良好.
[Abstract]:In order to identify the key sections of urban roads in time to construct the shortest emergency rescue path, this paper presents a set of complete flow chart. Firstly, according to the poor information environment characteristics of road network under emergency condition, a method of travel time estimation based on fuzzy comprehensive evaluation is designed. Then, considering the emergency psychological and experiential selection behavior of rescue workers, a generalized impedance oriented GERT (Graph Evaluation and Review Technique) network model is constructed. Finally, the Dijkstra algorithm is used to obtain the rescue path to complete the key road identification. The actual traffic network in a certain area of Chengdu is taken as an example. The results show that the absolute error is 2.722 km / h and the precision is high. Compared with the traditional key road identification method, the GERT network model can better reflect the impact of travel time and road congestion on the path selection behavior (fit degree 80.95%), and reduce the importance recognition technology from road network to path level, and the effect is good.
【作者單位】： 西南交通大學(xué)交通運(yùn)輸與物流學(xué)院;
【基金】：國家自然科學(xué)基金(51308475) 中央高�；究蒲袠I(yè)務(wù)費(fèi)專項(xiàng)資金(SWJTUA0920502051307-03)~~
【分類號】：U491
，

本文編號：2185086