Safety is a primary consideration in underground mining operations. Accidents could cause fatalities, injuries, and permanent disability of labourers, as well as irreparable financial and reputational losses. As an underground mine consists of many workspaces distributed in various zones, the selection of a junction location will be significant for timely evacuation of miners from different areas. This paper aims to determine the optimal location of the junction point for emergency evacuation in the underground network. The location problem is formulated as a MiniMax problem. Three methods are presented: Elzinga–Hearn algorithm, a three-dimensional extension of the Elzinga–Hearn algorithm, and the Welzl algorithm. The proposed methods are fully implemented in Python, and their functionality is demonstrated by conducting various case studies in 2D and 3D. The case studies showed that the proposed approaches could be used to determine junction point(s) in an underground network to serve as an evacuation location.
BergMD, CheongO, KreveldMv, OvermarsM.2008. Computational geometry: algorithms and applications. Springer-TELOS.
2.
BhattacharyaJ, KumarM, SanjayS.2001. Assessment of algorithms for location selection of facility in mines. Miner Resour Eng. 10 (03): 333 – 345. doi: 10.1142/S0950609801000695.
3.
BrandeauML, ChiuSS.1989. An overview of representative problems in location research. Manage Sci. 35 (6): 645 – 674. doi: 10.1287/mnsc.35.6.645.
4.
ChrystalG.1885. On the problem to construct the minimum circle enclosing n given points in the plane. P Edinburgh Math Soc. 3 (1885): 30 – 33. doi: 10.1017/S0013091500037238.
5.
DalalJ, MohapatraPK, MitraGC.2007. Locating cyclone shelters: a case. Disaster Prev Manag Int J.
6.
DreznerZ, ShelahS.1987. On the complexity of the Elzinga-Hearn algorithm for the 1-center problem. Math Oper Res. 12 (2): 255 – 261. doi: 10.1287/moor.12.2.255.
7.
DuB, ZhouH.2018. A robust optimization approach to the multiple allocation p-center facility location problem. Symmetry (Basel). 10 (11): 588.
ElzingaJ, HearnD.1974. The minimum sphere covering a convex polyhedron. Nav Res Logist Q. 21 (4): 715 – 718. doi: 10.1002/nav.3800210414.
10.
ElzingaJ, HearnDW.1972. Geometrical solutions for some minimax location problems. Transp Sci. 6 (4): 379 – 394.
11.
FarahaniRZ, HekmatfarM.2009. Facility location: concepts, models, algorithms and case studies. Springer.
12.
FengH-Y, EndriasDH, TaherMA, SongH.2013. An accurate and efficient algorithm for determining minimum circumscribed circles and spheres from discrete data points. Comput-Aided Design. 45 (2): 105 – 112. doi: 10.1016/j.cad.2012.07.014.
GärtnerB.1999. Fast and robust smallest enclosing balls. 7th Annual European Symposium. p. 325 – 338.
15.
HearnD, VijayJ.1981. A geometrical solution for the weighted minimum circle problem. doi: 10.13140/RG.2.2.23856.15367.
16.
HearnDW, VijayJ.1982. Efficient algorithms for the (weighted) minimum circle problem. Oper Res. 30 (4): 777 – 795.
17.
HoppTH, ReeveCP.1996. An algorithm for computing the minimum covering sphere in any dimension. In: NIST IR5381. Gaithersburg (MD): NIST. p. 1 – 8.
18.
KällbergL.2019. Minimum enclosing balls and ellipsoids in general dimensions. Mälardalen University.
19.
KallianiotisA, KaliampakosD.2016. Optimization of exit location in underground spaces. Tunn Undergr Sp Tech. 60: 96 – 110.
20.
KotianSr, BonillaC, HaleTS.2008. The planar k-centra location problem. Open Ind Manuf Eng J. 1(1).
21.
LawsonCL.1965. The smallest covering cone or sphere (C. Groenewod and L. Eusanio). SIAM Rev. 7 (3): 415 – 412. doi: 10.1137/1007084.
22.
LiF, JinL, HanH, HuangZ, ZhangN.2012. Location selection of mine refuge stations and study of key techniques in underground coal mine. J Liaoning Tech Univ Nat Sci.
23.
LiuM, LianJ.2020. Optimization of epidemic-logistics network considering the original emergency facilities. 2020 39th Chinese Control Conference (CCC). p. 1673 – 1678.
24.
LondeMA, AndradeCE, PessoaLS.2021. An evolutionary approach for the p-next center problem. Expert Syst Appl. 175: 114728.
25.
LotfianR, NajafiM.2019. Optimal location of emergency stations in underground mine networks using a multiobjective mathematical model. Inj Prev. 25 (4): 264 – 272. doi: 10.1136/injuryprev-2017-042657.
26.
MirzapourSA, WongKY, GovindanK.2013. A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations. Math Probl Eng.
27.
PlastriaF.2002. Continuous covering location problems. p. 37–79. doi: 10.1007/978-3-642-56082-8_2.
28.
SamuelGL, ShunmugamMS.2001. Evaluation of sphericity error from coordinate measurement data using computational geometric techniques. Comput Methods Appl Mech Eng. 190 (51): 6765 – 6781. doi: 10.1016/S0045-7825(01)00220-1.
29.
SirinandaK, BrazilM, GrossmanP, RubinsteinJ, ThomasD.2018. Strategic underground mine access design to maximise the net present value. In: Advances in applied strategic mine planning. Springer. p. 607 – 624.
30.
SirinandaK, BrazilM, GrossmanPA, RubinsteinJH, ThomasDA.2015. Maximizing the net present value of a Steiner tree. J Global Optim. 62 (2): 391 – 407.
