基于D-K算法的煤矿水灾多最优路径研究  

Research on the multi-optimal paths of coal mine floods based on the D-K algorithm

作　　者：赵作鹏[1] 宋国娟 宗元元[1] 李晓波[1] 康清华[1] 张雪涛[1] 王艳辉[1] 许新征[1] 

机构地区：[1]中国矿业大学计算机科学与技术学院,江苏徐州221116

出　　处：《煤炭学报》2015年第2期397-402,共6页Journal of China Coal Society

基　　金：江苏省自然科学基金资助项目(BK2012129)

摘　　要：矿井水灾时选择合理的逃生路线,需要考虑水及巷道其他因素的影响,引入当量长度来求解到达逃生地点用时最短最安全的路径。Dijkstra算法可求解从源节点到目标节点的最短路径,K则最优路径算法可求解从源节点到某一目标节点的前N条最优路径,矿井水灾时,为了避免拥挤,同一地点工作的人员可选择多个逃生井口进行逃生,但从源节点到某一目标节点的前N条最优路径并不一定是到其他逃生井口的前N条最优路径,基于这种思路,在Dijkstra算法的基础上,提出一种从源节点到其他所有逃生节点的前N条最优路径的新方法,并结合矿井具体实例,与Dijkstra算法和K则最优路径算法比较,用MATLAB仿真实现。Choosing reasonable escape routes needs to consider the impact of water and other factors of roadway in mine flood. This paper introduces an equivalent length to solve the least time and safest paths for reaching a safe surface. The Dijkstra algorithm can calculate the length of shortest path from the source node to the destination node. Kshortest paths algorithm can find the shortest N paths from the source node to a target node. When a water inrush accident happens in coal mine, people can escape from different paths. However, the top N shortest paths from the source node to a destination node might not be the best escaping path to a safe surface. According to that, this paper proposes a method on choosing the top N shortest paths from the source node to all destination nodes. Using the MATLAB, a simulation was conducted based on the specific examples of mine, and compared with the Dijkstra algorithm and K- shortest paths algorithm.

关 键 词：矿井水灾 多最优路径 当量长度 DIJKSTRA算法 K则最优路径算法 

分 类 号：TD745.2[矿业工程—矿井通风与安全]