Research Article  Open Access
Guangwei Yan, Dandan Feng, "EscapeRoute Planning of Underground Coal Mine Based on Improved Ant Algorithm", Mathematical Problems in Engineering, vol. 2013, Article ID 687969, 14 pages, 2013. https://doi.org/10.1155/2013/687969
EscapeRoute Planning of Underground Coal Mine Based on Improved Ant Algorithm
Abstract
When a mine disaster occurs, to lessen disaster losses and improve survival chances of the trapped miners, good escape routes need to be found and used. Based on the improved ant algorithm, we proposed a new escaperoute planning method of underground mines. At first, six factors which influence escape difficulty are evaluated and a weight calculation model is built to form a weighted graph of the underground tunnels. Then an improved ant algorithm is designed and used to find good escape routes. We proposed a tunnel network zoning method to improve the searching efficiency of the ant algorithm. We use maxmin ant system method to optimize the meeting strategy of ants and improve the performance of the ant algorithm. In addition, when a small part of the mine tunnel network changes, the system may fix the optimal routes and avoid starting a new processing procedure. Experiments show that the proposed method can find good escape routes efficiently and can be used in the escaperoute planning of large and medium underground coal mines.
1. Introduction
In mining, water, fire, gas, and other natural disasters often occur. The disasters have a heavy effect to mines’ safety production. Statistics show the coal mine industry has the most serious casualty accidents in China [1]. From 1991 to 2001, 86000 people died in coal mine accident, accounts for 85% of deaths in the mining industry. According to statistics in 2006–2008, in highrisk industries of China, the proportion of coal mine accidents and deaths equal 21.3% and 28.5%, respectively, top the list of industrial and mining business enterprises [2].
When mine disaster occurs, it is very important to find good escape routes. Escape routes planning can be realized based on computers, sensor networks, and relevant data. This problem had been studied at home and abroad, literature [3–7] use the Dijkstra algorithm or its improved algorithm to solve the problem. These algorithms are different in time complexity, space complexity, and so forth. The Dijkstra algorithm has three shortages. First, large amounts of calculation are required when number of network nodes and edges reaches several hundred, because these algorithms usually need to traverse all vertices of the network. Second, the Dijkstra algorithm only obtains the best route and in fact the secondbest route is needed sometimes. Third, the Dijkstra algorithm is static, if mine states change, it needs to be recalculated.
Put forward by Italian scholar Dorigo et al., the ant algorithm [8] is a new heuristic evolutionary algorithm. Biological ant colony can produce a chemical substance called pheromone for communication and coordination of ants. Pheromone can form positive feedback and make individual ants gradually gathered in the shortest route between the food source and the nest. The algorithm has advantages of strong robustness, distributed computing, positive feedback mechanism and it is easy to combine with other algorithms. When solving the shortest route in largescale network, it has excellent feasibility and adaptability.
In this paper, factors which influence passing difficulty in tunnels are led into. Based on these factors and the actual lengths of the tunnels, equivalent lengths of the tunnels are calculated and acted as weights of the underground tunnel graph. This graph acts as the input of the improved ant algorithm.
In this paper, an important improvement to the ant algorithm is introducing tunnel zoning. Underground mine networks include many faces and main tunnels. This paper divides all mine zones into two types: the backbonezone and the nonbackbonezone . The backbonezone is the main searching area, containing backbone tunnels and the safety point. The nonbackbonezone containing several zones, each face is a nonbackbonezone. They connect to the main road (See Figure 2). By zoning the weighted graph of tunnels, the ants’ behaviors can be affected and the searching efficiency can be improved.
The experimental results in this paper show the improved algorithm are suitable for escape routes planning of large and medium sized mines.
2. System Framework
To calculate the optimal escape routes in underground mines, tunnels’ status and data should be provided. And these can be obtained by sensor network in tunnels. In different mine disasters, factors that influence men passing difficulty of the tunnel are various and complex. Based on methods proposed by literature [9, 10], these factors are generalized for six classes including tunnel type, wind speed, tunnel slope, particle concentrations, crowded degree, and special factors related with mine disaster. Firstly, these factors are converted to tunnel equivalent length according to the formula (1). Secondly, a graph denoted by is built based on the tunnel network topology and the normalized tunnel equivalent lengths which act as the graph weights. Thirdly, a group of underground workers is set as node and a safety point or exit point is set as in . Finally, improved ant algorithm is used to plan the optimal route and several alternative routes between the terminals in . The system implementation framework is shown in Figure 1.
3. Calculation of Tunnel Weights
3.1. Calculation of Tunnel Equivalent Length
Status of underground tunnels are various and complex. Factors influencing passing difficulty of tunnels are generalized for six classes including tunnel type, wind speed, tunnel slope, particle concentrations, crowded degree, and special factors related to mine disasters. These factors influence people’s escape speed and they can increase or decrease the escape speed . The influences of these factors to the escape speed are transformed to the tunnels’ equivalent length. The smaller the value of the speed is, the longer the tunnel equivalent length is and vice versa. Formula (1) gives the calculation method of the tunnel equivalent lengths. And these equivalent lengths are as weights of the graph after normalizing:
In (1), indicates the actual length of the tunnel and is the equivalent length of the tunnel are tunnel type influence coefficient, tunnel wind speed influence coefficient, tunnel slope influence coefficient, tunnel particle concentrations influence coefficient, tunnel crowded degree influence coefficient, special factors related to mine disasters influence coefficient of the tunnel , respectively. Below we explain the relationship of these coefficients and the escape speed .
We denote the people’s normal walking speed by . Under the influence of the tunnel type coefficient, the people escape speed equals to . These six coefficients are independent, and under their common influence, the escape speed equals to . Through formula (1), we can know the escape time (which equals to ) also equals to . Below we will explain in detail how these coefficients are calculated and how they influence the escape speed separately.
3.1.1. Tunnel Type Influence Coefficient
Underground tunnels can generally be divided into working surface, transport tape lane, contact lane, rail lane, shaft, air leakage branch, and ventilation borehole, in which the air leakage branch and the ventilation borehole are forbidden for people to pass. Tunnel type may influence the people’s escape speed. For example, in the rail lane, the passing speed is equal to the speed of transportation tool. Formula (2) gives the calculating method of the tunnel type influence coefficient.
The parameter represents the speed of the transformation tool. People’s moving speed equals to the speed of the vehicle when people are in the vehicle. When the value of is greater than the value of , the value of is smaller than 1. And this indicates the equivalent length of the tunnel will decrease according to the formula (1) and the people will spend less time to pass through the tunnel.
3.1.2. Wind Speed Influence Coefficient
The mine networks is a thorough ventilation system itself. Generally in the total return lanes the wind speed is big. The wind speed may influence people’s escape speed.
It influence degree is in direct ratio with the actual roadway length. We assume the human’s walking power is constant and denote it by , and only taking stable states into account, we can derive the formula under against wind situation as follows: where is the power of the humanand is the normal human walking speed without any outside influence. And is the power of wind and is the human’s speed after affected by wind.
Assume the person is a cuboid object, and can be derived from the Bernoulli’s equation [11]:
The parameter is a resistance coefficient, experience shows that it is related to the Reynolds number; is the density of the gas; is the touching surface area between the human body and the wind; is the wind speed in the current roadway.
This paper concludes (5) from (3) and (4):
The wind speed influence coefficient under against wind situation is shown as
Similarly, the coefficient under following wind situation is shown as follows:
Formula (7) has a limitation: when the wind speed is too big, this formula is not applicable.
3.1.3. Tunnel Slope Influence Coefficient
Tunnel gradient influences the peoples’ walking speed. The greater the slope is, the greater the resistance is. With the same analysis method as Section 3.1.2, we get the formula as follows under climbing situation: where is the standard human mass, is the gravity acceleration, is the current tunnel’s angle of slope. The tunnel upslope influence coefficient can be represented as follows:
When workers pass down slope tunnels, we assume their speed will still be (i.e., ).
The parameter values in Sections 3.1.2 and 3.1.3 are shown in Table 1.

