In this paper we analyze a new method for an adaptive variation of Evolutionary Algorithms (EAs) population size: the Self-Regulated Population size EA (SRP-EA). An empirical evaluation of the method is provided by comparing the new proposal with the CHC algorithm and other well known EAs with varying population. A fitness landscape generator was chosen to test and compare the algorithms: the Spear's multimodal function generator. The performance of the algorithms was measured in terms of success rate, quality of the solutions and evaluations needed to attain them over a wide range of problem instances. We will show that SRP-EA performs well on these tests and appears to overcome some recurrent drawbacks of traditional EAs which lead them to local optima premature convergence. Also, unlike other methods, SRP-EA seems to self-regulate its population size according to the state of the search. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Fernandes, C., & Rosa, A. (2006). Self-regulated population size in evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 920–929). Springer Verlag. https://doi.org/10.1007/11844297_93
Mendeley helps you to discover research relevant for your work.