工矿自动化2018，Vol.44Issue(4)：94-99,6.DOI:10.13272/j.issn.1627-251x.17314
基于Dijkstra算法的矿井最佳避灾路线分类求取
Classification and calculation of the best escape route of coal mine based on Dijkstra algorithm
摘要
Abstract
In order to make mine escape route have better applicability,the method of classification and calculation of the best escape route when the mine is facing different types of disaster risk was discussed.According to characteristics of different disasters,mine disasters are classified into three categories:water inrush disaster,roof fall accident,and a category including coal and gas outburst,gas or coal dust explosion,mine fires.Feasible topological maps for the three types of disasters are plotted,and equivalent length of each roadway is calculated.The equivalent length of the roadway is taken into the topological map as weight of each side of the feasible route,and the shortest path algorithm Dijkstra algorithm is used to solve the best escape route of each topology.Analysis result shows that the method expands selection of escape routes and make capacity of roadway system be fully developed with more refugees.关键词
煤矿紧急避险/最佳避灾路线/分类求取/最短路径算法/Dijkstra算法Key words
coal mine emergency avoidance/best escape route/classification and calculation/shortest path algorithm/Dijkstra algorithm分类
矿业与冶金引用本文复制引用
童兴,原帅琪,方伟鹏,马晋钰..基于Dijkstra算法的矿井最佳避灾路线分类求取[J].工矿自动化,2018,44(4):94-99,6.基金项目
国家自然科学基金资助项目(11502283). （11502283）
