Mathematical model and algorithm of a dynamic optimum rescue route during mine fire time based on MapObject
-
摘要: 運用運籌學中圖論的理論和方法建立了井下火災動態救災路線數學模型,用改進的Dijkstra算法求解該模型并用MapObject控件實現.結合井下火災時期救災路線動態選擇過程詳細介紹了改進的Dijkstra算法運算的各個步驟,擬合出礦井火災時期人員停留和行走時間與溫度的關系函數.以東龐礦礦井災害應急救援項目為例,通過程序運算,在東龐礦井下巷道分布示意圖上動態搜索救災人員營救受災人員的最佳救災路線,不但實現了可視化要求而且效率高,為礦井火災救災提供了有力的技術支持.Abstract: The graph-theory method was used to build a mathematical model of the optimum rescue route during mine fire time and an improved Dijkstra algorithm was brought forward to calculate it. Then each step of the Dijkstra algorithm was discussed, and the residence and moving time-temperature function was fitted. Finally, taking the mine hazard emergency rescue system of Dong-pang mine as an example, through operation the decision maker can get the optimum rescue route on the Dongpang mine tunnel distribution sketch map. The software realizes the requirement of visualization with high efficiency and provides powerful technical support for mine fire rescue.
-
Key words:
- mine fire /
- improved Dijkstra algorithm /
- rescue route /
- mathematical model /
- MapObject /
- emergency rescue
-

計量
- 文章訪問數: 175
- HTML全文瀏覽量: 41
- PDF下載量: 5
- 被引次數: 0