Abstract
Evolutionary algorithms are not fixed procedures, but contain several elements that must be adapted to the optimization problem to be solved.
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
References
Y. Davidor, Lamarckian Sub-Goal Reward in Genetic Algorithm, in Proceedings of the European Conference on Artificial Intelligence (ECAI, Stockholm, Sweden) (Pitman, London, 1990), pp. 189–194
Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. (Springer, New York, 1996)
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
Copyright information
© 2016 Springer-Verlag London
About this chapter
Cite this chapter
Kruse, R., Borgelt, C., Braune, C., Mostaghim, S., Steinbrecher, M. (2016). Elements of Evolutionary Algorithms. In: Computational Intelligence. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-7296-3_12
Download citation
DOI: https://doi.org/10.1007/978-1-4471-7296-3_12
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-7294-9
Online ISBN: 978-1-4471-7296-3
eBook Packages: Computer ScienceComputer Science (R0)