本文選題：高速公路 + 應急救援　； 參考：《長安大學》2017年碩士論文

【摘要】：伴隨著我國經(jīng)濟的飛速發(fā)展,高速公路基礎設施建設不斷完善,縱貫南北、橫連東西的公路網(wǎng)絡已具備規(guī)模。由于高速公路交通流量的持續(xù)增長,交通事故隨之頻發(fā),安全形勢越來越嚴峻。高速公路應急救援是為了及時、有效地處理各種突發(fā)性交通事件,實現(xiàn)快速響應和緊急救助,以達到減少人員傷亡和經(jīng)濟損失的目的。其中應急救援資源點的選址和應急救援資源調(diào)度是應急救援的核心。在分析國內(nèi)外研究現(xiàn)狀的基礎上,分析高速公路事故特征和原因;將高速公路路網(wǎng)抽象為無向賦權(quán)網(wǎng)絡圖,建立應急救援資源點選址模型,利用作圖的方式求解模型,得到網(wǎng)絡圖的絕對中心點,即應急資源點的布置點;以時間緊迫性為前提,以成本、道路條件等參數(shù)作為節(jié)點權(quán)重,優(yōu)化選址模型,使其更具有實際運用價值;建立了動態(tài)高速路網(wǎng)應急資源調(diào)度模型,設計了一個改進的混合蛙跳算法,采用隨機整數(shù)編碼方案保證路徑序列具有連續(xù)性,優(yōu)勢節(jié)點編碼方案進一步降低決策空間維度,提升了算法的精度;組內(nèi)迭代策略讓動態(tài)最短路徑的求解得以實現(xiàn)。最后以西安市西側(cè)高速公路路網(wǎng)為例,應用所建立的模型和算法求解,結(jié)果表明所建模型合理,所設計的算法能滿足快速路網(wǎng)應急車輛最短路徑問題的優(yōu)化目標;基于優(yōu)勢節(jié)點編碼方案的混合蛙跳算法較隨機整數(shù)編碼方案在求解準確度和求解速度方面更有優(yōu)勢。
[Abstract]:With the rapid development of our country's economy, the highway infrastructure construction has been improved continuously. The highway network, which runs through the north and south, and connects east and west, already has the scale. Due to the continuous growth of highway traffic flow, traffic accidents occur frequently, and the security situation is becoming more and more serious. The purpose of expressway emergency rescue is to deal with all kinds of sudden traffic events in time and effectively, to realize rapid response and emergency rescue, and to reduce casualties and economic losses. The location of emergency rescue resource point and the dispatch of emergency rescue resource are the core of emergency rescue. On the basis of analyzing the present research situation at home and abroad, the characteristics and causes of expressway accidents are analyzed, and the expressway network is abstracted as an undirected weighted network graph, and the emergency rescue resource point location model is established, and the model is solved by the way of drawing. The absolute center point of the network diagram, that is, the layout point of the emergency resource point, is obtained, and the parameters such as cost and road condition are taken as the weight of the node on the premise of the urgency of time, so as to optimize the site selection model so that it has more practical application value. A dynamic high-speed network emergency resource scheduling model is established, and an improved hybrid leapfrog algorithm is designed. The random integer coding scheme is used to ensure the continuity of path sequence, and the dominant node coding scheme further reduces the decision space dimension. The accuracy of the algorithm is improved and the dynamic shortest path can be solved by intra-group iterative strategy. Finally, taking the Xi'an highway network as an example, the model and algorithm are applied to solve the problem. The results show that the model is reasonable and the algorithm can meet the optimization goal of the emergency vehicle shortest path problem in the expressway. The hybrid leapfrog algorithm based on dominant node coding scheme has more advantages than random integer coding scheme in solving accuracy and speed.
【學位授予單位】：長安大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：U492.8

【參考文獻】

相關期刊論文 前10條

1 李長城;文濤;劉小明;榮建;;基于高速公路收費數(shù)據(jù)的行程時間可靠性模型研究[J];公路交通科技;2014年12期

2 杜柯;高曙;陳先橋;黃_稱，

本文編號：1856842