Multi-Objective Real-Time Planning of Evacuation Routes for Underground Mine Fires

When a fire occurs underground, pre-existing emergency escape routes may become ineffective. Such scenarios necessitate the real-time planning of escape routes that consider evolving conditions and prioritize safety. This paper proposes a multi-objective real-time search method for emergency escape routes using dynamic programming to address these challenges. Firstly, this paper discusses how the evacuation of an underground mine fire caused by external factors depends on the fire monitoring system, personnel positioning system, and emergency evacuation system, as well as the modeling and solution methods of evacuation route planning. Then, based on fire smoke, CO, and temperature sensor data from the mine ventilation network structure and monitoring system, the possible smoke spread in the event of an underground fire was calculated. The objectives are to optimize both the shortest equivalent length of the path and the shortest time to walk through the smoke flow while ensuring that temporary escape time does not exceed the rated protection time of the self-rescuer. A mathematical model for emergency escape route planning is established under these conditions. A labeling algorithm based on dynamic programming is employed to find the Pareto optimal solution set of emergency evacuation routes that meet emergency requirements. Finally, two path evaluation indicators, namely “escape target priority” and “personnel temporary escape time”, are introduced to re-rank the solutions in the Pareto optimal set, thereby obtaining disaster evacuation routes with different priorities. Example verification shows that the algorithm can quickly solve the disaster evacuation routes that meet the actual disaster evacuation needs in complex networks. Example verification shows that the algorithm can quickly solve the emergency escape routes in complex networks that meet actual emergency escape needs.