3.1.4. Tunnel Particle Concentrations Influence Coefficient
Tunnel particle concentrations mainly include tunnel visibility, the height between the gas critical layer and the floor. They have important effects on the walking speed of people who are escaping [12]. This coefficient is denoted by , and its calculation method is
In (10), is the effecting coefficient of the height of gas layer and its empirical value is shown in Table 2 [12]; is the affecting coefficient of visibility; its empirical value is shown in Table 3.


3.1.5. Tunnel Crowded Degree
The denseness of the crowd affects the walking speed to some extent. Thompson proposed a speed calculation method which utilized the crowd denseness factor in Simulex model [13]. This method can be expressed as a coefficient calculation formula as follows:
In (11), represents the body interval between people, here the body interval means the distance from one person’s body center to another person’s body center (we assume the people have the same height); represents the upper limit of the moving constraint interval; represents the size of the body in horizontal direction.
3.1.6. Special Factors Related to Mine Disaster Influence Coefficient
In order to create a simple and unified mathematical model for various tunnel disasters, we consider special factors related to mine disaster, which refers to the extreme cases of different tunnel disasters, denoted by . Its value is in , and 1 indicates that this tunnel is normal and there is not exist mine disaster’s influence, and means this tunnel cannot be passed. There are a lot of factors which can cause the tunnel cannot be passed, for example:(1)there is serious landslide in the tunnel and people cannot go through it.(2)There exists high temperature (or large amount of smoke, toxic gas) in the tunnel, people cannot bear it.(3)There is flood in the tunnel and the water height is more than people’s bear limitation.
3.2. The Normalization of Tunnel Weights
According to the above calculation model, the tunnel equivalent length’s range is , in which indicates that the tunnel cannot be got through. For the convenience of data processing, the data is mapped to range . The linear mapping is used as follows:
In which refers to the minimum equivalent length of all tunnels’, is the maximum equivalent length of all tunnels’ (except for the length value ). This function means the closer to 0 the values after mapping is, and the easier to pass through it. When the value is 1, it means the tunnel cannot be passed.
Based on calculated weights and the tunnel topology graph , the following improved ant algorithm can do a good route planning processing.
4. Searching the Optimal Escape Routes with Improved Ant Algorithm
This paper presents an improved ant algorithm which can quickly and effectively find the best route and several sub optimal routes from (the trapped personnel position) to (the safety point) in the tunnel network. There are two improvements to the ant algorithm: firstly, tunnel zoning characteristics are used to influence the ants’ behaviors and improve the searching efficiency of ants; secondly, the strategy of meeting of ants and the ant death rules are modified to improve the ant algorithm’s performance.
4.1. Calculation Steps of the Improved Ant Algorithm
Basic steps of the improved ant algorithm are as follows.
Step 1. Based on the above tunnel weights calculation model, weighted graph is built. The trapped personnel position is denoted by and the exit point (safety point) is denoted by in graph . The zoning attribute information is loaded.
Step 2. Initializes the ant algorithm’s parameters including , , , , the pheromone trail matrix and the ant routes record table, and so forth; assigns the zoning number to each node according to the zoning attribute information acquired; arranges the ants’ position with the distribution requirements of Section 4.2.
Step 3. In the graph , every ant is constructed an accessible node set in accordance with the moving rules in Section 4.2, and the tunnel zoning may influence the ants’ accessible node set. The ant selects the next node by formula (14), and puts the selected node into its route record. After every live ant has selected a node, the system will judge whether the ant is dead or not (based on the rules described in Section 4.3). The procedure is repeated until all ants are dead and by this manner an iteration step is finished. The whole ant algorithm calculating procedure requires times iteration.
Step 4. Updates the pheromone trail matrix and the parameter , in accordance with the update rules in Section 4.4. Records the optimal route and alternative routes in this iteration, and denotes it by ( is the number of current iteration; ; indicates the optimal route). According to the information of the current underground tunnels, weighted graph is reconstructed. The change rate of is calculated according to the formula (19). If is less than a small constant , it changes optimal routes of all executed iterations if these routes contain changed tunnels. If is greater than , a new ant algorithm is restarted (go to Step 1).
Step 5. Initializes ant routes recording table; fixes and controls pheromone trail matrix by the MMAS method; updates parameter as (). If current ’s value is less than , go to Step 2.
Step 6. From the records of the iterations’ routes (, , ), select the optimal route and suboptimal routes for the current underground trapped workers.
4.2. Ants’ Distribution and Moving Rules
The and nodes of the graph are set ants separately. For the ant , its current node ’s accessible nodes set is built as
In (13), if the node is in the backbone zone or expected zone , ’s value is 1, else ’s value is 0. The set is {nodes the node which connected with node }, and the set is {nodes the node that the ant has passed}, and the set is {nodes the node which does not belong to zone and zone }. Through the use of the set , unnecessary detour can be avoided and the searching efficiency can be improved.
In accordance with the probability value calculated through (14), the ant selects the next node in . Formula (14) is described as follows:
In (14), , are factors of importance of the pheromone trail and the heuristic function respectively. And , are pheromone trail concentration and weights respectively from the node to the node . The heuristic function is defined as weights between the current nodes.
4.3. The Rules of Meeting and Death of Ants
Every ant has attributes of a start node and an expected node. There are two improvements in meeting and death strategy showed in rule (2) and (4).
These rules are as follows.(1)If there is no way for the ant, the ant dies and is marked with no available route status.(2)When two ants meet, if the expecting point of one ant and the start point of the other ant intersect, the ant having short route gives its route to another, and then the latter dies and is marked with an available route status. The former moves on.(3)If the ant reaches the expected point, the ant dies and is marked with an available route status. (4)Sets a physical power parameter to the trapped workers group and denotes it as which will reduce gradually. The parameters are assigned to ants. The ant will die when of the ant is reduced to zero no matter what status the ant is in and then it is marked with no available route status.
4.4. Update of Pheromone Trail and Main Parameters
When one iteration processing is completed, the pheromone matrix and the parameter and need to be updated. To prevent premature problem, the MMAS method [10] is used in the pheromone updating procedure. After an iteration processing, only the pheromone of this iteration optimal route is updated, according to (15) and (16). In addition, in order to improve the convergence of the later iteration and the early intelligence, factors and are dynamically changed at a fixed length between two iterations. At the later stage, acts as the major factor; at the early stage, acts as the major factor. See (17) and (18):
Formula (15) gives the pheromone relationship between the iteration () and the iteration , and is the volatile factor of the pheromone, and is the incremental pheromone.
Formula (16) is built based on MMAS strategy, only if the is in the optimal route of the iteration, the pheromone of the is updated. is the length of the current optimal route.
In (17), is the maximum of, and is the minimum of , is the total iteration number. The meaning of formula (18) is similar to the meaning of formula (17).
4.5. Condition of the Algorithm Stopping
When one iteration calculation is completed, according to current information, underground tunnel diagram is reconstructed, and the diagram’s change rate can be represented as
In (19), indicates the changing number of arcs between of iteration and the original , and indicates the total number of arcs of the original diagram.
When is less than the small value , weights of the related arcs in the optimal routes of executed iterations are updated. Under this situation, the optimal length of executed iterations changes, but the order of passed node does not change. When is more than , current calculation is stopped and a new algorithm calculation is restarted.
5. Implementation of the Algorithm and the Experimental Results
5.1. Parameter Setting
Different , , parameter values have different influence to the stability and convergence of the ant algorithm. Based on literature [14] and relative experiments, to an underground tunnel network which has 210 tunnels and 147 nodes, these parameters’ values are set in Table 4.

