Skip to main content

The Effects of Diversity Maintenance on Coevolution for an Intransitive Numbers Problem

  • Conference paper
  • 2272 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7106))

Abstract

In this paper, we investigate the effectiveness of several techniques commonly recommended for overcoming convergence problems with coevolutionary algorithms. In particular, we investigate effects of the Hall of Fame, and of several diversity maintenance methods, on a problem designed to test the ability of coevolutionary algorithms to deal with an intransitive superiority relation between solutions. We measure and analyse the effects of these methods on population diversity and on solution quality.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Axelrod, R.: The evolution of strategies in the iterated Prisoner’s Dilemma. Genetic Algorithms and Simulated Annealing, 32–41 (1987)

    Google Scholar 

  2. de Jong, E., Stanley, K., Wiegand, P.: Introductory tutorial on coevolution. In: Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 3133–3157. ACM, New York (2007)

    Chapter  Google Scholar 

  3. Ficici, S.G.: Solution concepts in coevolutionary algorithms. Ph.D. Dissertation. Brandeis University (2004)

    Google Scholar 

  4. Hillis, W.D.: Coevolving parasites improve simulated evolution as an optimization procedure. Physica D: Nonlinear Phenomena 42, 228–234 (1990)

    Article  Google Scholar 

  5. Porter, M.A., de Jong, K.A.: A Cooperative Coevolutionary Approach to Function Optimization. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 249–257. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  6. Rosin, C.D.: Coevolutionary search among adversaries. Ph.D. Dissertation. University of California, San Diego (1997)

    Google Scholar 

  7. Wiegand, R.P.: An analysis of cooperative coevolutionary algorithms. George Mason University, Virginia (2003)

    Google Scholar 

  8. Rosin, C.D., Belew, R.K.: New methods for competitive coevolution. Evolutionary Computation 5, 1–29 (1997)

    Article  Google Scholar 

  9. Chong, S.Y., Tino, P., Yao, X.: Relationship between generalization and diversity in coevolutionary learning. IEEE Transactions on Computational Intelligence and AI in Games 1, 214–232 (2009)

    Article  Google Scholar 

  10. Mckay, R.I.: Fitness sharing in genetic programming. In: Proceedings of the Proceedings of the Genetic and Evolutionary Computation Conference, Las Vegas (2000)

    Google Scholar 

  11. Ray, T.S.: Evolution, complexity, entropy and artificial reality. Physica D: Nonlinear Phenomena, 239–263 (1993)

    Google Scholar 

  12. Rosca, J.P.: Entropy-driven adaptive representation. In: Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pp. 23–32 (1995)

    Google Scholar 

  13. Yao, X., Liu, Y.: How to Make Best Use of Evolutionary Learning. Complex Systems - From Local Interactions to Global Phenomena, 229–242 (1996)

    Google Scholar 

  14. Chong, S.Y., Tino, P., Yao, X.: Measuring Generalization Performance in Coevolutionary Learning. IEEE Transactions on Evolutionary Computation 12, 479–505 (2008)

    Article  Google Scholar 

  15. Casillas, J., Cordon, O., Herrera, F., Merelo, J.J.: A cooperative coevolutionary algorithm for jointly learning fuzzy rule bases and membership functions. Artificial Evolution, 1075–1105 (2002)

    Google Scholar 

  16. Ficici, S.G., Pollack, J.B.: Pareto Optimality in Coevolutionary Learning. In: Kelemen, J., Sosík, P. (eds.) ECAL 2001. LNCS (LNAI), vol. 2159, pp. 316–325. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Watson, R.A., Pollack, J.B.: Coevolutionary dynamics in a minimal substrate. In: Proceedings of the Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2001. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  18. Deb, K., Goyal, M.: A combined genetic adaptive search (gene AS) for Engineering Design. Computer Science and Informatics 26, 30–45 (1996)

    Google Scholar 

  19. Barker, J.E.: Adaptive Selection Methods for Genetic Algorithms. In: Proceedings of the 1st International Conference on Genetic Algorithms, Hillsdale, NJ, pp. 101–111 (1985)

    Google Scholar 

  20. Poli, R., Langdon, W.B.: A new schema theorem for genetic programming with one-point crossover and point mutation. Evolutionary Computation 6, 231–252 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ranjeet, T.R., Masek, M., Hingston, P., Lam, CP. (2011). The Effects of Diversity Maintenance on Coevolution for an Intransitive Numbers Problem. In: Wang, D., Reynolds, M. (eds) AI 2011: Advances in Artificial Intelligence. AI 2011. Lecture Notes in Computer Science(), vol 7106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25832-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25832-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25831-2

  • Online ISBN: 978-3-642-25832-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics