Abstract
One of the most important parameters in the application of genetic algorithms (GAs) is the population size N. In many cases, the choice of N determines the quality of the solutions obtained. The study of GAs with a finite population size requires a stochastic treatment of evolution. In this study, we examined the effects of genetic fluctuations on the performance of GA calculations. We considered the role of crossover by using the stochastic schema theory within the framework of the Wright-Fisher model of Markov chains. We also applied the diffusion approximation of the Wright-Fisher model. In numerical experiments, we studied effects of population size N and crossover rate pc on the success probability S. The success probability S is defined as the probability of obtaining the optimum solution within the limit of reaching the stationary state. We found that in a GA with pc, the diffusion equation can reproduce the success probability S. We also noted the role of crossover, which greatly increases S.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Furutani H, Katayama S, Sakamoto M, et al (2007) Stochastic analysis of schema distribution in a multiplicative landscape. Artif Life Robotics 11:101–104
Furutani H, Fujimaru T, Zhang Y, et al (2007) Effects of population size on computational performance of genetic algorithm on multiplicative landscape. Proceedings of the 3rd International Conference on Natural Computation, vol 3, pp 488–493
Nix AE, Vose MD (1992) Modelling genetic algorithm with Markov chains. Ann Math Artif Intel 5:79–88
Davis TE, Principe JC (1993) A Markov chain framework for the simple genetic algorithm. Evolut Comput 1:269–288
De Jong KA, Spears WM, Gordon DF (1995) Using Markov chains to analyze GAFOs. Foundations Genetic Algorithms 3:115–157
Ewens JWJ (2004) Mathematical population genetics. I. Theoretical introduction, 2nd edn. Springer, New York
Fisher RA (1922) On the dominance ratio. Proc R Soc Edinburgh 42:321–341
Maynard Smith J (1998) Evolutionary genetics, 2nd edn. Oxford University Press, Oxford
Asoh H, Muhlenbein H (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, pp 88–97
Furutani H (2003) Schema analysis of OneMax problem. Foundations of genetic algorithms 7. Morgan Kaufmann, San Francisco, pp 9–26
Furutani H (2002) Schema analysis of genetic algorithms on multiplicative landscape. Proceedings of the Simulated Evolution and Learning Conference, SEAL’02, pp 230–235
Furutani H (2003) Schema analysis of average fitness in multiplicative landscape. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2003, Lecture Notes in Computer Science, 2723, Springer, New York, pp 934–947
Crow JF, Kimura M (1970) An introduction to population genetics theory. Harper and Row, New York
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008
About this article
Cite this article
Zhang, Ya., Ma, Q., Sakamoto, M. et al. Effects of population size on the performance of genetic algorithms and the role of crossover. Artif Life Robotics 15, 239–243 (2010). https://doi.org/10.1007/s10015-010-0836-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-010-0836-1