In this paper we seek an answer to the following question: Is it possible and rewarding to self-adapt parameters regarding selection and population size in an evolutionary algorithm? The motivation comes from the observation that the majority of the existing EC literature is concerned with (self-)adaptation of variation operators, while there are indications that (self-)adapting selection operators or the population size can be equally or even more rewarding. We approach the question in an empirical manner. We design and execute experiments for comparing the performance increase of a benchmark EA when augmented with self-adaptive control of parameters concerning selection and population size in isolation and in combination. With the necessary caveats regarding the test suite and the particular mechanisms used we observe that self-adapting selection yields the highest benefit (up to 30-40%) in terms of speed. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Eiben, A. E., Schut, M. C., & De Wilde, A. R. (2006). Is self-adaptation of selection pressure and population size possible? - A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 900–909). Springer Verlag. https://doi.org/10.1007/11844297_91
Mendeley helps you to discover research relevant for your work.