Skip to main content

Finite Population Models of Co-evolution and Their Application to Haploidy versus Diploidy

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Abstract

In order to study genetic algorithms in co-evolutionary environments, we construct a Markov model of co-evolution of populations with fixed, finite population sizes. In this combined Markov model, the behavior toward the limit can be utilized to study the relative performance of the algorithms. As an application of the model, we perform an analysis of the relative performance of haploid versus diploid genetic algorithms in the co-evolutionary setup, under several parameter settings. Because of the use of Markov chains, this paper provides exact stochastic results on the expected performance of haploid and diploid algorithms in the proposed co-evolutionary model.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. G. Ficici, O. Melnik, and J. B. Pollack. A game-theoretic investigation of selection methods used in evolutionary algorithms. In Proceedings of the 2000 Congress on Evolutionary Computation, 2000.

    Google Scholar 

  2. S. G. Ficici and J. B. Pollack. A game-theoretic approach to the simple coevolutionary algorithm. In Parallel Problem Solving from Nature VI, 2000.

    Google Scholar 

  3. C. D. Rosin. Coevolutionary search among adversaries. PhD thesis, San Diego, CA, 1997.

    Google Scholar 

  4. A. Lubberts and R. Miikkulainen. Co-evolving a go-playing neural network. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 14–19, 2001.

    Google Scholar 

  5. D. Hillis. Co-evolving parasites improve simulated evolution as an optimization procedure. In Artificial Life II. Addison Wesley, 1992.

    Google Scholar 

  6. D. Floreano, F. Mondada, and S. Nolfi. Co-evolution and ontogenetic change in competing robots. In Robotics and Autonomous Systems, 1999.

    Google Scholar 

  7. D. E Goldberg and R. E. Smith. Nonstationary function optimization using genetic algorithms with dominance and diploidy. In Second International Conference on Genetic Algorithms, pages 59–68, 1987.

    Google Scholar 

  8. J. Lewis, E. Hart, and G. Ritchie. A comparison of dominance mechanisms and simple mutation on non-stationary problems. In Parallel Problem Solving from Nature V, pages 139–148, 1998.

    Google Scholar 

  9. K. P. Ng and K. C. Wong. A new diploid scheme and dominance change mechanism for non-stationary function optimization. In 6th Int. Conf. on Genetic Algorithms, pages 159–166, 1995.

    Google Scholar 

  10. R. E. Smith and D. E. Goldberg. Diploidy and dominance in artificial genetic search. Complex Systems, 6:251–285, 1992.

    MATH  Google Scholar 

  11. A. M. L. Liekens, H. M. M. ten Eikelder, and P. A. J. Hilbers. Finite population models of dynamic optimization with alternating fitness functions. In GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, 2003.

    Google Scholar 

  12. A. E. Nix and M. D. Vose. Modelling genetic algorithms with markov chains. Annals of Mathematics and Artificial Intelligence, pages 79–88, 1992.

    Google Scholar 

  13. A. M. L. Liekens, H. M. M. ten Eikelder, and P. A. J. Hilbers. Modeling and simulating diploid simple genetic algorithms. In Foundations of Genetic Algorithms VII, 2003.

    Google Scholar 

  14. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentice-Hall, 1989.

    Google Scholar 

  15. J. W. Weibull. Evolutionary Game Theory. MIT Press, Cambridge, Massachusetts, 1995.

    MATH  Google Scholar 

  16. J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics. Cambridge University Press, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liekens, A.M.L., ten Eikelder, H.M.M., Hilbers, P.A.J. (2003). Finite Population Models of Co-evolution and Their Application to Haploidy versus Diploidy. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics