Population-Based Extremal Optimization with Adaptive Lévy Mutation for Constrained Optimization

Recently, a local-search heuristic algorithm called extremal optimization (EO) has been successfully applied in some combinatorial optimization problems. This paper presents the studies on the applications of EO to numerical constrained optimization problems with a set of popular benchmark problems. To enhance and improve the search performance and efficiency of EO, we developed a novel EO strategy with population based search. The newly developed EO algorithm is named population-based EO (PEO). Additionally, we adopted the adaptive Levy mutation, which is more likely to generate an offspring that is farther away from its parent than the commonly employed Gaussian mutation. Compared with three state-of-the-art stochastic search methods with six popular benchmark problems, it has been shown that our approach is a good alternative to deal with the numerical constrained optimization problems