本文選題：礦井災(zāi)變時(shí)期 + 最優(yōu)路徑��； 參考：《太原理工大學(xué)》2013年碩士論文

【摘要】：由于我國的能源組織結(jié)構(gòu)具有“富煤、缺油、少氣”的特點(diǎn),所以在未來相當(dāng)長的一段時(shí)期內(nèi)煤炭仍將作為一種主要能源在我國的國民經(jīng)濟(jì)中發(fā)揮著重要的作用。由于煤炭賦存條件的特殊性,決定了大部分的煤炭開采都屬于井工開采。相比較于地面環(huán)境而言,井下環(huán)境更加復(fù)雜,更加惡劣,發(fā)生災(zāi)變時(shí),情況更加混亂。因此為了避免各種人員傷亡和財(cái)產(chǎn)損失事故的發(fā)生,需要政府、煤礦管理層、礦工、社會(huì)輿論力量的共同配合協(xié)作來實(shí)現(xiàn)。但是由于某些天災(zāi)人禍,礦井事故有時(shí)候會(huì)不可避免的發(fā)生,在這種情況下,人員逃生和救援受傷人員就成為了礦山應(yīng)急救援工作的重中之重。然而衡量應(yīng)急救援工作成功與否的主要標(biāo)志是能否在規(guī)定的時(shí)間內(nèi)完成人員的逃生與救援,也就是能否在與時(shí)間的賽跑中獲勝。這就需要人員在逃生和救援時(shí),盡量沿著最短路徑進(jìn)行逃生,就可以節(jié)省很多寶貴的時(shí)間。這就是本文所選擇課題的意義。在綜合和參考國內(nèi)外最優(yōu)路徑相關(guān)研究成果的基礎(chǔ)之上,本文對(duì)最優(yōu)路徑的概念和求取辦法以及相關(guān)程序設(shè)計(jì)都進(jìn)行了基礎(chǔ)性的探討。 本文首先闡述了最優(yōu)路徑和K則最優(yōu)路徑的概念,明確了最優(yōu)路徑并不是傳統(tǒng)意義上的幾何距離最短,而是在參考了多個(gè)影響因素下的當(dāng)量長度最短。然后介紹了求取最優(yōu)路徑的各種方法,主要詳細(xì)介紹了經(jīng)典Dijkstra算法的基本原理以及計(jì)算步驟,分析了經(jīng)典Dijkstra算法的優(yōu)缺點(diǎn),針對(duì)其存在的搜索方向的盲目性和效率低的缺點(diǎn),提出了扇形優(yōu)化、直線優(yōu)化和節(jié)點(diǎn)優(yōu)化的各種改進(jìn)算法。同時(shí)簡要介紹了其他多種計(jì)算最優(yōu)路徑的算法,包括蟻群算法、Floyd算法等等。對(duì)于K則最優(yōu)路徑而言,目前沒有特別完善的算法,但是常用的算法有去邊算法,也就是先利用經(jīng)典Dijkstra算法計(jì)算出任意兩點(diǎn)之間的最優(yōu)路徑,然后依次刪除最優(yōu)路徑中的任一邊,重新計(jì)算比較得到K則最優(yōu)路徑,這種算法有一定的優(yōu)勢,只需要反復(fù)運(yùn)用Dijkstra算法即可,但是這種算法求得的是近似最優(yōu)路徑。本文還重點(diǎn)介紹了求取K則最優(yōu)路徑的鄰近點(diǎn)算法、稀疏矩陣算法、雙向搜索算法等,并對(duì)各種算法都用小實(shí)例加以詮釋,分析其利弊。相比較而言,雙向搜索算法的思路更清晰,也最簡單,就是兩次Dijkstra算法而已。它的主要思路是：分別以災(zāi)變地點(diǎn)和安全地點(diǎn)為起始點(diǎn),向外擴(kuò)展,直到某一個(gè)節(jié)點(diǎn)被兩邊擴(kuò)展的路徑都永久標(biāo)記,也就是成為了連接點(diǎn),這時(shí)候從災(zāi)變地點(diǎn)到連接點(diǎn)的最優(yōu)路徑加上從連接點(diǎn)到安全地點(diǎn)的最優(yōu)路徑就是所求得的最優(yōu)路徑,然后繼續(xù)兩邊搜索,就可以依次得到第二優(yōu)路徑、第三優(yōu)路徑等等。后來針對(duì)本文所涉及到的VB程序設(shè)計(jì)語言給予了簡單的介紹。之后根據(jù)華盛礦的具體巷道參數(shù)和通風(fēng)網(wǎng)絡(luò)圖,并用Dijkstra算法和K則最優(yōu)路徑的雙向搜索算法為基礎(chǔ),分別設(shè)計(jì)了求取最優(yōu)路徑和K則最優(yōu)路徑以及多個(gè)安全出口的最優(yōu)路徑的運(yùn)行界面,并通過實(shí)際節(jié)點(diǎn)驗(yàn)證了其正確性與可操作性。最后對(duì)本課題研究所存在的問題與不足以及對(duì)未來的展望做了簡單的陳述。
[Abstract]:As the energy organization structure of our country has the characteristics of "rich coal, lack of oil and less gas", coal will play an important role in the national economy of our country for a long period of time. Because of the particularity of coal occurrence conditions, most of the coal mining is determined to be well mined. Compared to the ground environment, the downhole environment is more complex and worse, and the situation is more chaotic. Therefore, in order to avoid all kinds of casualties and property loss accidents, it is necessary for the government, coal mine management, miners, and social public opinion to cooperate together to achieve. But because of some natural disasters and accidents, mine accidents Sometimes it is inevitable that personnel escaping and rescuing injured people are the most important of the mine emergency rescue work. However, the main sign of the success of the emergency rescue work is whether to complete the escape and rescue of the personnel within the specified time, that is, whether or not it can be won in the race with the time. This is the significance of the topic selected in this paper. On the basis of comprehensive and reference to the research results of the optimal path at home and abroad, the concept and methods of optimal path and the related procedures are set up in this paper. A basic discussion was carried out in the plan.
In this paper, the concept of the optimal path and the optimal path of K is first expounded. It is clear that the optimal path is not the shortest geometric distance in the traditional sense, but the shortest equivalent length under the reference of several influencing factors. Then, various methods for obtaining the optimal path are introduced, and the basic principles of the classical Dijkstra algorithm are introduced in detail. The advantages and disadvantages of the classical Dijkstra algorithm are analyzed. In view of the shortcomings of the blind search direction and low efficiency, the fan shape optimization, the linear optimization and the node optimization are proposed. At the same time, some other algorithms for calculating the optimal path are briefly introduced, including the ant colony algorithm, the Floyd algorithm and so on. For the K algorithm, the algorithm for the optimization of the optimal path is introduced. In terms of the optimal path, there is no perfect algorithm, but the commonly used algorithm has the edge algorithm, that is to use the classical Dijkstra algorithm to calculate the optimal path between any two points first, then delete the other side of the optimal path in turn, and re calculate and compare the K optimal path. This algorithm has some advantages, only a certain advantage. Dijkstra algorithm can be used repeatedly, but this algorithm is an approximate optimal path. This paper also focuses on the proximity point algorithm, sparse matrix algorithm, bidirectional search algorithm, and the advantages and disadvantages of various algorithms with small examples. Clearly and simplest, it is the two Dijkstra algorithm. Its main idea is to extend the location of the catastrophe and the location of the security as the starting point, until the path of a node is permanently marked on both sides, that is, the connection point, and then the optimal path from the disaster location to the connection point is added from the connection point. The optimal path to the safe place is the optimal path obtained, and then continue to search on both sides, we can get the second optimal path, the third best path and so on. Later, it gives a brief introduction to the VB programming language involved in this article. Then, according to the specific tunnel parameters and ventilation network diagram of huasin mine, and using Dijkstra Based on the algorithm and the bidirectional search algorithm of the K optimal path, the operation interface of the optimal path, the K optimal path and the optimal path of multiple security exits are designed respectively, and the correctness and maneuverability of the optimal path are verified by the actual nodes. A simple statement.
【學(xué)位授予單位】：太原理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TD77;TP18

