摘要
为使矿井避灾路线有更好的适用性,探讨了矿井面临不同类型灾害危险时最佳避灾路线分类求取方法。根据不同灾变的特点,将矿井灾害分为突水灾害,煤与瓦斯突出、瓦斯或煤尘爆炸、矿井火灾,冒顶事故三大类;绘制三类灾害的可行避灾路线拓扑图,并计算各条巷道的当量长度;将巷道当量长度作为可行路线各边的权值代入拓扑图中,用最短路径算法Dijkstra算法求解各拓扑图对应的最佳避灾路线。分析结果表明,基于Dijkstra算法的矿井最佳避灾路线分类求取方法扩大了避灾路线的选取范围,在避灾人员较多时,可使巷道系统的通行能力得以充分发挥。
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.
作者
童兴
原帅琪
方伟鹏
马晋钰
TONG Xin g , YUAN Shuaiqi, FANG WeiPeng , MA J in y uSchool of Resource and Safety Engineering , China University of Mining and Technology(Beijing） ,Beijing 100083, Chin)
出处
《工矿自动化》
北大核心
2018年第4期94-99,共6页
Journal Of Mine Automation
基金
国家自然科学基金资助项目(11502283)
关键词
煤矿紧急避险
最佳避灾路线
分类求取
最短路径算法
DIJKSTRA算法
coal mine emergency avoidance
best escape route
classification and calculation
shortest path algorithm
Dijkstra algorithm
