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

发布时间：2018-02-01 10:12

本文关键词： 矿井水灾多最优路径当量长度 Dijkstra算法 K则最优路径算法　出处：《煤炭学报》2015年02期 　论文类型：期刊论文

【摘要】：矿井水灾时选择合理的逃生路线,需要考虑水及巷道其他因素的影响,引入当量长度来求解到达逃生地点用时最短最安全的路径。Dijkstra算法可求解从源节点到目标节点的最短路径,K则最优路径算法可求解从源节点到某一目标节点的前N条最优路径,矿井水灾时,为了避免拥挤,同一地点工作的人员可选择多个逃生井口进行逃生,但从源节点到某一目标节点的前N条最优路径并不一定是到其他逃生井口的前N条最优路径,基于这种思路,在Dijkstra算法的基础上,提出一种从源节点到其他所有逃生节点的前N条最优路径的新方法,并结合矿井具体实例,与Dijkstra算法和K则最优路径算法比较,用MATLAB仿真实现。
[Abstract]:It is necessary to consider the influence of water and other factors of roadway to choose a reasonable escape route during mine flood. The equivalent length is introduced to solve the shortest and safest path to reach the escape point. Dijkstra algorithm can solve the shortest path from the source node to the target node. K optimal path algorithm can solve the first N optimal path from the source node to a certain target node. In order to avoid congestion, people working in the same location can choose multiple escape wellheads to escape. However, the first N optimal path from the source node to a certain target node is not necessarily the first N optimal path to the other wellhead. Based on this idea, based on the Dijkstra algorithm. This paper presents a new method of the first N optimal path from the source node to all other escape nodes, and compares it with the Dijkstra algorithm and K optimal path algorithm. It is realized by MATLAB simulation.
【作者单位】：中国矿业大学计算机科学与技术学院;
【基金】：江苏省自然科学基金资助项目(BK2012129)
【分类号】：TD745
【正文快照】： (School of Computer Science and Technology,China University of Mining and Technology,Xuzhou 221116,China)就我国目前煤矿安全装备和技术水平现状,无论矿井水灾预防工作做的如何周密,由于采煤环境的水文地质条件的复杂性、水害影响因素和形成机理的多样性以及对矿井水

【参考文献】