Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2021 Jan 29;11:2621. doi: 10.1038/s41598-021-82121-7

Optimal location of water level sensors for monitoring mine water inrush based on the set covering model

Qiang Wu 1,2, Zhili Du 1,2,, Yingwang Zhao 1,2, Hua Xu 3, Xiaoyan Zhang 1,2
PMCID: PMC7846800  PMID: 33514809

Abstract

Water inrush is one of the major mining disasters that may lead to numerous casualties. The development of information techniques makes it possible to monitor the occurrence and evolution of water inrush. Then, locating monitors for water inrush becomes a primary problem. This study presents a method of optimal location of water level sensors by constructing a set covering model. The monitoring scope of the water level sensor at each location in a given time is computed first based on the numerical simulation of water spreading along mine tunnels. In this simulation, the water inrush quantity is assigned using the mine drainage capability over which an accident may occur. Then the greedy algorithm is used to optimize the number and positions of water level sensors. As results, a mine water disaster can be monitored in the given time after it happened. The proposed method is then verified in the Beiyangzhuang coal mine in the North China. The results show that at least 22, 36, 42, 64 and 106 water level sensors are needed to monitor water disasters in the whole mine within 60, 30, 20, 10 and 5 min, respectively.

Subject terms: Hydrology, Energy science and technology, Engineering

Introduction

Coal is the main energy resource in China, and coal mines exist in many parts of the country. Hydrogeological conditions in some coal mines are extremely complex, and these coal mines are frequently threatened by a variety of hydrogeological hazards. Among all the hazards in coal mines, water inrush is one of the most notorious15. Between 2007 and 2017, the number of accidents and casualties caused by mine water inrush declined in general. However, the average number of deaths per accident did not decrease significantly, and even increased in 2014 and 2015. The main reason for this situation is that it is unable to accurately predict the time and locations of mine water inrush disasters. Once a water disaster occurs, effective emergency rescue measures cannot be taken in time due to the lack of accurate first-hand information of the water disaster.

In recent years, the monitor of water inrush becomes a hotspot. The nation has begun to put forward the development concept of "people-oriented", and has paid more and more attention to people. The latest” Detailed Rules for Coal Mine Water Prevention and Control” propose to firmly establish the concept of people-oriented and safe development, and point out in Chapter 7 that emergency response to water disasters should be targeted, scientific and operable7. Its essence is to monitor the occurrence of mine water disaster as soon as possible and provide accurate and reliable information in time for emergency rescue. Fortunately, it becomes possible to realize the real-time monitoring of water disaster by setting water level sensors in mine tunnels with the continuous development of social informatization, the progress of monitoring technology, the reduction of monitoring equipment costs, and the improvement of monitoring network technology, such as 5G network technology. Then, it becomes an urgent engineering problem to arrange water level sensors in the mine tunnels to monitor the occurrence of water disaster quickly and obtain accurate first-hand information in time, such as the quantity, location and spread area of the water disaster. At present, the monitoring system mainly monitors the amount of water passing through the mine drainage pipelines. The monitor sensors are located based on single factor or static monitoring, and even only monitoring the suspicious areas of coal seam floor at regular and fixed points in a few water hazards monitoring8,9. There is still little research on real-time monitoring of water flow in the mine tunnels, especially for the monitoring of water flow spreading in the tunnels after water inrush.

As a valuable method for siting service facilities, facility location models have been widely used in numerous applications, including determining the location of defense facilities considering a time horizon10, optimal placement of sensors in watercourses11, determining the location and size of charging stations for electric vehicles12, positioning distribution centers for emergency stockpiles to improve preparedness in the event of a disaster13, positioning water quality monitoring stations14, solving hub location problems in urban transport and liner shipping network design15, designing supply chain networks16, choosing the location of facilities in a humanitarian relief chain responding to quick-onset disasters17, and examining service systems applied to the distribution of policemen in highway networks18. Covering problems are among the most popular facility location models. They have always been very attractive for research due to their real-world applicability, especially for emergency facilities1933.

In this paper, a method to optimally locate of water level sensors for mine water inrush is presented based on the set covering model using the simulation data of mine water inrush process. These sensors can record the depth of water in tunnels. Furthermore, the monitoring data of water level sensors can be analyzed for further prediction and prevention of mine water inrush so as to carry out effective emergency rescue, and reduce casualties and property losses.

The main highlights of this paper are as follows:

  1. This study innovatively abstracts the optimal location of water level sensors into the set covering model. The monitoring scope of the water level sensor in each position is different along the tunnels, and it is necessary for optimally locating water level sensors.

  2. In this paper, the capacity of drainage system is taken as the quantity of simulated water inrush for the first time, so as to obtain the monitoring scope of the water level sensors.

  3. Greedy algorithm is used to solve the set covering model. And it achieves the real-time monitoring of water disasters in the whole mine with the least sensors in the given time.

Establishment of the set covering model

As can be seen from the previous introduction, the set covering model is one of the most popular facility location models. It is widely used in the location of various facilities in the real world, especially for emergency facilities2031. In the optimally locating problem of water level sensors for monitoring mine water inrush, the goal is to monitor water inrush in the whole mine with the least sensors within T minutes. Parameter T is the monitoring response time, that is, once a water inrush occurs in the mine, it will be monitored within T minutes. The monitoring scope of a water level sensor refers to a certain area where the occurred water inrush can be monitored by the sensor within T minutes. If the whole mine is represented as a set N and the monitoring scope of a water level sensor is represented as a set m, the monitoring scopes of all the water level sensors in each position can be represented as M. Therefore, the optimal location of the water level sensors can be abstracted as the set covering model:

Select the least m from the M to completely “cover” the set N.

The monitoring scope of water level sensors in each position will be different along the tunnels, and it is necessary for optimally locating water level sensors. The following will explain in detail how to construct the mine tunnels’ topology (the set N) and obtain the monitoring scopes (the M).

Construction of the mine tunnels’ topology

The mine tunnels’ topology is established on the basis of the distribution of mine excavation engineering and mine tunnels’ traverse points. The traverse points are abstracted into nodes with coordinates (x, y, z), and the water flow at these nodes is recorded during simulation of the water inrush process, including the time when water arrives and the depth of the water at different times. In the mine tunnels’ topology, the nodes are numbered uniformly, starting from 0. Assuming that the number of nodes in the mine tunnel topology is n, the set of all nodes can be expressed as N={0,1,2,,n-1}. The number of nodes can be increased by interpolation to record the water flow dynamics in more detail.

The tunnel between two nodes is abstracted into a line segment. The attributes of each line segment include the cross-sectional area, length, slope of the tunnel and the connections between tunnels. Figure 1 shows the process to establish the topological structure of a coal mining face and an excavation tunnel in a mine.

Figure 1.

Figure 1

Construction of topological structure of coal mine tunnels.

The spreading scope of water inrush

Water inrush process can be simulated using the Storm Water Management Model (SWMM) software based on the topology of the mine tunnels. It is an opensource module that has been widely used in the simulation of groundwater flow34,35. Water inrush process can be simulated as one-dimensional, unsteady and non-uniform open-channel flow38. A large number of simulation data of water inrush process at the nodes of the mine tunnels’ topology can be obtained by SWMM software.

The inrush quantity is of importance for numerical simulation as the boundary condition. In this paper, the quantity of water inrush is set according to the drainage capacity. There is a complete drainage system in the coal mine, and the drainage capacity of each mining area or mining face is different. For example, when the water inrush process is simulated at node i, if the drainage capacity of the area is Q, and thus the quantity of the simulated water inrush is set to Q. It is because when the quantity of the water inrush is less than Q, it can be pumped out in time without causing water inrush hazards. It is of practical significance to timely monitor the occurrence of water inrush with a water inrush quantity greater than or equal to Q. Furthermore, if a water inrush accident can be monitored whose quantity is Q, then it can monitor whose quantity is greater than Q in less time.

The spreading scope with T minutes after a water inrush happened can be obtained by numerical simulation. Figure 2 shows a water inrush occurred at node 7. The water flow extends to nodes 3, 9, and 21 after 60 min. The spreading scope of node 7 is the area marked in the figure by red lines.

Figure 2.

Figure 2

The spreading scope of water inrush at node 7.

Determination of monitoring scope

Water inrush occurring at node 7 can be monitored within 60 min if a water level sensor is located anywhere within the red area in Fig. 2. Hence, if a water level sensor is placed within the spreading scope of node i, the water inrush happened at node i can be monitored within T minutes.

Assuming that the spreading scope of node m coverages node j, a water level sensor placed at node j can monitor the water inrush happened at node m and the segments between them. As shown in Fig. 3, node 21 exists within the spreading scopes of nodes 4, 5, 6, 7, 20 and 21. The monitoring scope of the water level sensor placed at node 21 is the area marked by the green line. The monitoring scope of the water level sensor placed at node j can be expressed as Mj. The value of Mj is obtained by counting the number of spreading scopes where node j locates. The schematic diagram of M21 is shown in Fig. 3. It can also be expressed in the form of a set: M21=4,5,6,7,20,21.

Figure 3.

Figure 3

The monitoring scope of the water level sensor at node 21.

The monitoring scope of water level sensors placed at each node can be obtained through the spreading scope of water inrush of all nodes. The monitoring scope of all nodes can be represented as M.

M=M0,M1,M2,,Mjj=(0,1,2,,n-1)

The problem of optimally locating water level sensors then has been transformed into the set cover problem, which can be expressed as selecting the smallest number of monitoring scopes Mj from M to “cover” the set N. The detailed steps to solve this problem are explained in the next section.

Solution procedures

In this section, the optimal location method of water level sensors is realized based on the above set covering model using the greedy algorithm. Greedy algorithm refers to the best or optimal (that is, the most advantageous) choice is taken in each step of the selection when solving the problem, so as to hope that the result is the best or optimal algorithm. The results obtained by the greedy algorithm are often not the optimal results (sometimes the optimal solution), but they are relatively approximate (close to) the optimal solution. The advantages of greedy algorithm in solving the set covering model are simple, fast and easy to operate3740. A model of a single coal mining face is established to illustrate the detailed steps. The set of all nodes is expressed as N={5,6,7,,17}, as shown in Fig. 4a. The capacity of the drainage system in the mining face is 800 m3/h. The process of water inrush at each node is then simulated with the quantity, 800 m3/h. The time of the water inrush processes is set to 60 min. The monitoring scopes of all nodes are represented as M.

M=M5,M6,M7,,Mjj=(5,6,7,,17)

Figure 4.

Figure 4

Monitoring scope of each node in a mine working face.

By analyzing and processing the spreading scopes of the 13 nodes, M can be obtained. Then, the M are represented with different colors in Fig. 4b. Each node and its corresponding monitoring scope use the same color.

Then the set covering model of this mining face be expressed as selecting the smallest number of monitoring scopes Mj from the M to “cover” the set N. The specific steps required to solve this model by the greedy algorithm, as illustrated in Fig. 5, are as follows.

  1. Calculate the number of nodes in each monitoring scope and select the biggest one with most nodes. As shown in Fig. 5b, M10=8,9,10,11,12,13,14,15 contains most nodes and becomes the first selected one.

  2. Delete the nodes contained in M10 from the set N, then N={5,6,7,16,17}, and delete any monitoring scopes that does not contain the nodes in the set N. The result of this step is shown in Fig. 5c.

  3. Repeat step 1 to obtain the location of the next water level sensor at node 6. The M6 is shown in Fig. 5d, M6=5,6,7,8.

  4. Repeat step 2 to obtain the result shown in Fig. 5e, N={16,17}.

  5. Repeat steps 1 and 2 to obtain the location of the third water level sensor at node 15. The M15 is shown in Fig. 5f, M15=15,16,17.As results, the set N is empty, and the set N has been covered, then the process of optimizing the location of sensors is completed.

Figure 5.

Figure 5

The specific steps of the greedy algorithm.

M10, M6, and M15 are finally selected using this optimal location method, as shown in Fig. 6. Water level sensors are therefore located at nodes 10, 6, and 15, which can realize timely monitoring of water inrush occurring in this working face within 60 min. This optimal location method can be still applicable when the research area is extended to the whole mine.

Figure 6.

Figure 6

The result of the greedy algorithm (node 10, 6, and 15).

Case study

Study area

Beiyangzhuang Mine Field is located in the southeast of Yuxian Mining Area, Hebei Province. It is about 10 km long north to south, 5–8 km wide east to west, and has an area of 52 km2 (see Fig. 7). For the sake of confidentiality, relative coordinates were used in this paper. The main coal seam in the mine is the No. 5 Coal Seam of the Lower Jurassic Xiahuayuan Formation, which is affected by the Ordovician karst water. The hydrogeological conditions in Beiyangzhuang coalmine are complex.

Figure 7.

Figure 7

Distribution of mining areas in Beiyangzhuang mine.

