Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arabas, J., Michalewicz, Z., Mulawka, J.: GAVaPS – A Genetic Algorithm with Varying Population Size. In: Proceedings of Evolutionary Computation Conference, IEEE Press, Los Alamitos (1994)
Bäck, T., Eiben, A.E., van der Sart, N.A.L.: An empirical Study on Gas “without parameters”. In: Proceedings of the 6th Conference on Parallel Problem Solving from Nature. LNCS, pp. 315–324. Springer, Berlin (2000)
Costa, J., Tavares, R., Rosa, A.C.: An Experimental Study on Dynamic Random Variation of Population Size. In: Proceedings of IEEE Systems, Man and Cybernetics Conference, Tokyo, pp. 607–612. IEEE Press, Los Alamitos (1999)
Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter Control in Evolutionary Algorithms. IEEE Transaction on Evolutionary Computation 3(2), 124–141 (1999)
Eiben, A.E., Marchiori, E., Valkó, V.A.: Evolutionary Algorithms with On-the-Fly Population Size Adjustment. In: 8th Conference on Parallel Problem Solving from Nature. LNCS, pp. 315–324. Springer, Birmingham (2004)
Eschelman, L.J.: The CHC Algorithm: How to Have Safe Search When Engaging in Non-traditional Genetic Recombination. In: Proceedings of Foundations of Genetic Algorithms-1, pp. 70–79 (1990)
Fernandes, C., Rosa, A.C.: A Study on Non-random Mating and Varying Population Size in Genetic Algorithms Using Royal Road Functions. In: Proceedings of the IEEE Conference on Evolutionary Computation, pp. 60–66 (2001)
Koumosis, V.K., Katsaras, C.P.: A Saw-Tooth Genetic Algorithm Combining the Effects of Variable Population Size and Reinitialization to Enhance Performance. IEEE Transactions on Evolutionary Computation 10(1), 19–28 (2006)
Spears, W.M.: Evolutionary Algorithms: the role of mutation and recombination. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernandes, C., Rosa, A. (2006). Self-regulated Population Size in Evolutionary Algorithms. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_93
Download citation
DOI: https://doi.org/10.1007/11844297_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)