Abstract
Evolutionary algorithms (EAs) are biologically inspired, randomized search meta-heuristics. They unify the fundamental principles of biological evolution: inheritance of genes, variation of genes in a population, translation of genotype into phenotype and selection of the fittest in the sense of the Darwinian principle survival of the fittest [28]. In the sixties Holland, Rechenberg and Schwefel translated this paradigm of evolution into a concept of algorithms which is called evolutionary computation (EC). Today, this computational method has grown to a rich and frequently used optimization method. It comprises several variants of algorithms which are structurally similar, but specialized to certain search domain characteristics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kramer, O. (2008). Introduction. In: Self-Adaptive Heuristics for Evolutionary Computation. Studies in Computational Intelligence, vol 147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69281-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-69281-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69280-5
Online ISBN: 978-3-540-69281-2
eBook Packages: EngineeringEngineering (R0)