Modelling genetic algorithms: From Markov chains to dependence with complete connections

  • Alexandru Agapie
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1498)


The paper deals with homogeneous stochastic models of the binary, finite-population Genetic Algorithm. Previous research brought the Markov chain analysis up to sufficient convergence conditions for the elitist case. In addition, we point out a condition that is both necessary and sufficient, for the general case convergence. Next, we present an example of algorithm, which is globally convergent yet not elitist. Considering this type of Markov chain analysis reached its end, we indicate another type of random systems — with complete connections — promising better results in real Genetic Algorithms modelling.


Genetic Algorithm Markov Chain Simple Genetic Algorithm Recurrent State Markov Chain Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aarts, E.H.L., Eiben, A.E., Van Hee, K.M.: A General Theory of Genetic Algorithms. Computing Science Notes, Eindhoven University of Technology, (1989)Google Scholar
  2. 2.
    Agapie, A.: Genetic Algorithms: Minimal Conditions for Convergence. LNCS series 1363, Artificial Evolution, Springer (1998) 183–193.Google Scholar
  3. 3.
    Bäck, T.: The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. PPSN 2, Amsterdam: North Holland (1992) 85–94Google Scholar
  4. 4.
    Davis, T.E., Principe, J.C.: A Markov Chain Framework for the Simple Genetic Algorithm. Evol. Comp. 1, Vol. 3 (1993) 269–288Google Scholar
  5. 5.
    Eiben, A.E., Aarts, E.H.L, Van Hee, K.M.: Global Convergence of Genetic Algorithms: a Markov Chain Analysis. PPSN 1, Springer, Berlin (1990) 4–12Google Scholar
  6. 6.
    Fogel, D.B.: Evolutionary Computation — Toward a New Philosophy of Machine Intelligence. IEEE Press (1995) 121–143Google Scholar
  7. 7.
    Goldberg, D.E., Segrest, P.: Finite Markov chain analysis of genetic algortihms. Proc. ICGA '87 (1987) 1–8Google Scholar
  8. 8.
    Holland, J.H.: Adaptation in natural and artificial systems. Ann. Arbor, The Univ. of Michigan Press (1975)Google Scholar
  9. 9.
    Horn, J.: Finite Markov Chain Analysis of Genetic Algorithms with Niching. Proc. ICGA '93 (1993) 110–117Google Scholar
  10. 10.
    Iosifescu, M.: Finite Markov chains and applications. Techn. Publ., Bucharest, (1977)Google Scholar
  11. 11.
    Iosifescu, M.: Finite Markov Processes and Their Applications. Chichester: Wiley (1980)Google Scholar
  12. 12.
    Iosifescu, M., Grigorescu, S.: Dependence with complete connections and its applications. Cambridge Univ. Press (1990)Google Scholar
  13. 13.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. 2nd ed., Springer-Verlag (1994) 64–69Google Scholar
  14. 14.
    Muehlenbein, H.: How genetic algorithms really work I: Mutation and hillclimbing. PPSN 2, Amsterdam: North Holland (1992) 15–25Google Scholar
  15. 15.
    Nix, A.E., Vose, M.D.: Modelling genetic algorithms with Markov chains. Ann. Math. and AI 5 (1992) 79–88zbMATHMathSciNetGoogle Scholar
  16. 16.
    Rudolph, G.: Convergence Analysis of Canonical Genetic Algorithms. IEEE Tr. on NN. 1, Vol. 5 (1994) 98–101Google Scholar
  17. 17.
    Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Kovac, Hamburg (1997)Google Scholar
  18. 18.
    Qi, X., Palmieri, F.: Theoretical Analysis of Evolutionary Algorithms, I–II. IEEE Tr. on NN. 1, Vol. 5 (1994) 102–129Google Scholar
  19. 19.
    Seneta, E.: Non-negative Matrices and Markov Chains. 2nd ed. Springer, New York (1981)Google Scholar
  20. 20.
    Salomon, R.: Raising Theoretical Questions about the Utility of Genetic Algorithms. Proc. EP '97, LNCS Series, Springer (1997) 275–284Google Scholar
  21. 21.
    Suzuki, J.: A Markov Chain Analysis of a Genetic Algorithm. Proc. ICGA'93, Urbana Illinois, Morgan Kaufmann (1993) 46–153 bibitem22 Uesaka, Y.: Convergence of algorithm and the schema theorem in genetic algorithms Proc. ICANGA (1995) 210–213Google Scholar
  22. 22.
    Vose, M.D.: Modelling Simple Genetic Algorithms. Foundations of Genetic Algorithms II, San Mateo, CA: Morgan Kaufmann (1993) 63–73Google Scholar
  23. 23.
    Whitley, D.: Modelling Hybrid Genetic Algorithms. Genetic Algorithms in Engineering and Computer Science, Wiley (1995) 191–201Google Scholar
  24. 24.
    Wolpert D., Macready, W.: No Free Lunch Theorems for Optimization. IEEE Tr. on EC. 1, Vol. 1 (1997) 67–82Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Alexandru Agapie
    • 1
  1. 1.Computational Intelligence Lab.National Institute of MicrotechnologyBucharestRomania

Personalised recommendations