3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush Evacuation

摘要

The evacuation planning for mine water-inrush is of great importance for personal and property security, and the research of this field in 3D scenarios can provide intuition vision for the geographic space and contribute to the evacuation plan and implementation. In this paper, based on 3D mine model, we address a multi-objective optimization problem for evacuation path planning in mine water-inrush scenario, namely the global-optimized multi-path finding problem, which aims to minimize the global evacuation time-consuming and balance the evacuation loads of the emergency exits. Based on the auxiliary graph transformation, we propose a 3-phase heuristic referred to the classical problem, Minimum Weighted Set Cover. We finally conduct extensive experiments to evaluate the performance of the proposed algorithm, whose results indicate the heuristic outperform the existing alternatives in terms of the utilization as well as timeliness.