论文部分内容阅读
为节省煤矿水灾状况下的逃生时间,提高应急救援效率,在传统的Dijkstra算法基础上提出一种基于双向搜索的K则最短路径算法.首先综合考虑煤矿特殊巷道分布,提出井巷长度当量权值,然后利用灰色理论模型预测特定时间段内每条巷道的人流量,进而根据人流量对行走速度的影响关系式得到每条巷道的通行时间值,最终通过双方搜索策略改进算法,实现事故点到逃生井口的多条最佳逃生路线.根据井下巷道拓扑结构提取构建一个无向带权网络图,在MATLAB环境下利用上述优化算法进行仿真验证.结果显示,该改进算法具有更好的准确率和实用性.
In order to save the escape time under the condition of coal mine flood and improve the efficiency of emergency rescue, a K-shortest path algorithm based on bidirectional search is proposed based on the traditional Dijkstra algorithm.Firstly, considering the distribution of special roadway in coal mine, , And then use the gray theory model to predict the flow of people in each roadway in a specific period of time, and then get the passage time value of each roadway according to the influence of people flow on walking speed, and finally improve the algorithm through both search strategies, The best escape route to escape the wellhead.An undirected weighted network map is constructed based on the topological structure of the underground tunnel and simulated by the above optimization algorithm in MATLAB environment.The results show that the improved algorithm has better accuracy and Practicality.