the Creative Commons Attribution 4.0 License.
the Creative Commons Attribution 4.0 License.
The adaptive particle swarm optimization technique for solving microseismic source location parameters
HongMei Sun
JianZhi Yu
XingLi Zhang
BinGuo Wang
An intelligent method is presented for locating a microseismic source based on the particle swarm optimization (PSO) concept. It eliminates microseismic source locating errors caused by the inaccurate velocity model of the earth medium. The method uses, as the target of PSO, a global minimum of the sum of squared discrepancies between differences of modeled arrival times and differences of measured arrival times. The discrepancies are calculated for all pairs of detectors of a seismic monitoring system. Then, the adaptive PSO algorithm is applied to locate the microseismic source and obtain optimal value of the Pwave velocity. The PSO algorithm adjusts inertia weight, accelerating constants, the maximum flight velocity of particles, and other parameters to avoid the PSO algorithm trapping by local optima during the solution process. The origin time of the microseismic event is estimated by minimizing the sum of squared discrepancies between the modeled arrival times and the measured arrival times. This sum is calculated using the obtained estimates of the microseismic source coordinates and Pwave velocity. The effectiveness of the PSO algorithm was verified through inversion of a theoretical model and two analyses of actual data from mine blasts in different locations. Compared with the classic least squares method (LSM), the PSO algorithm displays faster convergence and higher accuracy of microseismic source location. Moreover, there is no need to measure the microseismic wave velocity in advance: the PSO algorithm eliminates the adverse effects caused by error in the Pwave velocity when locating a microseismic source using traditional methods.
 Article
(351 KB)  Fulltext XML
 BibTeX
 EndNote
