Abstract
In this paper modified version of roulette selection for evolution algorithms – the fan selection, is presented. This method depends on increase of survive probability of better individuals at the expense of worse individuals. Test functions chosen from literature are used for determination of quality of proposed method. Results obtained for fan selection are compared with results obtained using roulette selection and elitist selection.
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
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, WNT, Warsaw (1999) (in polish)
Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning, WNT, Warsaw (1998) (in polish)
Arabas, J.: Lectures of evolutionary algorithms, WNT, Warsaw (2001) (in polish)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Słowik, A., Białko, M. (2004). Modified Version of Roulette Selection for Evolution Algorithms – The Fan Selection. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds) Artificial Intelligence and Soft Computing - ICAISC 2004. ICAISC 2004. Lecture Notes in Computer Science(), vol 3070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24844-6_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-24844-6_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22123-4
Online ISBN: 978-3-540-24844-6
eBook Packages: Springer Book Archive