5.2. Experiment Data
The underground tunnel data come from a large sized coal mine in China. Partial data are showed in Table 5.

In Table 5, some simulated factors (such as slope, tunnel particle concentrations influence, tunnel crowded degree and special factors influence) are created based on original data. The network topology of the mine and its zoning result is shown in Figure 2.
The Matlab tool is used to realize the data processing and the ant algorithm. The node 83 is set as and the node 1 is set as . The iteration curve of the ant algorithm is shown in Figure 3.
In Figure 3, the axis represents the number of iterations, and the ordinate represents the minimum cost of the current iteration. The cost is the sum of arc weights in the optimal route of the current iteration. From the chart we can see the algorithm has better convergence ability: after three convergences the global optimal route is found in 100 iterations about.
The algorithm procedure loads related parameters and experimental data firstly and then does calculation. Five calculation results are shown in Table 6. The experimental data is showed in Table 7.


In Table 6, what in small brackets is the sequence of passed nodes. To observe the calculated routes intuitively, the first running result is marked in Figure 2. The red line indicates the optimal route, and the green line is the first alternative route and the blue line is the second alternative route.
In fact, through the manual calculation we know the shortest cost between node 83 and node 1 is 0.42799 and the route is . From results in Table 6 we can see the best route is found steadily, meanwhile, two alternative routes are found but not stable.
6. Conclusion
An improved ant algorithm is proposed in this paper to solve the escape routes planning problem of underground coal mines. A simple unified tunnel weights calculation model is designed, which considers various impact factors. By the tunnel zoning method, searching efficiency of the ant algorithm has been improved effectively. The MMAS method is used to optimize the meeting strategy to improve the performance of the ant algorithm. In the algorithm’s processing procedure, when small part of mine networks changes, the system may fix the optimal routes and avoid starting a new processing procedure. The algorithm was achieved in the Matlab platform and the best route was worked out steadily. The algorithm obtained good results when treating the data of a large coal mine of China. The proposed algorithm can be used in underground mine disaster rescue.
References
 L. Yun, “Current safety situation analysis in china,” China's Development Observer, vol. 1, no. 3, pp. 33–37, 2005. View at: Google Scholar
 State Administration of Work Safety, “The national production safety supervision and administration bureau dispatching statistics 2006–2008,” pp. 40–41, 2009. View at: Google Scholar
 L. Shuling, “The confirmation of the best route for evading accident under the pit,” Journal of LiaoNing Technical University, vol. 18, no. 1, pp. 27–29, 1999. View at: Google Scholar
 S. Jia, S. Diange, and J. Zhong’an, “The improvement of Dijkstra algorithm used for choosing the best escape route in mine's emergency response,” China Mining Magazine, vol. 14, no. 6, pp. 46–48, 2005. View at: Google Scholar
 H. Yunbing, X. Xing, Y. Xu et al., “Improved shortest path algorithm based on mine geographic network model,” Coal Science and Technology, vol. 39, no. 2, pp. 103–105, 2011. View at: Google Scholar
 Y. Wanqing, D. heng, and H. Jiejun, “Mine safety relief system based on the improved Dijkstra algorithm,” Mining Safety & Environmental Protection, vol. 35, no. 3, pp. 40–44, 2008. View at: Google Scholar
 S. E. Jalali and M. Noroozi, “Determination of the optimal escape routes of underground mine networks in emergency cases,” Safety Science, vol. 47, no. 8, pp. 1077–1082, 2009. View at: Publisher Site  Google Scholar
 M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 26, no. 1, pp. 29–41, 1996. View at: Publisher Site  Google Scholar
 D. Jiping, Mining, Chinese Mining University Press, 2009.
 W. Deming, “Selecting the optimum escape routes by a computer during a mine fire,” Journal of China University of Mining & Technology, vol. 23, no. 3, pp. 27–32, 1994. View at: Google Scholar
 Y. Liao, Fluid Mechanics, China Railway, Beijing, China, 1987.
 Z. Yunming, “Study on safe evacuation with performancebased analytical method in public gathering place,” Journal of Safety Science and Technology, vol. 7, no. 10, pp. 70–74, 2011. View at: Google Scholar
 P. Thompson and E. Marehant, “A computer model for the evacuation of large building populations,” Fire Safety Journal, vol. 24, no. 2, pp. 131–148, 1995. View at: Publisher Site  Google Scholar
 T. Stützle and H. H. Hoos, “Max–Min Ant system,” Future Generation Computer Systems, vol. 16, no. 8, pp. 889–914, 2000. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Guangwei Yan and Dandan Feng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.