Skip to main content

Theory of Coevolutionary Genetic Algorithms

  • Conference paper
  • First Online:
Parallel and Distributed Processing and Applications (ISPA 2003)

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

Abstract

We discuss stochastic modeling of scaled coevolutionary genetic algorithms (coevGA) which converge asymptotically to global optima. In our setting, populations contain several types of interacting creatures such that for some types (appropriately defined) globally maximal creatures exist. These algorithms particularly demand parallel processing in view of the nature of the fitness function. It is shown that coevolutionary arms races yielding global optima can be implemented in a procedure similar to simulated annealing.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.H.L. Aarts, P.J.M. van Laarhoven. Simulated Annealing: An Introduction. Statist. Neerlandica 43 (1989) 31–52

    Article  MATH  MathSciNet  Google Scholar 

  2. H.-G. Beyer, et al.. How to analyse evolutionary algorithms, Theoret. Comput. Sci. 287 (2002) 101–130

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Bucci, J.B. Pollack: A Mathematical Framework for the Study of Coevolution. In: C. Cotta, et al. (chairs). Proc. of FOGA VII. Morgan Kaufmann, San Francisco, CA, USA (2003)

    Google Scholar 

  4. T.E. Davis, J.C. Principe: A Markov Chain Framework for the Simple Genetic Algorithm. Evol. Comput. 1 (1993) 269–288

    Article  Google Scholar 

  5. K. De Jong: Lecture on Coevolution. In: H.-G. Beyer, et al. (chairs). Seminar “Theory of Evolutionary Computation 2002”, Max Planck Inst. for Comput. Sci. Conf. Cent., Schloß Dagstuhl, Saarland, Germany (2002)

    Google Scholar 

  6. D.E. Goldberg: Genetic Algorithms, in Search, Optimization & Machine Learning. Addison-Wesley, Boston, MA, USA (1989)

    MATH  Google Scholar 

  7. D.L. Isaacson, R.W. Madsen. Markov Chains: Theory and Applications Prentice-Hall, Upper Saddle River, NJ, USA (1961)

    Google Scholar 

  8. A.E. Nix, M.D. Vose: Modeling Genetic Algorithms with Markov Chains. Ann. Math. Artif. Intell. 5 (1992) 79–88

    Article  MATH  MathSciNet  Google Scholar 

  9. H.H. Schaefer. Banach Lattices and Positive Operators. Springer Verlag, Berlin, Berlin, Germany (1974)

    MATH  Google Scholar 

  10. L.M. Schmitt, et al.. Linear Analysis of Genetic Algorithms. Theoret. Comput. Sci. 200 (1998) 101–134

    Article  MATH  MathSciNet  Google Scholar 

  11. L.M. Schmitt, C.L. Nehaniv: The Linear Geometry of Genetic Operators with Applications to the Analysis of Genetic Drift and Genetic Algorithms using Tournament Selection. Lect. on Math. in the Life Sci. 26, AMS, Providence, RI, USA (1999) 147–166

    Google Scholar 

  12. L.M. Schmitt. Theory of Genetic Algorithms. Theoret. Comput. Sci. 259 (2001) 1–61

    Article  MATH  MathSciNet  Google Scholar 

  13. L.M. Schmitt: Theory of Genetic Algorithms II. —Convergence to optima for arbitrary fitness function—. Tech. Rep. 2002-2-002, Aizu Univ. (2002). To app. in Theoret. Comput. Sci.

    Google Scholar 

  14. L.M. Schmitt: Asymptotic Convergence of Scaled Genetic Algorithms to Global Optima — A gentle introduction to the theory. In: A. Menon (ed.), Computing Horizons: The Hilbert Challenge Essays on the Frontiers of Evolutionary Computation. (to app.). Kluwer Ser. in Evol. Comput. (D.E. Goldberg, ed.), Kluwer, Dordrecht, The Netherlands (2003)

    Google Scholar 

  15. L.M. Schmitt: Coevolutionary Convergence to Global Optima. Tech. Rep. 2003-2-002, Aizu Univ. (2003), 1–12. Poster in Proc. GECCO 2003, Lect. Notes in Comput. Sci., Springer Verlag, Berlin, Berlin, Germany (2003)

    Google Scholar 

  16. L.M. Schmitt: Optimization with Genetic Algorithms in Multi-Species Environments. To appear: Proc. ICCIMA’03, Int. Conf. on Comput. Intelligence and Multimedia Appl., IEEE Press, New York, NY (2003)

    Google Scholar 

  17. K.O. Stanley, R. Miikkulainen: Continual Coevolution Through Complexification. In: W.B. Langdon, et al. (eds.). Proc. GECCO 2002. Morgan Kaufmann, San Francisco, CA, USA (2003) 113–120

    Google Scholar 

  18. M.D. Vose: The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA, USA (1999)

    MATH  Google Scholar 

  19. M.D. Vose, G.E. Liepins: Punctuated Equilibria in Genetic Search. Complex Systems 5 (1991) 31–44

    MATH  MathSciNet  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

Schmitt, L.M. (2003). Theory of Coevolutionary Genetic Algorithms. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics