We have compared the performances of six recently developed global optimization algorithms: imperialist competitive algorithm, firefly algorithm (FA), water cycle algorithm (WCA), whale optimization algorithm (WOA), fireworks algorithm (FWA), and quantum particle swarm optimization (QPSO). These methods have been introduced in the past few years and have found very limited or no applications to geophysical exploration problems thus far. We benchmark the algorithms’ results against the particle swarm optimization (PSO), which is a popular and well-established global search method. In particular, we are interested in assessing the exploration and exploitation capabilities of each method as the dimension of the model space increases. First, we test the different algorithms on two multiminima and two convex analytic objective functions. Then, we compare them using the residual statics corrections and 1D elastic full-waveform inversion, which are highly nonlinear geophysical optimization problems. Our results demonstrate that FA, FWA, and WOA are characterized by optimal exploration capabilities because they outperform the other approaches in the case of optimization problems with multiminima objective functions. Differently, QPSO and PSO have good exploitation capabilities because they easily solve ill-conditioned optimizations characterized by a nearly flat valley in the objective function. QPSO, PSO, and WCA offer a good compromise between exploitation and exploration.
Genetic algorithms (GAs) usually suffer from the so-called genetic-drift effect, which reduces the genetic variability within the evolving population making the algorithm converge toward a local minimum of the objective function. We have developed an innovative method to attenuate such a genetic-drift effect that we named the drift-avoidance GA (DAGA). The implemented method combines some principles of niched GAs (NGAs), catastrophic GAs, crowding GAs, and the Monte Carlo algorithm (MCA) with the aim of maintaining an optimal genetic diversity within the evolving population, thus avoiding premature convergence. The DAGA performance is first tested on different analytic objective functions often used to test optimization algorithms. In this case, the implemented DAGA approach is compared with standard GAs, catastrophic GAs, crowding GAs, NGAs, and MCA. Then, the DAGA and the NGAs approaches are compared on two well-known nonlinear geophysical optimization problems characterized by objective functions with complex topologies: residual statics corrections and 2D acoustic full-waveform inversion. To draw general conclusions, we limit the attention to synthetic seismic optimizations. Our tests prove that the DAGA approach grants the convergence in case of objective functions with very complex topologies, where other GA implementations (such as standard GAs or NGAs) fail to converge. Differently, in case of simpler topologies, DAGA achieves similar performances with the other GA implementations considered. The DAGA approach may have a slightly higher or lower computational cost than standard GA or NGA methods, depending on its convergence speed, that is, on its ability to reduce the number of forward modelings with respect to the other methods.