Hypocentre location: genetic algorithms incorporating problem‐specific information

This paper shows how the performance of a fully non‐linear earthquake location scheme can be improved by taking advantage of problem‐specific information in the location procedure. The genetic algorithm is best viewed as a method of parameter space sampling that can be used for optimization problems. It has been applied successfully in regional and teleseismic earthquake location when the network geometry is favourable. However, on a series of test events with unfavourable network geometries the performance of the genetic algorithm is found to be poor. We introduce a method to separate the spatial and temporal parameters in such a way that problems related to the strong trade‐off between depth and origin time are avoided. Our modified algorithm has been applied to several test events. Performance over the unmodified algorithm is improved substantially and the computational cost is reduced. The algorithm is better suited to the determination of hypocentral location whether using arrival times, array information (slowness and azimuth) or a combination of both. A second type of modification is introduced which exploits the weak correlation between the epicentral parameters and depth. This algorithm also improves performance over the standard genetic algorithm search, except in circumstances where the depth and epicentre are not weakly correlated, which occurs when the azimuthal coverage is very poor, or when azimuth and slowness information are incorporated. On a shallow nuclear explosion with only teleseismic P arrivals available, the algorithm consistently converged to a depth very close to the true depth, indicating superior depth estimation for shallow earthquake locations over the unmodified algorithm.