بهينه سازي مسيرهاي خروج اضطراري در معادن زيرزميني بزرگ با كاربرد الگوريتم ديكسترا

Improvement of Emergency Escape Routes in Large Underground Mines Using Dijkstra Algorithm

In order to improve the safety of underground mines and also avoid and control possible accident, many solutions have been thought; though sometimes running away from the danger zone and getting to the ground surface or other possible safe place inside the underground mineʹs network is the only viable way to keep safe. Naturally, finding the best escape route from the accident zone to a safe place should be of high concern. The only feasible approach for finding the best escape route is through the Dynamic programming Algorithm, though its application is huge underground network is time-related complications. In this paper, the Dijkstra algorithm, which is less time-related complications, is applied in order to determine the shortest escape time from an assumed point to alternative points of an underground mine network and also their corresponding routes between assumed points. At the end of this article, the Dijkstra and Floyd-Warshall algorithms were performed on the coal mine underground network and results were compared.