Genetic fitness optimization using rapidly mixing Markov chains

  • Paul Vitányi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1160)


A notion of highly probable fitness optimization through evolutionary computing runs on small size populations in a very general setting is proposed. This has applications to evolutionary learning. Based on rapidly mixing Markov chains, the approach pertains to most types of evolutionary genetic algorithms, genetic programming and the like. For systems having associated rapidly mixing Markov chains and appropriate stationary distributions the new method finds optimal programs (individuals) with probability almost 1. Algorithmically, the novel approach prescribes a strategy of executing many short computation runs, rather than one long computation run. Given an arbitrary evolutionary program it may be infeasible to determine whether its associated matrix is rapidly mixing. In our proposed structured evolutionary program discipline, the development of the program and the guaranty of the rapidly mixing property go hand in hand. We conclude with a tentative toy example.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T.E. Davis and J.C. Principe, A simulated annealing like convergence theory for the simple genetic algorithm, Proc. 4th Int'l Conf. Genet. Algorithms, Morgan Kaufmann, 1991, 174–181.Google Scholar
  2. 2.
    P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains, The Annals of Applied Probability, 1:1(1991), 36–61.Google Scholar
  3. 3.
    J.A. Fill, Eigenvalue bounds on convergence to stationary for nonreversible Markov chains, with an application to the exclusion process, The Annals of Applied Probability, 1:1(1991), 62–87.Google Scholar
  4. 4.
    D.E. Goldberg, Sizing populations for serial and parallel genetic algorithms, Proc. 3rd Int'nl Conf. Genet. Algorithms, Morgan Kaufmann, 1989, 70–79.Google Scholar
  5. 5.
    J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, 1975.Google Scholar
  6. 6.
    K.A. de Jong and W.M. Spears, Using genetic algorithms to solve NP-complete problems, Proc. 3rd Int'nl Conf. Genet. Algorithms, Morgan Kaufmann, 1989, 124–132.Google Scholar
  7. 7.
    K.A. de Jong, W.M. Spears, and D.F. Gordon, Using Markov chains to analyze GAFOs, draft version for FOGA94 Proceedings, 1994.Google Scholar
  8. 8.
    M. Li and P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, 1993.Google Scholar
  9. 9.
    M. Mihail, Conductance and convergence of Markov chains: a combinatorial treatment of expanders. Proc. 30th IEEE Symp. Foundat. Comput. Science, 1989, 526–531.Google Scholar
  10. 10.
    A.E. Nix and M.D. Vose, Modeling genetic algorithms with Markov chains, Annals of Mathematics and Artificial Intelligence, 5(1992), 79–88.CrossRefGoogle Scholar
  11. 11.
    A. Sinclair, Algorithms for Random Generation and Counting, A Markov Chain Approach, Birkhäuser, 1992.Google Scholar
  12. 12.
    Y. Rabinovitch, A. Sinclair and A. Wigderson, Quadratic dynamical systems, Proc. 33rd IEEE Symp. Foundat. Comput. Science, 1992.Google Scholar
  13. 13.
    Y. Rabani, Y. Rabinovitch, and A. Sinclair, A computational view of population genetics, Proc. 27th ACM Symp. Theor. Comput., 1995.Google Scholar
  14. 14.
    C.R. Reeves, Using genetic algorithms with small populations, Proc. 5th Int'nl Conf. Genet. Algorithms, Morgan Kaufmann, 1993, 92–99.Google Scholar
  15. 15.
    G. Rudolf, Convergence analysis of canonical genetic algorithms, IEEE Trans. Neural Networks, 5:1(1994), 96–101.Google Scholar
  16. 16.
    J. Suzuki, A Markov chain analysis on simple genetic algorithms, IEEE Trans. Systems, Man, and Cybernetics, 25:4(1995), 655–659.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  1. 1.CWISJ AmsterdamThe Netherlands

Personalised recommendations