There is a central drainage pumping station and a freshwater pumping station at the bottom of the auxiliary shaft in Beiyangzhuang mine. The drainage capacity of the mine is 5080 m3/h. The mine is divided into four mining areas (Fig. 7). The drainage capacities of mining areas 1, 2, 3, and 4 are 800 m3/h, 1000 m3/h, 1200 m3/h, and 2000 m3/h, respectively. The remaining areas, including the main tunnels, have a drainage capacity of 5080 m3/h.

Optimal location method

According to the steps described in “Establishment of the set covering model” and “Solution procedures”, the set covering model of Beiyangzhuang Mine was established, and the greedy algorithm was used to solve it. The detailed steps are as follows:

  1. Establishment of mine tunnel topology.

    The topology of the mine tunnels was established using the mine excavation engineering and mine tunnel traverse points (1658 points) of the Beiyangzhuang mine. The tunnel nodes were interpolated to increase the number of nodes to 8761. The set of all nodes is expressed as N={0,1,2,3,,8760}.

  2. The spreading scope of water inrush.

    The value of water inrush for mining areas 1, 2, 3, and 4 were set to 800 m3/h, 1000 m3/h, 1200 m3/h, and 2000 m3/h. Similarly, the value for the remaining areas was set to 5080 m3/h. The water inrush process was simulated at all nodes using SWMM. The spreading scope of each node was obtained by processing the simulation data. For example, four of these results are shown in Fig. 8.

  3. Determination of monitoring scope.

    The monitoring scopes of all nodes are represented as M, such that
    M=M0,M1,M2,,Mjj=0,1,2,,8760.

    M can be obtained on the basis of the spreading scopes of all the nodes. Four of the monitoring scopes are shown in Fig. 9.

    Then the set covering model can be expressed as below:

    Selecting the smallest number of monitoring scopes Mj from M to “cover” the set N.

  4. Computer solutions

    According to the procedure in “Solution procedures”, the set covering model of Beiyangzhuang mine was solved using the greedy algorithm by Python.

Figure 8.

Figure 8

The spreading scopes of water inrush at four nodes.

Figure 9.

Figure 9

The monitoring scopes of water level sensors at four nodes.

Results

The number and positions of water level sensors were obtained using the optimal location method, and the result is shown in Fig. 10. There are 22 water level sensors, numbered from M1 to M22. In the results, only 6 water level sensors are located at the junctions of mine tunnels, and the remaining 16 sensors are located near local low points. The main factors affecting the selected optimal locations are the trends in the fluctuation of the tunnel height and local low-lying areas. Tunnel intersections have little influence on the optimal locations.

Figure 10.

Figure 10

Optimal location result of water level sensors in Beiyangzhuang mine.

The number (n) and locations of water levels sensors in different given time T are shown in in Fig. 11.

Figure 11.

Figure 11

The number (n) and locations of water level sensors in different given time T.

Discussions

In order to compare with the traditional monitoring method, the 1507 working face of Beiyangzhuang Mine was selected as the test site, and the elevation change of the tunnels’ floor was represented by gradient color, as shown in Fig. 12.

Figure 12.

Figure 12

The 1507 working face in the Beiyangzhuang Mine.

We intercepted the location results of 1507 working face from Fig. 11b, as shown in Fig. 13a. The two water level sensors installed are directly connected to the mine industrial ring network, and the monitoring data are transmitted to the ground host in real time; The traditional monitoring scheme is mainly to install a high-power drainage pump at the low-lying part of the cut of the working face, and discharge the mine water through the drainage pipe hanging on the coal wall. An ultrasonic flowmeter is installed at the outlet of the drainage pipe to monitor the drainage volume in the drainage pipe, as shown in Fig. 13b. The ultrasonic flowmeter is directly connected to the mine industrial ring network, and the monitoring data is transmitted to the ground host in real time.

Figure 13.

Figure 13

The results of location selection by the two monitoring methods.

Through the previous elaboration, it can be known that the location scheme of the water level sensor shown in Fig. 13a can monitor the water disasters of the entire working face within 20 min, and the monitoring scopes are shown in Fig. 14. The two water level sensors in this scheme are installed in the drainage ditch of the tunnels, and it monitors the depth of the water flow in the tunnels of the 1507 working face. Since the two water level sensors are directly connected to the industrial ring network, there is almost no delay in the transmission of monitoring data. The optimal location method can not only accurately calculate the monitoring scope of the water level sensor at different positions, but also inversely calculate the required monitoring response time T according to different location schemes.

Figure 14.

