矿井火灾时期K则最优避灾路径研究

Research on K Shortest Avoid Disaster Path During Mine Fire Period

煤矿井下发生火灾时,产生的各种有毒有害气体会严重影响井下人员的生命和财产安全,所以应在火灾发生初期用尽可能短的时间逃到安全地点。基于这种思路,在Dijkstra算法思想的基础之上,阐述了在带权无向图中求取最优路径的方法,并提出了求取K则最优路径的新方法。然后结合矿井具体实例,利用VB程序设计语言,对2种路径的快速准确获取提供了可能。

During fire period under the coal mine,varieties of toxic or harmful gases will seriously affect the life and property safety of the miners,so the miners should flee to safety site in the shortest time at the beginning of the fire.Based on this thought,this paper expounds the method of getting optimum path in undirected graph with right based on the Dijkstra algorithm,and puts forward the new method of K shortest path.Then combining with mine specific examples,using VB programming language,this paper provides possibility to get the two routes quickly and accurately.