Abstract
In this study, we investigated the influence of genetic drift on the performance of a genetic algorithm on the multiplicative landscape. We performed a theoretical investigation of the frequencies of the first-order schemata, and calculated their changes in time by using the Wright–Fisher model. We showed that this mathematical theory reasonably predicts various quantities, including the ultimate distribution of the first-order schemata.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
AE Nix MD Vose (1992) ArticleTitleModelling genetic algorithm with Markov chains Ann Math Artif Intel 5 79–88 Occurrence Handle10.1007/BF01530781 Occurrence Handle1279417
JWJ Ewens (2004) Mathematical population genetics. I. Theoretical introduction EditionNumber2nd edn. Springer New York Occurrence Handle1060.92046
H Asoh H Mühlenbein (1994) On the mean convergence time of evolutionary algorithms without selection and mutation. Parallel problem solving from nature. Lecture Notes in Computer Science 866 Springer New York 88–97
Stephens CR, Waelbroeck H (1999) Evolut Comput 7:109
H Furutani (2003) Foundations of genetic algorithms 7 Morgan Kaufmann San Francisco 9–26
Furutani H (2002) Proceedings of the Simulated Evolution and Learning Conference, SEAL'02, pp 230–235
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was presented in part at the 11th International Symposium on Artificial Life and Robotics, Oita, Japan, January 23–25, 2006
About this article
Cite this article
Furutani, H., Katayama, S., Sakamoto, M. et al. Stochastic analysis of schema distribution in a multiplicative landscape. Artif Life Robotics 11, 101–104 (2007). https://doi.org/10.1007/s10015-006-0409-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-006-0409-5