Figure 14

The monitoring scopes of the two water level sensors at 1507 working face.

In the traditional method of monitoring the 1507 working face shown in Fig. 13b, after a water disaster occurs, only when the drain pump is started can the accumulated water be pumped into the drainage pipeline. After the drain pump is started for a period of time, the ultrasonic flowmeter installed at the end of the drainage pipe can monitor the change of the drainage volume. This method cannot measure the monitoring scope of the ultrasonic flowmeter. Furthermore, due to the start-up time of the drain pump and the length of the drainage pipeline, the ultrasonic flowmeter cannot get the change of water disasters in the working face in time, so the monitoring response time T is unpredictable.

From the above discussion, it can be concluded that the optimal location method has greater advantages in timeliness and monitoring scope compared with the traditional method.

Reliability verifications

Monitoring scope

The monitoring scope of each water level sensor is displayed in Fig. 15 in the form of its smallest peripheral polygon to verify whether the water level sensors are able to monitor the entire mine. As can be seen, the combined monitoring scope of the water level sensors covers the whole mine.

Figure 15.

Figure 15

Reliability verification of the monitoring scope of the located water level sensors.

Monitoring response time

In order to test whether a water inrush accident can be monitored within the monitoring response time (60 min) based on the above location of water level sensors, the water inrush process was simulated at 20 randomly selected positions, as shown in Fig. 16b. The results show that water inrush at the above locations is monitored successfully within 60 min by the configuration of water level sensors (Fig. 16a).

Figure 16.

Figure 16

Reliability verification of the monitoring response time.

Conclusions

The development of information techniques makes it possible to monitor the occurrence and evolution of water inrush. In this paper, a new problem is introduced to arrange water level sensers to monitor water inrush that may occur in the whole range of the mine. An optimal location method is proposed to minimize the number of arranged sensors. In this process, the topology of mine tunnels is established based on the distribution of mine excavation projects and mine tunnels’ traverse points. Then, the SWMM software is used to simulate water spreading in mine tunnels.

  1. A set covering model is constructed by computing the monitoring scope of the water level sensor at each location along mine tunnels. The monitoring scope is obtained from the simulated water spreading using the SWMM.

  2. In the simulation of water spreading, the mine drainage capacity is used as the water inrush quantity. A greater quantity may cause water inrush disaster. Also, different drainage capacity is considered in different positions along mine tunnels.

  3. Then, the greedy algorithm can be used to solve the set covering model. This method was used to optimize the location of water level sensors in the Beiyangzhuang coal mine. The results show that at least 22 water level sensors are needed to monitor water disasters in the whole mine within 60 min. And the minimum number of water level sensors required within 30, 20, 10 and 5 min is 36, 42, 64 and 106, respectively.

In the following researches, the damage and movement of water level sensors will be considered.

Acknowledgements

This research was financially supported by China National Natural Science Foundation (41430318, 41572222, 41877186, 41602262, 41702261), National Key R&D Program of China (2016YFC0801800), Beijing Natural Science Foundation (8162036), Fundamental Research Funds for the Central Universities (2010YD02), Innovation Research Team Program of Ministry of Education (IRT1085), and State Key Laboratory of Coal Resources and Safe Mining.

Author contributions

Conceptualization—Q.W. and Z.D.; investigation—Z.D. and X.Z.; writing—original draft preparation—Z.D.; review and editing—Q.W., Y.Z. and H.X.

Competing interests

The authors declare no competing interests.