Microseismic monitoring technology can be used for effectively locating rock ruptures caused by rock burst, coal and gas outbursts, water inrush, and other coal mine disasters. In recent years it was also used in early warning systems (Li et al., 2016; Pastén et al., 2015; Jia et al., 2015). The spatial coordinates of monitoring stations and the arrival times of the first seismic wave are used to determine the coordinates of the microseismic source, origin time, and other attributes. The accuracy of microseismic source location has been an important research topic in microseismic monitoring technology for a long time.
Current microseismic source location methods mostly come from seismology. Now they are widely used in microseismic monitoring (Sun et al., 2016; Xue et al., 2015; Anikiev et al., 2014; Dong and Li, 2013). The earthquake source location method, based on timedifference principles, was proposed (Geiger, 1912). Based on this work, Lienert et al. (1986) developed an improved algorithm called HYPOCENTER. Since then, Nelson and Vidale (1990) presented the Quake3D method for 3D velocity modeling. Lomax et al. (2000, 2001) worked out a nonlinear mode for locating global earthquakes in 3D media and developed NonLinLoc software. Waldhauser and Ellsworth (2000) presented an earthquake location algorithm based on a double difference and developed HypoDD software. After occurrence of characteristics of the coal mine overburden, namely layers and abscission zones, Gong et al. (2012) proposed a microseismic detecting algorithm for the isotropic velocity model along the mine length; the algorithm decreases source location errors. Dong et al. (2017) proposed mathematical algorithms of microseismic source location where there is no need to predict velocity in advance. The algorithms overcome location errors caused by errors of velocity measurement inherent in traditional location methods. Lin et al. (2010) analyzed the characteristics of the linear location method and Geiger method and proposed a joint method to address the problem of low precision in estimation of source coordinates inherent in the linear location method. Feng et al. (2015) proposed stratified methods for microseismic source location based on particle swarm optimization to obtain correlations among the source position, origin time, and microseismic propagation speed for a nonunique solution.
In conclusion we note that the microseismic source location accuracy is influenced by many factors, such as the location method, the layout of the microseismic network, the velocity model, and the accuracy of the arrivaltime measurement (Dong and Li, 2013). Among these, the key factor influencing the stability of the location algorithm and the location accuracy is precision of the velocity model (Prange et al., 2015; Li et al., 2014; Usher et al., 2013). In this paper, an adaptive particle swarm optimization algorithm is proposed for microseismic source location, which is based on average flying velocity of the particles. It uses, as the particle swarm optimization (PSO) target function, the least squares sum of measured arrivaltime differences for all pairs of seismic sensors and uses the PSO algorithm to identify the source coordinates and microseismic wave velocity. Then, the origin time of the microseismic event is calculated according to the source location just determined and the wave velocity. Parameters of the PSO algorithm, such as the inertia weight, the acceleration constants, and the flight velocities of particles, are adaptively adjusted to avoid the algorithm failure caused by the improper selection of these parameters. Careful dynamic adjusting of the PSO parameters improves the robustness of the PSO algorithm, reduces the number of iterations, and improves estimation of the microseismic source coordinates and the seismic wave velocity.
Suppose that there are n geophones in the microseismic monitoring system. Set the microseismic source location point to ${r}_{\mathrm{0}}=\left({x}_{\mathrm{0}},{y}_{\mathrm{0}},{z}_{\mathrm{0}}\right)$, the coordinates of each geophone to ${r}_{i}=\left({x}_{i},{y}_{i},{z}_{i}\right)$ and $\left(i=\mathrm{1},\mathrm{\dots},n\right)$, the time of Pwave arrival to the ith geophone of the microseismic monitoring system to t_{i}, and the origin time of the microseismic event to t_{0}. Assuming that the rock layers between the microseismic sources and the geophone are uniform (i.e., uniform velocity model), the equivalent average propagation velocity of the P wave in the medium is V. Then, the theoretical (regression) arrivaltime differences for i and j geophones are
where
The differences between the difference of regression arrival times Δt_{i,j}(r_{0}) and the difference of the measured arrival times $\mathrm{\Delta}{t}_{i,j}^{\prime}$ are analogous to the doubledifference concept introduced by Waldhauser and Ellsworth (2000). The sum of their squares reflect the degree of discrepancies between regression and observed arrival times. The equation for estimation of the microseismic source position has the form
The estimates of microseismic source coordinates ${\widehat{r}}_{\mathrm{0}}=\left({\widehat{x}}_{\mathrm{0}},{\widehat{y}}_{\mathrm{0}},{\widehat{z}}_{\mathrm{0}}\right)$ and equivalent Pwave velocity in the medium $\widehat{V}$ correspond to those values of ${r}_{\mathrm{0}}=\left({x}_{\mathrm{0}},{y}_{\mathrm{0}},{z}_{\mathrm{0}}\right)$ and V in Eq. (1) and Eq. (2), for which the function Q(r_{0},V) reaches a global minimum in the ranges of possible values of the microseismic source coordinates and medium equivalent velocity.
According to timedifference location principles, the equation for calculation of the source origin time t_{0} has the following form:
In the equation, ${t}_{i}^{\prime}$ denotes the measured travel times; for a case where signaltonoise ratios in observed signals from microseismic source are sufficiently high and the earth medium between the source and geophones is homogeneous to $\underset{{r}_{\mathrm{0}}}{min}F\left({t}_{\mathrm{0}}\right)\approx \mathrm{0}$, the estimate of the microseism origin time can be calculated as
In solving for the seismic source location and origin time, the estimates of source coordinates ${\widehat{r}}_{\mathrm{0}}=\left({\widehat{x}}_{\mathrm{0}},{\widehat{y}}_{\mathrm{0}},{\widehat{z}}_{\mathrm{0}}\right)$ and the equivalent wave velocity $\widehat{V}$ are obtained first, according to Eq. (2). Then, the estimate of the origin time is determined by substituting the estimated values ${\widehat{r}}_{\mathrm{0}}$ and $\widehat{V}$ into Eq. (3) (or in Eq. 4 for the case where $\underset{{r}_{\mathrm{0}}}{min}F\left({t}_{\mathrm{0}}\right)\approx \mathrm{0})$. Because Eq. (2) is a nonnegative function of (x_{0}, y_{0}, z_{0}) and V, a minimum $\underset{{r}_{\mathrm{0}},V}{min}Q\left({r}_{\mathrm{0}},V\right)$ always exists and can be found by the nonlinear fitting methods. The classic method is the minimum least squares solution. However, in this solution the source location estimate ${\widehat{r}}_{\mathrm{0}}$ correlates with the origintime estimate ${\widehat{t}}_{\mathrm{0}}$, and the algorithm has a slow convergence for the velocity V. It is also easy to get a nonunique solution (Chen et al., 2009). To overcome these problems, this paper introduces an adaptive PSO algorithm to optimize the solution process.
Source location based on the timedifference principle is a multiextremum nonlinear problem. The most popular method is the classical method proposed by Geiger (1912) and various improvements thereafter. This kind of method is a solution method in the linear category. According to Taylor's formula, the nonlinear problem is transformed into a linear problem, and then different strategies are adopted to solve the linear equation system. In many cases, such as those of a second order or more, this will appear. Problems such as in appropriate omitting of terms, unreasonable selection of initial values, and trapping solutions into local minima will occur (Lee and Stewart, 1981). The particle swarm optimization (PSO) method is simple to operate and easy to use, and it is easy to get the global optimal solution for multiextremum nonlinear problems. Therefore, the improved PSO method is introduced to solve the above problems.
3.1 PSO principle
The PSO is an evolutionary computation technique developed by Eberhart and Kennedy (1995). It is an evolutionary algorithm similar to a simulated annealing optimization algorithm for a problem of iterative improvement of a candidate for the solution with regards to a given measure of quality. PSO is an intelligent computational algorithm for analyzing the dynamic behavior of a swarm of particles. In comparison with other similar algorithms, PSO has such advantages as simple implementation, high accuracy, and fast convergence. It has been successfully applied in the field of optimization in recent years (Fong et al., 2016; Renaudineau et al., 2015; Sudheeret al., 2014). The basic PSO principles are as follows: PSO randomly initializes a set of particles in the solution space. Each particle flies through the solution space with a certain speed by following the current optimum particle, and the optimal solution is found through the search in successive generations. In each generation, the particles update themselves by tracking two types of extreme values: local optimums and global optimums. The first extreme values are the optimal values for every particle itself in a set of positions of this particle in the sequence of generations that already exist. They are denoted as pBest. The second optimum is the optimal value found in the all existing generations of the whole swarm of particles. It is denoted as gBest. After the two sorts of the optimal values are found, the particles update their speed and positions according to Eq. (5):
where m is the dimension of the particle space, n is a number of particles in the swarm, k is a number of the current evolutionary particle generation, r_{1} and r_{2} are independent random values within [0, 1], w^{(k)} is the inertia weight at the kth particle generation, ${c}_{\mathrm{1}}^{\left(k\right)}$ and ${c}_{\mathrm{2}}^{\left(k\right)}$ are acceleration constants at the kth particle generation, ${v}_{i,d}^{\left(k\right)}$ is the current flight speed for the dth component of the ith particle at the kth generation, ${x}_{i,d}^{\left(k\right)}$ is the dth component of the ith particle's current location at the kth generation, ${p}_{i,d}^{\left(k\right)}$ is the dth coordinate of the current optimal value for the ith particle itself at the kth generation, and ${p}_{g,d}^{\left(k\right)}$ is the dth component of the current optimal value for the total particle population up to the kth generation.
3.2 The algorithm for solving source location parameters
Equation (2) concerns a nonlinear optimization problem with multiple local extrema. The PSO algorithm was developed for solving such problems and can be applied to search for the optimal value in fourdimensional solution space composed of (x, y, z, and v), that is, to solve for the source location and the equivalent seismic velocity. x, y, z, and v are the first, second, third, and fourth component of particles, respectively. The flow chart for the PSO algorithm is shown in Fig. 1.
The procedure for the source location parameter evaluation based on the PSO algorithm is described as follows.
Step 1. Initialize the model parameters for microseismic source location and the PSO parameters. Randomly initialize the source position and wave velocity of the PSO algorithm. Initialization of the PSO parameters mainly includes the population size m, acceleration constants c_{1} and c_{2}, inertia weight w, computational accuracy ε, largest number of evolutionary generations T_{max}, initial velocity and positions of the particles, and maximum particle flight speed v_{max}. Then, initialize the iterative counter k.
Step 2. Calculate the particle (microseismic source coordinate and velocity model) fitness value by using Eq. (2). The calculated values here are the source's 3D coordinates $\left({x}_{\mathrm{0}}^{\left(k\right)},{y}_{\mathrm{0}}^{\left(k\right)},{z}_{\mathrm{0}}^{\left(k\right)}\right)$ and equivalent velocity V^{(k)}, where k is the evolutionary generation number.
Step 3. Judge whether the current parameters of the particles meet the presupposed flight times and positioning accuracy or not. If they do, then go to Step 5; otherwise, go to Step 4.
Step 4. Update the flight velocity and particle positions according to Eq. (5), and then go back to Step 2.
Step 5. Output the estimated source's 3D coordinates $\left({\widehat{x}}_{\mathrm{0}},{\widehat{y}}_{\mathrm{0}},{\widehat{z}}_{\mathrm{0}}\right)$ and equivalent wave velocity $\widehat{V}.$
Step 6. Calculate and output the origintime estimate ${\widehat{t}}_{\mathrm{0}}$ by substituting estimated values of the source coordinates $\left({\widehat{x}}_{\mathrm{0}},{\widehat{y}}_{\mathrm{0}},{\widehat{z}}_{\mathrm{0}}\right)$ and equivalent velocity $\widehat{V}$ into Eq. (4). When the solution for the source coordinates and the origin time are obtained, the algorithm is over.
3.3 Discussion of PSO algorithm parameters
The parameter values for the PSO algorithm are the keys to influencing the algorithm performance and efficiency. This paper proposes guiding principles for adjusting parameters of the PSO algorithm based on the practical approach for solving for the seismic source parameters.
3.3.1 Inertia weight w^{(k)}
Generally, optimization problems are divided into local and global problems. The former consists of looking for the minimum in a finite area of function value space; the latter is for finding the minimum in the whole area of function value space. As early as 1998, Shi and Eberhart (1998) found that when the value of inertia weight w is relatively large, the global optimization ability of the PSO algorithm is strong, while the local optimization ability is weak. On the other hand, when the value of inertia weight w is relatively small, the local optimization ability of the PSO algorithm is strong, while the global optimization ability is weak. To avoid particles being stuck in a local optimum at the wrong time or missing the global optimal solution, this study uses the strategy of selfadaptive inertia weight to determine the proper value of w (Zhang and Liao, 2009). The strategy is the following.
In order to enhance the exploring competence of the PSO algorithm, the population average velocity should be maintained to be rather high at the initial stages of evolution, while in the late stage of evolution a smaller population average velocity should be maintained in order to strengthen the development capabilities of the algorithm. We assume that evolution of the average particle flying velocity with changing number of generations k should be close to the function defined by Eq. (6):
where v_{0} represents the initial average velocity of population, T_{max} is the largest number of evolutionary generations, and T_{1} is the number of evolved generations.
We will call ${v}_{\mathrm{e}}^{\left(k\right)}$ the expected value of the average flying velocity for a particle population at the kth generation. The actual average velocity of the particle swarm at the kth generation is given by Eq. (7):
where ${v}_{i,d}^{\left(k\right)}$ represents the velocity of the dth component of the ith particle at the kth generation.
Set the initial inertia weight to w. Designate w^{(k)} inertia weight for the kth particle generation. Then the inertia weight w^{(k+1)} for the (k+l)th generation is determined by Eq. (8):
where p is a some constant. Practice has proved that the best value of p is 1.05 (Zhang and Liao, 2009).
Substitution of w^{(k)} given by Eq. (8) into Eq. (5) ensures that average velocity ${v}_{\mathrm{avg}}^{\left(k\right)}$ will reduce to zero in the process of population evolution.
3.3.2 Acceleration constants ${c}_{\mathrm{1}}^{\left(k\right)}$ and ${c}_{\mathrm{2}}^{\left(k\right)}$
Gao and Liao noted that the position ${x}_{i,d}^{\left(k\right)}$ of each particle in the population eventually converges to $\left({c}_{\mathrm{1}}{p}_{i,d}+{c}_{\mathrm{2}}{p}_{g,d}\right)/\left({c}_{\mathrm{1}}+{c}_{\mathrm{2}}\right)$ (Gao and Liao, 2012). This means that the position of the particles for a large k will stay close to the lines that connect the global optimum point with the local optimum point. Therefore, in the first stage of particle swarm optimization, the optimum value of the particle itself is an important parameter for making all particles converge to global optimum.
However, if ${c}_{\mathrm{1}}^{\left(k\right)}$ would be high for all k values, then the optimum position of the particle swarm would, generally, not coincide with the global optimum of the target function (2). Therefore, at the first stage of PSO, ${c}_{\mathrm{1}}^{\left(k\right)}$ should take a larger value, while ${c}_{\mathrm{2}}^{\left(k\right)}$ should take a smaller value to promote the local optimization speed. When particle swarm optimization is near its end, the role of the global optimal value should be highlighted. At this stage, ${c}_{\mathrm{1}}^{\left(k\right)}$ should take a smaller value, while ${c}_{\mathrm{2}}^{\left(k\right)}$ should take a larger value to help the particle swarm converge to the global optimum. Therefore, the acceleration constants ${c}_{\mathrm{1}}^{\left(k\right)}$ and ${c}_{\mathrm{2}}^{\left(k\right)}$ should be designed based on the average velocity of the particle swarm:
C is a positive integer, usually in the range [2, 5].
3.3.3 The maximum flight velocity of particles v_{max}
The selection and analysis of the maximum flight velocity of particles should proceed as follows: if v_{max} is too small, then the particle movement will be restricted. In this situation, the algorithm cannot converge fast enough and may not even be able to achieve the optimal solution. On the other hand, if v_{max} is too large, then the optimal solution may be missed (Eslami et al., 2014; Abido, 2002). Therefore, it is very important to dynamically adjust the v_{max} value. To ensure uniform velocity through all dimensions, the maximum velocity in the dth dimension is proposed as
where x_{max,d} and x_{min,d}, respectively, stand for the largest and smallest values in the dth dimension of the possible particle positions, and N is a chosen number of intervals (Abido, 2002), usually in the range [1, 10].
4.1 Simulation analysis and discussion
For the simulation, eight sensors comprising a microseismic localization system are located on the eight vertices of a cube. Four microseismic sources, O, P, and Q, are located inside the cube, and R is located outside of the cube. The coordinates of the geophones and the microseismic sources are shown in Table 1, and the relative locations of the geophones and microseismic sources are shown in Fig. 2.
It is assumed that the velocity of wave propagation (v) in the medium is unknown. According to the coordinates of geophones and microseismic sources shown in Table 1, first, the synthetic travel is computed. Then, the differences between the arrival times of all the pairs of the station are retrieved according to Eqs. (2), (3), and (4), and inversion is carried out by the least squares method (LSM; Dong et al., 2013) and the PSO proposed in this paper. The microseismic source location, equivalent wave velocity, and origin time are obtained. Then, the results calculated using the two different methods are compared using error analysis, the algorithm execution time, and the number of iterations.
Suppose a microseismic velocity of v=5.60 m ms^{−1}. According to the coordinate information in Table 1, the trigger time of the microseismic waves recorded by the geophones triggered can be calculated, as shown in Table 2. The method in this paper is PSO. The computational accuracy of the LSM algorithm is $\mathit{\epsilon}=\mathrm{1.0}\times {\mathrm{10}}^{\mathrm{10}}$. The parameters for the PSO algorithm are as follows: population size is m=50, w_{0}=1, and T_{max}=3000. The inertia weight w, acceleration constants c_{1} and c_{2}, and maximum flight velocity of particles v_{avg} are determined by Eqs. (6)–(10). MATLAB programming was used to implement the LSM and PSO algorithms to obtain solutions at four points, O, P, Q, and R. The calculated results are shown in Table 3. The results of convergence are different when different initial values are selected for the LSM. When the initial value is far from the true value, the LSM satisfies the end condition, but it does not get the true value of the microseismic source. By repeatedly adjusting the initial value, the algorithm converges to the correct result. The corresponding initial values of the LSM in Table 3 are obtained after several adjustments. The PSO method can converge to the true value only by randomly selecting a set of initial values within a specified range.
Note: “–” means that the value cannot be obtained directly. The calculated value from the PSO is the average value obtained after running the PSO algorithm 20 times.
Based on the results shown in Table 3, the LSM algorithm has different convergent results for different initial values. When the initial value is far from the true value, the required calculation accuracy ε can be met, but the result does not approach the true value. In some cases, there are multigroup results, so the initial values need to be repeatedly adjusted in order to make the LSM algorithm approach the true value. For the PSO algorithm, a wide range of initial values was used for the microseismic source location parameters. The only variables that need to be solved for are the 3D coordinates of the arbitrary point inside the space surrounded by the seismic detection equipment. Thus, the calculated results can better approach the true value, and the solution is unique. This occurs because by improving the parameter selection rules, the condition where particles are trapped in local optima or fly over the global optimum during the process of searching is avoided; thus, the optimization ability of the PSO algorithm is improved.
Comparisons of the errors in the microseismic source location parameters obtained using the LSM and PSO algorithms are shown in Fig. 3, and the comparison of iterations between the two algorithms is shown in Fig. 4.
The selection of initial values for parameters in the LSM algorithm is comparatively complex, so the basic principle of parameter selection is to approach the desired value as near as possible. The selection of different initial values for parameters in the LSM algorithm has a greater influence on the accuracy of the solution location compared to PSO and results in a large difference in the number of iterations between the two methods. The improved PSO algorithm only needs to provide a value range for the initial parameters. Then, it automatically selects parameter values to iterate, and the algorithm runs for a maximum number of 3000 iterations. As is shown in Table 3, Fig. 3, and Fig. 4, compared with the LSM algorithm, the PSO algorithm not only improves the computational accuracy of the desired value of microseismic source parameters but also increases the computational efficiency and determines the microseismic source's real time location.
The following is a discussion of some special conditions. (1) Since source O is located at the cube's center of gravity, the distance between O and each geophone is the same. As a result, both the LSM and PSO algorithms can converge to the true value when solving for the seismic source coordinates (x_{0}, y_{0}, z_{0}) but cannot solve the origin time t_{0} because regardless of which value of wave velocity v is selected, the value of Q in Eq. (2) tends to be zero. Because of the randomness of the wave velocity, the origin time t_{0} cannot be solved according to Eq. (3). (2) Since source R is located outside of the cube, the average distance from this point to each sensor is larger than that from other points in the cube, such as P and Q points, to each sensor. The error in the equivalent wave velocity, which is solved by iteration, causes greater location error for R than for other points in the cube, so the layout of the seismic detection equipment should ensure that the microseismic source is within the detection array.
4.2 Case study
Because rock bursts occur frequently at a mine in central China, a Paladin 24bit, multichannel microseismic monitoring system of ESG Solutions in Canada was installed. In total, 18 seismic detection devices were installed in different positions at the mine: 9 seismic detection devices were installed at the −520 level, and 9 were installed at the −840 level. A blasting operation with a known position was conducted in order to verify the validity of the PSO algorithm. Ten seismic detection devices detected microseismic signals during the blasting operation. Pretreatments of the data, such as denoising and filtering, were performed on the detected signals in order to obtain a high SNR. Then, two blast points that showed an obvious rising waveform trend, making it easy to capture the trigger time, were selected and analyzed. The position coordinates of the two points are A (1495.60, 998.50, −685.10) and B (1298.70, 855.30, −576.20). The coordinates of the 10 seismic detection devices and the trigger times detected are shown in Table 4. The relative position of the 10 geophones and the two burst points is shown in Fig. 5. The seismic waveform data received by the geophone are shown in Fig. 6.
The experiment was carried out on the advanced roadway of the coal mine working face. The diameter of the borehole is 42 mm, the depth of the borehole is 1.2 m, and the length of the filled explosive is onefourth of the borehole depth. We approximate the blasting point to a spherical blasting point without considering the error caused by the assumption. Based on the data presented in Table 4, the PSO algorithm and LSM algorithm were used to solve for the seismic source location parameters and origin time. A comparison of the error is shown in Table 5.
According to Table 5, the accuracy of the LSM algorithm is relatively poor. Its average deviation in the X, Y, and Z directions is 8.97, 10.81, and 12.90 m, respectively. The results were obtained after repeated adjustment of the initial location parameters for the seismic source and the wave velocity. The PSO algorithm can automatically approach the true values according to the given initial parameter range. Its average deviation in the X, Y, and Z directions is 6.37, 5.78, and 9.03 m, respectively, with errors that are less than 5 %. Therefore, the PSO can achieve high positioning accuracy in the geophone range.
The simulation example and blasting experiment discussed above clearly demonstrate that the PSO optimization algorithm is better than the LSM when solving for the microseismic positioning parameters and the seismic origin time. The algorithm has high positioning accuracy and fast convergence speed, and it is easy to set the initial parameters. This is because the adaptive PSO algorithm is more accurate in fitting the relationship between each coordinate for the seismic detection equipment and the time difference. It can dynamically adjust the velocity value in an iterative process until the value approximates the optimal average velocity, which can account for the nonlinear relationship between each coordinate of the seismic detection equipment and the time difference and can greatly reduce the impact of the velocity error on the positioning precision.
4.3 Discussion
In order to further verify the effectiveness of the proposed method, the experiments in Sect. 4.1 are compared and analyzed under different wave velocities. The comparative analysis steps are as follows. (1) Use the PSO method and the LSM to locate the microseismic source when using real velocity (i.e., error floating at 0 %). (2) Because it is difficult to measure real wave velocity in practical engineering, small errors of 1 %, 3 %, and 5 % are given to the PSO method and LSM; in other words, when the wave velocity is 5.544, 5.432, and 5.320 m ms^{−1}, two methods are used to locate the microseismic source. (3) Step 1 and Step 2 are used to locate the microseismic source, and the absolute distance error is calculated by comparing the locating results with the real values. The absolute distance errors calculated by the PSO method and the LSM at different wave velocities are plotted in Fig. 7.
As we can be seen from Fig. 7, the LSM will cause large errors in the location system under the disturbance of different wave velocities. The maximum error is up to 25 m (except for the seismic source R), while the PSO method is more stable. The reason is that the PSO method can accurately fit the relationship between the coordinates of each sensor and the time difference because it does not depend on the velocity value when solving the seismic location parameters. The LSM needs accurate velocity to solve the seismic location parameters, and the disturbance of velocity has a great influence on the results. That is to say, in the case of wave velocity disturbance, even if there is a small error in the value of wave velocity, there will be a large error in the location result of the LSM. Because of the complexity of rock media, the average velocity of each region is not necessarily the same, and due to the influence of construction technology, it is very difficult to determine the velocity of anisotropic media; this is the main reason for the low positioning accuracy of the LSM. In addition, when the source is outside of the sensor array (such as seismic source R), the errors of the two methods are very large, but the LSM has greater locating errors than the PSO method, which shows that the sensor arrangement should ensure that the seismic source is within the array as far as possible.