【參考文獻(xiàn)】

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

1 劉曉亮;;蟻群算法在GIS最短路徑求解中應(yīng)用的初步研究[J];城市勘測;2009年03期

2 孫殿閣,蔣仲安;改進(jìn)的Dijkstra算法在礦井應(yīng)急救援最佳避災(zāi)路線求取中的應(yīng)用[J];礦業(yè)安全與環(huán)保;2005年05期

3 任曉翠;;基于雙向搜索算法的物流配送最短路徑優(yōu)化研究[J];東方企業(yè)文化;2013年04期

4 姚建;田冬梅;王春雨;;瓦斯災(zāi)害時(shí)期人員安全疏散機(jī)理研究[J];華北科技學(xué)院學(xué)報(bào);2011年04期

5 戴樹貴;陳文蘭;;一個(gè)求解k短路徑實(shí)用算法[J];計(jì)算機(jī)工程與應(yīng)用;2005年36期

6 朱靜;Dijkstra算法在GIS中的優(yōu)化實(shí)現(xiàn)[J];計(jì)算機(jī)與現(xiàn)代化;2005年09期

7 束建華;;群體智能及其融合算法研究[J];科技信息;2009年32期

8 陳曉軍;侯海苗;;瓦斯爆炸及其預(yù)防[J];煤;2008年02期

9 王玉琨;吳鋒;;礦井應(yīng)急救援中最佳避災(zāi)路線的Dijkstra算法的改進(jìn)實(shí)現(xiàn)[J];工礦自動(dòng)化;2008年05期

10 陳樹偉;李光遠(yuǎn);王杰;;一種基于Dijkstra的實(shí)用多路徑求解算法[J];煤炭技術(shù);2011年01期

，

本文編號(hào)：1966486