A new method for modeling the behavior of finite population evolutionary algorithms
Abstract
As practitioners we are interested in the likelihood of the population containing a copy of the optimum. The dynamic systems approach, however, does not help us to calculate that quantity. Markov chain analysis can be used in principle to calculate the quantity. However, since the associated transition matrices are enormous even for modest problems, it follows that in practice these calculations are usually computationally infeasible. Therefore, some improvements on this situation are desirable. In this paper, we present a method for modeling the behavior of finite population evolutionary algorithms (EAs), and show that if the population size is greater than 1 and much less than the cardinality of the search space, the resulting exact model requires considerably less memory space for theoretically running the stochastic search process of the original EA than the Nix and Vose-style Markov chain model. We also present some approximate models that use still less memory space than the exact model. Furthermore, based on our models, we examine the selection pressure by fitness-proportionate selection, and observe that on average over all population trajectories, there is no such strong bias toward selecting the higher fitness individuals as the fitness landscape suggests.
References
[1]
Arora, S., Rabani, Y., and Vazirani, U. (1994). Simulating quadratic dynamical systems is Pspace-complete. In Proceedings of the Twenty-sixth Annual ACM Symposium on the Theory of Computing, pp. 459-467.
[2]
Aytug, H., and Koehler, G. J. (1996). Stopping criteria for finite length genetic algorithms. INFORMS Journal on Computing, 8(2):183-191.
[3]
Aytug, H., and Koehler, G. J. (2000). New stopping criterion for genetic algorithms. European Journal of Operational Research, 126:662-674.
[4]
Bäck, T., deGraaf, J. M., Kok, J. N., and Kosters, W. A. (1997). Theory of genetic algorithms. Bulletin of the EATCS, 63:161-192.
[5]
Beyer, H.-G., Schwefel, H.-P., and Wegener, I. (2002). How to analyse evolutionary algorithms. Theoretical Computer Science, 287:101-130.
[6]
Davis, T. E., and Principe, J. C. (1993). A Markov chain framework for the simple genetic algorithm. Evolutionary Computation, 1(3):269-288.
[7]
DeJong, K. A. (2006). Evolutionary computation: A unified approach. Cambridge, MA: MIT Press.
[8]
DeJong, K. A., Spears, W. M., and Gordon, D. F. (1995). Using Markov chains to analyse GAFOs. In Foundations of Genetic Algorithms 3, pp. 115-137. San Mateo, CA: Morgan Kaufmann.
[9]
Droste, S., Jansen, T., and Wegener, I. (2002). On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81.
[10]
Eiben, A. E., Aarts, E. H. L., and VanHee, K. M. (1991). Global convergence of genetic algorithms: A Markov chain analysis. In Parallel problem solving from nature, Lecture notes in computer science (pp. 4-12). Berlin: Springer-Verlag.
[11]
Eiben, A. E., and Rudolph, G. (1999). Theory of evolutionary algorithms: A bird's eye view. Theoretical Computer Science, 229:3-9.
[12]
Eiben, A. E., and Smith, J. E. (2003). Introduction to evolutionary computing. Berlin: Springer-Verlag.
[13]
Goldberg, D. E., and Segrest, P. (1987). Finite Markov chain analysis of genetic algorithms. In J. J. Grefenstette (Ed.), Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms (pp. 1-8). Mahwah, NJ: Lawrence Erlbaum.
[14]
Matsumoto,M., and Nishimura, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation, 8:3-30.
[15]
Mitavskiy, B., and Rowe, J. (2006a). An extension of Geiringer's theorem for a wide class of evolutionary search algorithms. Evolutionary Computation, 14(1):87-118.
[16]
Mitavskiy, B., and Rowe, J. (2006b). Some results about the Markov chain associated to GPs and general EAs. Theoretical Computer Science, 361:72-110.
[17]
Nix, A. E., and Vose, M. D. (1992). Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence, 5(1):79-88.
[18]
Poli, R., McPhee, N. F., and Rowe, J. E. (2004). Exact schemata theory and Markov chain models for genetic programming and variable-length genetic algorithms with homologous crossover. Genetic Programming and Evolvable Machines, 5(1):31-70.
[19]
Prügel-Bennett, A. (2003). Modeling finite populations. In Foundations of Genetic Algorithms 7 (pp. 99-114). San Mateo, CA: Morgan Kaufmann.
[20]
Rabani, Y., Ravinovich, Y., and Sinclair, A. (1995). A computational view of population genetics. In Proceedings of the Twenty-seventh Annual ACM Symposium on the Theory of Computing (pp. 83-92). New York: ACM.
[21]
Reeves, C. R., and Rowe, J. E. (2003). Genetic algorithms--Principles and perspective: A guide to GA theory. Dordrecht, The Netherlands: Kluwer Academic.
[22]
Rudolph, G. (1994). Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks, 5(1):96-101.
[23]
Schmitt, L. M. (2001). Theory of genetic algorithms. Theoretical Computer Science, 259:1-61.
[24]
Schmitt, L. M. (2004). Theory of genetic algorithms II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. Theoretical Computer Science, 310:181-231.
[25]
Schmitt, L. M., Nehaniv, C. L., and Fujii, R. H. (1998). Linear analysis of genetic algorithms. Theoretical Computer Science, 200:101-134.
[26]
van Nimwegen, E., Crutchfield, J. P., and Mitchell, M. (1997). Finite populations induce metastability in evolutionary search. Physics Letters A, 229:144-150.
[27]
van Nimwegen, E., Crutchfield, J. P., and Mitchell, M. (1999). Statistical dynamics of the royal road genetic algorithms. Theoretical Computer Science, 229:41-102.
[28]
Vose, M. D. (1993). Modeling simple genetic algorithms. In Foundations of Genetic Algorithms 2 (pp. 63-73). San Mateo, CA: Morgan Kaufmann.
[29]
Vose, M. D. (1996). Modeling simple genetic algorithms. Evolutionary Computation, 3(4):453-472.
[30]
Vose, M. D. (1999a). Random heuristic search. Theoretical Computer Science, 229:103-142.
[31]
Vose, M. D. (1999b). The simple genetic algorithm: Foundations and theory. Cambridge, MA: MIT Press.
[32]
Vose, M. D., and Liepins, G. E. (1991). Punctuated equilibria in genetic search. Complex Systems, 5(1):31-44.
[33]
Vose, M. D., and Wright, A. H. (1994). Simple genetic algorithms with linear fitness. Evolutionary Computation, 2(4):347-368.
[34]
Wegener, I. (2000). On the expected runtime and the success probability of evolutionary algorithms. In Graph-theoretic concepts in computer science. Lecture notes in computer science, Vol. 1928 (pp. 1-10). Berlin: Springer-Verlag.
[35]
Wegener, I. (2001). Theoretical aspects of evolutionary algorithms. In The Twenty-eighth International Colloquium on Automata, Languages and Programming, ICALP2001. Lecture notes in computer science, Vol. 2076 (pp. 64-78). Berlin: Springer-Verlag.
[36]
Wegener, I., and Witt, C. (2005). On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions. Journal of Discrete Algorithms, 3:61-78.
[37]
Whitley, L. D., and Vose, M. D. (1995). Introduction. In Foundations of Genetic Algorithms 3 (pp. 1-4). San Mateo, CA: Morgan Kaufmann.
Index Terms
- A new method for modeling the behavior of finite population evolutionary algorithms
Recommendations
Population Diversity as a Selection Factor: Improving Fitness by Increasing Diversity
GECCO '16 Companion: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference CompanionEvolutionary algorithms search for problem solutions by selecting individuals for survival and reproduction with a bias towards higher fitness. Such biases may lead to premature convergence on sub-optimal solutions. A bias toward greater diversity can ...
Theoretical Analysis of Phenotypic Diversity in Real-Valued Evolutionary Algorithms With More-Than-One-Element Replacement
This paper investigates the evolutionary dynamics of steady-state real-valued evolutionary algorithms (RVEAs) with more-than-one-element replacement theoretically, whereas most theoretical studies of RVEAs have considered single-or all-element ...
Selection pressure and takeover time of distributed evolutionary algorithms
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationThis paper presents a theoretical study about the selection pressure and the convergence speed of distributed evolutionary algorithms (dEA). In concrete, we model the best individual's growth curve and the takeover time for usual models of ...
Comments
Information & Contributors
Information
Published In
Publisher
MIT Press
Cambridge, MA, United States
Publication History
Published: 01 September 2010
Published in EVOL Volume 18, Issue 3
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 115Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in