EMD Algorithm For Emergency Evacuation Of Large Crowd Under Mine

After mine accident,determine an optimal crowd evacuation route not only ensures the safety of the workers,but also reduces many unnecessary property losses.After the mine accident,how to determine an optimal rescue route for avoiding disaster,which will minimize the impact of accidents and the number of casualties,has become the key research direction of mine emergency handling methods.Traditional methods focus on individual grooming optimization and often ignores the overall optimization.Therefore,this article will proceed from the macro perspective and study the emergencies in the accident handling of mines.In order to solve the above problem,according to the distribution of underground roadway,this paper combines geographic information technology and downhole monitoring system.Then use a suitable algorithm to establish a complete underground emergency hedging system.On the basis of considering the complex underground environment,both the individual optimum and global optimum are considered.To quickly and accurately select the optimal escape route,which not only has great significance for post-disaster relief,but also provides scientific basis for emergency plans for all types of accidents in mines and promotes the sustainable,stable,and healthy development of mining enterprises.Considering the shortcomings and errors in the existing shortest path algorithm,and learning from Operations Research in the least cost of transportation,a new EMD algorithm has been proposed.Which can not only adapt to the complex and varied environment downhole,but also complete the output of the global optimal path.First of all,from the macroscopic point of view,complete the design and implementation of the static EMD algorithm for large-scale emergency crowding underground,and calculate the overall optimal escape route quickly and efficiently.Then,considering the objective factors of the changing environment underground,to calculate the equivalent length of the roadway,and the dynamic EMD path planning algorithm is realized by the constant iteration of the static EMD algorithm,and the global optimal escape route can be dynamically and quickly constructed.Finally,through a large number of simulation experiments,static simulation experiments of simple models,dynamic model experiments,random network diagram simulation experiments,and actual downhole simulation experiments,verify the method proposed by Judging with Dijkstra’s algorithm.