Abstract
It is possible for a GA to have two stable fixed points on a single-peak fitness landscape. These can correspond to meta-stable finite populations. This phenomenon is called bistability, and is only known to happen in the presence of recombination, selection, and mutation. This paper models the bistability phenomenon using an infinite population model of a GA based on gene pool recombination. Fixed points and their stability are explicitly calculated. This is possible since the infinite population model of the gene pool GA is much more tractable than the infinite population model for the standard simple GA. For the needle-in-the-haystack fitness function, the fixed point equations reduce to a single variable polynomial equation, and stability of fixed points can be determined from the derivative of the single variable equation.
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.
References
Boerlijst, M.C., Bonhoeffer, S., Nowak, M.A.: Viral quasi-species and recombination. Proc. Royal Society London B 263, 1577–1584 (1996)
Baluja, S., Caruana, R.: Removing the genetics from the standard genetic algorithm. In: Prieditis, A., Russel, S. (eds.) The Int. Conf. on Machine Learning 1995, pp. 38–46. Morgan Kaufmann Publishers, San Francisco (1995)
Cripe, G.: Bistability of the needle function in the presence of truncation selection. Master’s thesis, Univ. of Montana, Missoula, MT 59812 (2003)
Geiringer, H.: On the probability of linkage in Mendelian heredity. Annals of Mathematical Statistics 15, 25–57 (1944)
Mühlenbein, H., Mahnig, T.: Evolutionary algorithms: From recombination to search distributions. In: Kallel, L., Naudts, B., Rogers, A. (eds.) Theoretical Aspects of Evolutionary Computation, pp. 137–176. Springer, Heidelberg (2000)
Mühlenbein, H., Mahnig, T.: Evolutionary computation and beyond. In: Uesaka, Y., Kanerva, P., Asoh, H. (eds.) Foundations of Real-World Intelligence, pp. 123–188. CSLI Publications, Stanford (2001)
Ochoa, G., Harvey, I.: Recombination and error thresholds in finite populations. In: Foundations of Genetic Algorithms 5, pp. 245–264. Morgan Kaufmann, San Francisco (1997)
Prügel-Bennett, A., Rogers, A.: Modelling genetic algorithm dynamics. In: Theoretical Aspects of Evolutionary Computing, Springer, Heidelberg (2001)
Suzuki, H., Iwasa, Y.: Crossover accelerates evolution in gas with a babel-like fitness landscape: Mathematical analyses. Evolutionary Computation 7(3), 275–310 (1999)
Syswerda, G.: Simulated crossover in genetic algorithms. In: Darrel Whitley, L. (ed.) Foundations of Genetic Algorithms 2, San Mateo, Morgan Kaufmann, San Francisco (1993)
Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge (1999)
Wright, A.H., Rowe, J.E., Neil, J.R.: Analysis of the simple genetic algorithm on the single-peak and double-peak landscapes. In: Proceedings of the Congress on Evolutionary Computation (CEC) 2002, pp. 214–219. IEEE Press, Los Alamitos (2002)
Wright, A.H., Rowe, J.E., Poli, R., Stephens, C.R.: Bistability in a gene pool GA with mutation. In: Foundations of genetic algorithms (FOGA-7), San Mateo, Morgan Kaufmann, San Francisco (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wright, A., Cripe, G. (2004). Bistability of the Needle Function in the Presence of Truncation Selection. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-24855-2_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22343-6
Online ISBN: 978-3-540-24855-2
eBook Packages: Springer Book Archive