Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Faisal, K., Samith, R., Salim, A.: Methods and models in process safety and risk management: past, present and future. Process Saf. Environ. Prot. 98, 116–147 (2015)
Özdamar, L., Demir, O.: A hierarchical clustering and routing procedure for large scale disaster relief logistics planning. Transp. Res. Part E Logistics Transp. Rev. 48(3), 591–602 (2012)
Lahmar, M., Assavapokee, T., Ardekani, S.A.: A dynamic transportation planning support system for hurricane evacuation. In: Intelligent Transportation Systems Conference (ITSC 2006), pp. 612–617 (2006)
Wang, L., Wang, Y., Cao, Q., Li, X., Li, J., Wu, X.: A framework for human error risk analysis of coal mine emergency evacuation in China. J. Loss Prev. Process Ind. 30, 113–123 (2014)
Radianti, J., Granmo, O., Sarshar, P., Goodwin, M., Dugdale, J., Gonzalez, J.J.: A spatio-temporal probabilistic model of hazard- and crowd dynamics for evacuation planning in disasters. Appl. Intell. 42(1), 3–23 (2015)
Ji, J., Zhang, J., Chen, J., Wu, S.: Computer simulation of evacuation in underground coal mines. Min. Sci. Technol. 20, 0677–0681 (2010)
Adjiski, V., Mirakovski, D., Despodov, Z., Mijalkovski, S.: Simulation and optimization of evacuation routes in case of fire in underground mines. J. Sustain. Min. 14(3), 1–11 (2015)
Zhang, S., Wu, Z., Zhang, R., Kang, J.: Dynamic numerical simulation of coal mine fire for escape capsule installation. Saf. Sci. 50, 600–606 (2012)
Goodwin, M., Granmo, O., Radianti, J.: Escape planning in realistic fire scenarios with Ant Colony Optimisation. Appl. Intell. 42, 24–35 (2015)
Evans, J., Minieka, E.: Optimization Algorithms for Networks and Graphs, 2nd edn. Marcel Dekker, New York (1992)
Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129–174 (1996)
Jalali, S.E., Noroozi, M.: Determination of the optimal escape routes of underground mine networks in emergency cases. Saf. Sci. 47, 1077–1082 (2009)
Martins, E., Pascoal, M., Santos, J.: A new algorithm for ranking loopless paths. Technical report, Univ. de Coimbra (1997)
Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)
Jin, W., Chen, S., Jiang, H.: Finding the K shortest paths in a time-schedule network with constraints on arcs. Comput. Oper. Res. 40, 2975–2982 (2013)
Sever, D., Dellaert, N., Woensel, T., Kok, T.: Dynamic shortest path problems: hybrid routing policies considering network disruptions. Comput. Oper. Res. 40(2013), 2852–2863 (2013)
Garey, M.R., Johnson, D.S.: Strong NP-completeness results: motivation, examples, and implications. J. ACM 25, 499–508 (1978)
Acknowledgments
This research was supported in part by General Project of Science and Technology Plan of Beijing Municipal Education Commission (KM201910017006), Program of Beijing Excellent Talents Training for Young Scholar (2016000020124G056). Prof. Wu and Prof. Xu were supported in part by China National Scientific and Technical Support Program (2016YFC0801801), China National Natural Science Foundation (41430318, 41272276, 41572222, 41602262), Beijing Natural Science Foundation (8162036) and STATE Key Laboratory of Coal Resources and Safe Mining.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Hong, Y., Li, D., Wu, Q., Xu, H. (2019). 3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush Evacuation. In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-26176-4_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26175-7
Online ISBN: 978-3-030-26176-4
eBook Packages: Computer ScienceComputer Science (R0)