Abstract
Evolutionary algorithms are not fixed procedures, but contain several elements that must be adapted to the optimization problem to be solved. In particular, the encoding of the candidate solution needs to be chosen with care. Although there is no generally valid rule or recipe, we discuss some important properties a good encoding should have. We also turn to the fitness function and review the most common selection techniques as well as how certain undesired effects can be avoided by adapting the fitness function or the selection method. The last section of this chapter is devoted to genetic operators, which serve as tools to explore the search space, and covers sexual and asexual recombination and other variation techniques.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Y. Davidor. Lamarckian Sub-Goal Reward in Genetic Algorithm. Proc. Euro. Conf. on Artificial Intelligence (ECAI, Stockholm, Sweden), 189–194. Pitman, London/Boston, United Kingdom/USA, 1990
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs, 3rd (extended) edition. Springer-Verlag, New York, NY, USA, 1996
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Kruse, R., Borgelt, C., Klawonn, F., Moewes, C., Steinbrecher, M., Held, P. (2013). Elements of Evolutionary Algorithms. In: Computational Intelligence. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-5013-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5013-8_12
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5012-1
Online ISBN: 978-1-4471-5013-8
eBook Packages: Computer ScienceComputer Science (R0)