基于偏离路径的煤矿水灾Yen-K最优路径算法

Based on Deviating Path of Yen-K Shortest Paths in Mine Water Inrush Hedge Algorithm

为矿井水灾提供最佳逃生路线,提高应急救援效率,首先引入当量长度,结合水流等巷道相关因素,求解到达安全地点的时间最短路径;其次根据一般矿井具有多个逃生出口的特性,提出一种基于偏离路径的煤矿水灾Yen-K最优路径算法,分别求出从源节点到每个目标节点的前k则最优路径;最后按照长度大小排序求得的所有路径,并结合矿井具体实例选取所需的前若干条逃生路线。在MATLAB环境下,对文章算法与传统的Dijkstra算法、K最短路径(KShortestPaths,KSP)算法进行仿真对比分析,结果显示改进后的算法在求解矿井水灾逃生最优路径时更具准确性和实用性。

To providing the best escape routes and improve the emergency rescue efficiency,this paper introduces equivalent length and combines the influence of factors related to tunnels such as water flow to solve the least time paths to reach a safety wellhead.Due to mine exits are commonly more than one,this paper proposes a algorithm based on deviating path of Yen-k shortest paths in mine water inrush hedge,which is used to respectively obtain k optimal paths from source node to each of the target node.Finally several escape routes are obtained according to the length of paths sorting and connecting with the concrete instance selection for mine.The improved algorithm,traditional Dijkstra algorithm and K Shortest Paths(KSP)algorithm are simulated and analyzed in MATLAB,the results show that the improved algorithm has more accuracy and practicability in solving the optimal escape path of mine water inrush hedge.