Footnotes

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Sun W, Zhou W, Jiao J. Hydrogeological classification and water inrush accidents in China’s Coal Mines. Mine Water Environ. 2016;35:214–220. doi: 10.1007/s10230-015-0363-3. [DOI] [Google Scholar]
  • 2.Wei J, et al. Formation and height of the interconnected fractures zone after extraction of thick coal seams with weak overburden in western China. Mine Water Environ. 2017;36:59–66. doi: 10.1007/s10230-016-0396-2. [DOI] [Google Scholar]
  • 3.Qi Y, Li M, Li K, Yeh TCJ. Spatiotemporal development of mine water inrush and its mechanism—a case study in Ganhe coal mine, Shanxi, China. Arab. J. Geosci. 2017;10:433. doi: 10.1007/s12517-017-3216-5. [DOI] [Google Scholar]
  • 4.Wu Q, Guo X, Shen J, Xu S, Liu S, Zeng Y. Risk assessment of water inrush from aquifers underlying the Gushuyuan coal mine, China. Mine Water Environ. 2017;36:96–103. doi: 10.1007/s10230-016-0410-8. [DOI] [Google Scholar]
  • 5.Wu Q, et al. Source discrimination of mine water inrush using multiple methods: A case study from the Beiyangzhuang Mine, Northern China. Bull. Eng. Geol. Environ. 2019;78:469–482. doi: 10.1007/s10064-017-1194-1. [DOI] [Google Scholar]
  • 6.Yin H, Zhou W, LaMoreaux JW. Water inrush conceptual site models for coal mines of China. Environ. Earth Sci. 2018;77:746. doi: 10.1007/s12665-018-7920-6. [DOI] [Google Scholar]
  • 7.National Coal Mine Safety Administration. Detailed Rules for Coal Mine Water Prevention and Control (2018).
  • 8.Gao W, Shi L, Han J, Zhai P. Dynamic monitoring of water in a working face floor using 2D electrical resistivity tomography (ERT) Mine Water Environ. 2018;37:423–430. doi: 10.1007/s10230-017-0483-z. [DOI] [Google Scholar]
  • 9.Jin D, Zheng G, Liu Z, Liu Y, Pang X. Real-time monitoring and early warning techniques of water inrush through coal floor. Proced. Earth Planet Sci. 2011;3:37–46. doi: 10.1016/j.proeps.2011.09.063. [DOI] [Google Scholar]
  • 10.Parvasi SP, Tavakkoli-Moghaddam R, Bashirzadeh R, Taleizadeh AA, Baboli A. Designing a model for service facility protection with a time horizon based on tri-level programming. Eng. Optim. 2020;52:90–105. doi: 10.1080/0305215X.2019.1577408. [DOI] [Google Scholar]
  • 11.Zubelzu S, Rodríguez-Sinobas L, Segovia-Cardozo D, Díez-Herrero A. Optimal locations for flow and velocity sensors along a river channel. Hydrol. Sci. J. 2019;65:800–812. doi: 10.1080/02626667.2019.1654610. [DOI] [Google Scholar]
  • 12.Kong W, Luo Y, Feng G, Li K, Peng H. Optimal location planning method of fast charging station for electric vehicles considering operators, drivers, vehicles, traffic flow and power grid. Energy. 2019;186:115826. doi: 10.1016/j.energy.2019.07.156. [DOI] [Google Scholar]
  • 13.Paul JA, MacDonald L. Location and capacity allocations decisions to mitigate the impacts of unexpected disasters. Eur. J. Oper. Res. 2016;251:252–263. doi: 10.1016/j.ejor.2015.10.028. [DOI] [Google Scholar]
  • 14.Afshar A, Mariño MA. Multi-objective coverage-based ACO model for quality monitoring in large water networks. Water Resour. Manag. 2012;26:2159–2176. doi: 10.1007/s11269-012-0008-2. [DOI] [Google Scholar]
  • 15.Gelareh S, Nickel S. Hub. location problems in transportation networks. Transport Res. E-Log. 2011;47:1092–1111. doi: 10.1016/j.tre.2011.04.009. [DOI] [Google Scholar]
  • 16.Melo MT, Nickel S, Saldanha-da-Gama F. Facility location and supply chain management: A review. Eur. J. Oper. Res. 2009;196:401–412. doi: 10.1016/j.ejor.2008.05.007. [DOI] [Google Scholar]
  • 17.Balcik B, Beamon BM. Facility location in humanitarian relief. Int. J. Logist. Res. Appl. 2008;11:101–121. doi: 10.1080/13675560701561789. [DOI] [Google Scholar]
  • 18.Hakimi SL. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 1965;13:462–475. doi: 10.1287/opre.13.3.462. [DOI] [Google Scholar]
  • 19.Roth R. Computer solutions to minimum-cover problems. Oper. Res. 1969;17:455–465. doi: 10.1287/opre.17.3.455. [DOI] [Google Scholar]
  • 20.Toregas C, Swain R, ReVelle C. The location of emergency services facilities. Oper. Res. 1971;19:1363–1373. doi: 10.1287/opre.19.6.1363. [DOI] [Google Scholar]
  • 21.White JA, Case KE. On covering problems and the central facilities location problem. Geogr. Anal. 1974;6:281–293. doi: 10.1111/j.1538-4632.1974.tb00513.x. [DOI] [Google Scholar]
  • 22.Vasko FJ, Wilson GR. Hybrid heuristics for minimum cardinality set covering problems. Nav. Res. Logist. 1986;33:241–249. doi: 10.1002/nav.3800330207. [DOI] [Google Scholar]
  • 23.Bianchi G, Church R. A hybrid fleet model for emergency medical service system design. Soc. Sci. Med. 1988;26:163–171. doi: 10.1016/0277-9536(88)90055-X. [DOI] [PubMed] [Google Scholar]
  • 24.Osleeb JP, McLafferty S. A weighted covering model to aid in dracunculiasis eradication. Pap. Reg. Sci. 1992;71:243–257. doi: 10.1007/BF01434266. [DOI] [Google Scholar]
  • 25.Schilling DA, Jayaraman V, Barkhi R. A review of covering problem in facility location. Locat. Sci. 1993;1:25–55. [Google Scholar]
  • 26.Serra D. The coherent covering location problem. J. Reg. Sci. Assoc. Int. 1996;75:79–101. doi: 10.1007/BF02406961. [DOI] [Google Scholar]
  • 27.Yehuda R. Using homogeneous weights for approximating the partial cover problem. J. Algorithms. 2001;39:137–144. doi: 10.1006/jagm.2000.1150. [DOI] [Google Scholar]
  • 28.Solar M, Parada V, Urrutia R. A parallel genetic algorithm to solve the set covering problem. Comput. Oper. Res. 2002;29:1221–1235. doi: 10.1016/S0305-0548(01)00026-0. [DOI] [Google Scholar]
  • 29.Yagiura M, Kishida M, Ibaraki T. A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 2006;172:472–499. doi: 10.1016/j.ejor.2004.10.018. [DOI] [Google Scholar]
  • 30.Fallah H, Naimi Sadigh A, Aslanzadeh M. FacilityLocation: Concepts, Models, Algorithms and Case Studies. Heidelberg: Physica Verlag; 2009. Covering problem. [Google Scholar]
  • 31.Farahani RZ, Asgari N, et al. Covering problems in facility location: A review. Comput. Ind. Eng. 2012;62:368–407. doi: 10.1016/j.cie.2011.08.020. [DOI] [Google Scholar]
  • 32.Schneeberger K, et al. Ambulance location and relocation models in a crisis. Cent. Eur. J. Oper. Res. 2016;24:1–27. doi: 10.1007/s10100-014-0358-3. [DOI] [Google Scholar]
  • 33.Jánošíková Ľ, Kvet M, Jankovič P, Gábrišová L. An optimization and simulation approach to emergency stations relocation. Cent. Eur. J. Oper. Res. 2019;27:737–758. doi: 10.1007/s10100-019-00612-5. [DOI] [Google Scholar]
  • 34.Wu JY, Thompson JR, Kolka RK, Franz KJ, Stewart TW. Using the storm water management model to predict urban headwater stream hydrological response to climate and land cover change. Hydrol. Earth Syst. Sci. Discuss. 2013;10:7091–7126. [Google Scholar]
  • 35.Peterson EW, Wicks CM. Assessing the importance of conduit geometry and physical parameters in karst systems using the storm water management model (SWMM) J. Hydrol. 2006;329:294–305. doi: 10.1016/j.jhydrol.2006.02.017. [DOI] [Google Scholar]
  • 36.Zhao Y, Wu Q, Chen T, Zhang X, Yao Y. Location and flux discrimination of water inrush using its spreading process in underground coal mine. Saf. Sci. 2020;124:104566. doi: 10.1016/j.ssci.2019.104566. [DOI] [Google Scholar]
  • 37.Gomes FC, Meneses CN, Pardalos PM, Viana GVR. Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Eur. J. Oper. Res. 2006;33:3520–3534. [Google Scholar]
  • 38.Ying KC, Lin SW, Huang CY. Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst. Appl. 2009;36:7087–7092. doi: 10.1016/j.eswa.2008.08.033. [DOI] [Google Scholar]
  • 39.Guangquan L, Ying X, Chuan D, Yunpeng W, Zhong-Ke G. An optimal schedule for urban road network repair based on the greedy algorithm. PLoS One. 2016;11:e0164780. doi: 10.1371/journal.pone.0164780. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 40.Zhang T, Zeng Q, Zhao X. Optimal local dimming based on an improved greedy algorithm. Appl. Intell. 2020;50:7. [Google Scholar]

Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES