Application of Mixed-Integer Programming for Mine Evacuation Modeling with Vehicles

The safe evacuation of miners during an emergency in the shortest amount of time is one of the most essential features of a mining operation. Despite advancements in mine evacuation research, the usage of mine vehicles during evacuation has not been considered. The majority of recent studies have been done on miners’ evacuation on foot. Mathematical formulations including Minimum Cost Network Flow (MCNF) models, Dijkstra's algorithm, Floyd-Warshall algorithm, and Ant Colony Optimization models have been used to solve mine evacuation problems. These models, which concentrate on determining the shortest escape routes during the evacuation, have been found to be computationally expensive and may not offer the best solutions in some cases. The goal of this paper is to incorporate light vehicles in the evacuation process using a mixed-integer programming approach. The methodology aims to minimize the total time required to evacuate the mine, ensuring minimal exposure of the miners to the adverse conditions that triggered the evacuation.