Recently, a local-search heuristic algorithm called Extremal Optimization (EO) has been successfully applied in some combinatorial optimization problems. However, there are only limited papers studying on the mechanism of EO applied to the numerical optimization problems so far. 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 populationbased 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 choice to deal with the numerical constrained optimization problems. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Chen, M. R., Lu, Y. Z., & Yang, G. (2007). Population-based extremal optimization with adaptive levy mutation for constrained optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 144–155). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_16
Mendeley helps you to discover research relevant for your work.