Abstract
The takeover time of some selection method is the expected number of iterations of this selection method until the entire population consists of copies of the best individual under the assumption that the initial population consists of a single copy of the best individual. We consider a class of non-generational selection rules that run the risk of loosing all copies of the best individual with positive probability. Since the notion of a takeover time is meaningless in this case these selection rules are modified in that they undo the last selection operation if the best individual gets extinct from the population. We derive exact results or upper bounds for the takeover time for three commonly used selection rules via a random walk or Markov chain model. The takeover time for each of these three selection rules is O(n log n) with population size n.
This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center “Computational Intelligence”
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
D. E. Goldberg and K. Deb, “A comparative analysis of selection schemes used in genetic algorithms” in Foundations of Genetic Algorithms (G. J. E. Rawlins, ed.), pp. 69-93, San Mateo (CA): Morgan Kaufmann, 1991.
J. Smith and F. Vavak, “Replacement strategies in steady state genetic algorithms: Static environments” in Foundations of Genetic Algorithms 5 (W. Banzhaf and C. Reeves eds.), pp. 219–233, San Francisco (CA): Morgan Kaufmann, 1999.
G. Rudolph, “Takeover times and probabilities of non-generational selection rules” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000) (D. Whitley et al., eds.), pp. 903–910, San Fransisco (CA): Morgan Kaufmann, 2000.
M. Iosifescu, Finite Markov Processes and Their Applications. Chichester: Wiley, 1980.
G. Rudolph, “The fundamental matrix of the general random walk with absorbing boundaries” Technical Report CI-75 of the Collaborative Research Center “Computational Intelligence”, University of Dortmund, October 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this paper
Cite this paper
Rudolph, G. (2001). Takeover Times of Noisy Non-Generational Selection Rules that Undo Extinction. In: Kůrková, V., Neruda, R., Kárný, M., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6230-9_66
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6230-9_66
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83651-4
Online ISBN: 978-3-7091-6230-9
eBook Packages: Springer Book Archive