An adaptive PSO optimization method is proposed based on the average population velocity in order to solve for location parameters of the seismic source in a location model. This method takes the minimum residual sum of squares between the timedifference regression values and the timedifference measured values for two seismic detection devices, and the PSO algorithm is designed to solve for the seismic source coordinates and the equivalent wave velocity and then solve for the seismic source origin time.

Combined with the actual need to solve for seismic source parameters, the model constraints of inertia weight, accelerating constants, the maximum flight velocity of particles, and other parameters are discussed in order to improve the optimization capacity of the PSO algorithm and avoid being trapped in a local optimum.

Comparative analysis shows that when solving for the seismic source location parameters, compared with the classic least squares method, the adaptive PSO algorithm has high positioning accuracy and fast convergence, and it is easy to set the initial parameter values.
Data and results of calculations are available by email request.
HMS designed the study, performed the research, analyzed data, and wrote the paper. JZY performed the analysis with constructive discussions. XLZ helped performed the data analyzes. BGW contributed to the collection and analysis of the data. RSJ contributed to refining the ideas, carrying out additional analyses, and finalizing this paper.
The authors declare that they have no conflict of interest.
The authors wish to thank the two anonymous reviewers and editor for their suggestions for improving the paper. They are also grateful for collaborative funding support from the Key Research and Development Program of Shandong Province (grant nos. 2017GSF20115 and 2018GGX109013), the Natural Science Foundation of Shandong Province (grant no. ZR2018MEE008), and the project of the Shandong Province High Educational Science and Technology Program (grant no. J18KA307).
This research has been supported by the Key Research and Development Program of Shandong Province (grant nos. 2017GSF20115 and 2018GGX109013), the Natural Science Foundation of Shandong Province (grant no. ZR2018MEE008), and the project of the Shandong Province High Educational Science and Technology Program (grant no. J18KA307).
This paper was edited by Luciano Telesca and reviewed by two anonymous referees.
Abido, M. A.: Optimal power flow using particle swarm optimization, Int. J. Electr. Power Energy Syst., 24, 563–571, 2002.
Anikiev, D., Valenta, J., Staněk, F., and Eisner, L.: Joint location and source mechanism inversion of microseismic events: benchmarking on seismicity induced by hydraulic fracturing, Geophys. J. Int., 198, 249–258, 2014.
Chen, B., Feng, X., Li, S., Yuan, J., and Xu, S.: Microseism source location with hierarchical strategy based on particle swarm optimization, Chin. J. Rock Mech. Eng., 28, 740–749, 2009.
Dong, L. and Li, X.: A microseismic/acoustic emission source location method using arrival times of ps waves for unknown velocity system, Int. J. Distrib. Sens. Netw., 2013, 485–503, 2013.
Dong, L., Sun, D., Li, X., and Du, K.: Theoretical and experimental studies of localization methodology for ae and microseismic sources without premeasured wave velocity in mines, IEEE Access, 99, 16818–16828, 2017.
Eberhart, R. C. and Kennedy, J.: A new optimizer using particle swarm theory, Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 4–6 October, Nagora, Japan, 39–43, 1995.
Eslami, M., Shareef, H., Taha, M. R., and Khajehzadeh, M.: Adaptive particle swarm optimization for simultaneous design of upfc damping controllers, Int. J. Electr. Power Energy Syst., 57, 116–128, 2014.
Feng, G. L., Feng, X. T., Chen, B. R., Xiao, Y. X., and Jiang, Q.: Sectional velocity model for microseismic source location in tunnels, Tunn. Undergr. Sp. Tech., 45, 73–83, 2015.
Fong S., Wong R., and Vasilakos A.: Accelerated PSO swarm search feature selection for data stream mining big data, IEEE Trans. Serv. Comput., 9, 33–45, 2016.
Gao, Z. and Liao, X. Z.: Hybrid adaptive particle swarm optimization based on average velocity, Control Decis., 27, 376–381, 2012.
Geiger, L.: Probability method for the determination of earthquake epicenters from arrival time only, Bull. St. Louis. Univ., 8, 60–71, 1912.
Gong, S. Y., Dou, L. M., Ma, X. P., Mou, Z. L., He, H., and He, J.: Study on the construction and solution technique of anisotropic velocity model in the location of coal mine tremor, Chinese J. Geophys.Chinese Ed., 55, 1757–1763, 2012.
Lee, W. H. K. and Stewart, S. W.: Principles and applications of microearthquake networks, Academic Press, New York, 1981.
Jia, R. S., Liu, C., Sun, H. M., and Yan, X. H.: A situation assessment method for rock burst based on multiagent information fusion, Comput. Electr. Eng., 45, 22–32, 2015.
Li, N., Wang, E., Ge, M., and Sun, Z.: A nonlinear microseismic source location method based on simplex method and its residual analysis, Arab. J. Geosci., 7, 4477–4486, 2014.
Li, X., Wang, E., Li, Z., Liu, Z., Song, D., and Qiu, L.: Rock burst monitoring by integrated microseismic and electromagnetic radiation methods, Rock Mech. Rock Eng., 49, 1–14, 2016.
Lienert, B. R., Berge, E., and Frazer, L. N.: Hypocenter: an earthquake location method using centered, scaled, and adaptively damped least squares, Bull. Seismol. Soc. Amer., 6, 771–783, 1986.
Lin, F., Li, S. L., Xue, Y. L., and Xu, H. B.: Microseismic sources location methods based on different initial values, Chin. J. Rock Mech. Eng., 29, 996–1002, 2010.
Lomax, A., Virieux, J., Volant, P. and Berge, C.: Probabilistic earthquake location in 3D and layered models: Introduction of a MetropolisGibbs method and comparison with linear locations, in: Advances in Seismic Event Location, edited by: Thurber, C. H. and Rabinowitz, N., Kluwer, Amsterdam, 101–134, 2000.
Lomax, A., Zollo, A., Capuano, P., and Virieux, J.: Precise, absolute earthquake location under SommaVesuvius volcano using a new 3D velocity model, Geophys. J. Int., 146, 313–331, 2001.
Nelson, G. D. and Vidale, J. E.: Earthquake locations by 3D finite difference travel times, Bull. Seismol. Soc. Amer., 80, 395–410, 1990.
Pastén, D., Estay, R., Comte, D., and Vallejos, J.: Multifractal analysis in mining microseismicity and its application to seismic hazard in mine, Int. J. Rock Mech. Min. Sci., 78, 74–78, 2015.
Prange, M. D., Bose, S., Kodio, O., and Djikpesse, H. A.: An informationtheoretic approach to microseismic source location, Geophys. J. Int., 201, 193–206, 2015.
Renaudineau, H., Donatantonio, F., Fontchastagner, J., Petrone, G., Spagnuolo, G., Martin, J., and Pierfederici, S.: A PSObased global mppt technique for distributed PV power generation, IEEE Trans. Ind. Electron., 62, 1047–1058, 2015.
Shi, Y. and Eberhart, R. C.: Parameter selection in particle swarm optimization, Evolutionary Programming VII, Springer, Berlin Heidelberg, 1998.
Sudheer, C., Maheswaran, R., Panigrahi, B. K., and Marthur, S.: A hybrid SVMPSO model for forecasting monthly streamflow, Neural Comput. Appl., 24, 1381–1389, 2014.
Sun, H. M., Jia, R. S., Du, Q. Q., and Fu, Y.: Crosscorrelation analysis and time delay estimation of a homologous microseismic signal based on the HilbertHuang transform, Comput. Geosci., 91, 98–104, 2016.
Usher, P. J., Angus, D. A., and Verdon, J. P.: Influence of a velocity model and source frequency on microseismic waveforms: some implications for microseismic locations, Geophys. Prospect., 61, 334–345, 2013.
Waldhauser, F. and Ellsworth, W. L.: A doubledifference earthquake location algorithm: method and application to the northern Hayward fault, California, Bull. Seismol. Soc. Amer., 90, 1353–1368, 2000.
Xue, Q., Wang, Y., Zhan, Y., and Chang, X.: An efficient gpu implementation for locating microseismic sources using 3d elastic wave timereversal imaging, Comput. Geosci., 82, 89–97, 2015.
Zhang, D. X. and Liao, R. Q.: Adaptive particle swarm optimization algorithm based on population velocity, Control Decis., 24, 1257–1246, 2009.