矿井应急救援中最佳避灾路线的Dijkstra算法的改进实现  

Implementation of Improved Dijkstra Algorithm for Choosing the Best Escape Route in Mine's Emergency Rescue

作　　者：王玉琨[1] 吴锋[1] 

机构地区：[1]河南理工大学计算机科学与技术学院,河南焦作454000

出　　处：《工矿自动化》2008年第5期13-15,共3页Journal Of Mine Automation

摘　　要：文章介绍了矿井灾害应急救援的情况和最佳避灾路线的确定方法。在分析Dijkstra算法的基础上,根据矿井巷道平面网络的特点,从限制搜索范围和搜索方向着手在扇形区域内寻找最短路径,完成了对矿井应急救援中最佳避灾路线的Dijkstra算法的优化。该优化算法可根据用户给出的源点与目的点以及搜索的扇形角度查找最短路径,频繁遍历的顶点数量为经典算法的2a/360,大大提高了搜索速度和运行效率。The paper introduced the status of mine＇s emergency rescue and determination method of the best escape route. Based on the analysis of Dijkstra＇s algorithm and according to features of mine tunnel （laneway） planar network, it searched the shortest path within a sector region to complete the optimization of the Dijkstra algorithm for escape route in mine＇s emergency rescue from restricting search scope and direction. The optimization algorithm can find a shortest path according to start node, goal node and angle of searching sector given by user, and the number of processed nodes account for 2a /360 of classical algorithm, so speed and efficiency of the optimization algorithm are improved.

关 键 词：矿井 应急救援 避灾路线 扇形优化Dijkstra算法 最短路径 

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