Abstract
Evolutionary algorithms are randomized heuristic search methods based on the principles of natural evolution, or more specifically, on Darwin’s theory of survival of the fittest.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Branke, J. (2002). Brief Introduction to Evolutionary Algorithms. In: Evolutionary Optimization in Dynamic Environments. Genetic Algorithms and Evolutionary Computation, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0911-0_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0911-0_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5300-3
Online ISBN: 978-1-4615-0911-0
eBook Packages: Springer Book Archive