Skip to main content

NK-landscapes as Test Functions for Evaluation of Host-Parasite Algorithms

  • Conference paper
Parallel Problem Solving from Nature PPSN VI (PPSN 2000)

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

Included in the following conference series:

Abstract

Previous research on host-parasite algorithms has shown that the co-evolutionary arms race is difficult to sustain when the tasks faced by hosts and parasites are heavily asymmetric. We have therefore proposed an asymmetry-handling algorithm, AHPA, with a capacity for self-adapting the allocation of generations to hosts and parasites, so that the problem asymmetry is counteracted. In this paper we discuss the need for systematic evaluation of this algorithm, so that its behaviour under varying levels of asymmetry can be studied in detail. We propose the use of Kaufmann’s NK landscape model for this purpose, and show how the model can be adapted for the testing of host-parasite algorithms. Using the adapted model, we present simulation results which confirm AHPA’s ability to sustain a stable arms-race under varying levels of asymmetry.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.

    Google Scholar 

  2. W.D. Hillis. Co-evolving parasites improve simulated evolution as an optimization procedure. In C.G. Langton, C. Taylor, J.D. Farmer, and S. Rasmussen, editors, Artificial Life II: Proceedings of the Second Artificial Life Workshop, pages 313–324. Addison-Wesley, 1992.

    Google Scholar 

  3. S.A. Kaufmann. Adaptation on rugged fitness landscapes. In D.L. Stein, editor, Lectures in the Sciences of Complexity, Vol. 1, pages 527–618. Addison-Wesley, 1989.

    Google Scholar 

  4. S.A. Kaufmann. Principles of adaptation in complex systems. In D.L. Stein, editor, Lectures in the Sciences of Complexity, Vol. 1, pages 619–712. Addison-Wesley, 1989.

    Google Scholar 

  5. S.A. Kaufmann. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, 1993.

    Google Scholar 

  6. S.A. Kaufmann and S. Johnsen. Co-evolution to the edge of chaos: Coupled fitness landscapes, poised states, and co-evolutionary avalanches. In C.G. Langton, C. Taylor, J.D. Farmer, and S. Rasmussen, editors, Artificial Life II: Proceedings of the Second Artificial Life Workshop, pages 325–369. Addison-Wesley, 1992.

    Google Scholar 

  7. G. Mayley. The evolutionary cost of learning. In P. Maes, M. Mataric, J-A. Meyer, J. Pollack, and S.W. Wilson, editors, From Animals to Animats 4: Proceedings of the 4th International Conference on Simulation of Adaptive Behavior (SAB96). MIT Press/Bradford Books, 1996.

    Google Scholar 

  8. B. Olsson. Evaluation of a simple host-parasite genetic algorithm. In V.W. Porto, N. Saravanan, D. Waagen, and A.E. Eiben, editors, Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, pages 53–62. Springer-Verlag, 1998.

    Google Scholar 

  9. B. Olsson. A host-parasite genetic algorithm for asymmetric tasks. In C. Nédellec and C. Rouveirol, editors, Machine Learning: ECML-98 (Proceedings of the 9th European Conference on Machine Learning), pages 346–351. Springer-Verlag, 1998.

    Google Scholar 

  10. B. Olsson. Using evolutionary algorithms in the design of protein fingerprints. In W. Banzhaf and R.E. Daida, editors, GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, pages 1636–42. Morgan Kaufmann, 1999.

    Google Scholar 

  11. B. Olsson. Co-evolutionary search in asymmetric spaces. In Proceedings of the Third International Workshop on Frontiers in Evolutionary Algorithms, 2000.

    Google Scholar 

  12. J. Paredis. Steps towards co-evolutionary classification networks. In R.A. Brooks and P. Maes, editors, Artificial Life IV, Proceedings of the fourth International Workshop on the Synthesis and Simulation of Living Systems. MIT Press, 1994.

    Google Scholar 

  13. M.A. Potter. The Design and Analysis of a Computational Model of Cooperative Coevolution. PhD thesis, George Mason University, 1997.

    Google Scholar 

  14. C.D. Rosin. Coevolutionary Search Among Adversaries. PhD thesis, University of California, San Diego, 1997.

    Google Scholar 

  15. C.D. Rosin and R.K. Belew. Methods for competitive co-evolution: Finding opponents worth beating. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95). Morgan Kaufmann, 1995.

    Google Scholar 

  16. C.D. Rosin and R.K. Belew. New methods for competetive coevolution. Evolutionary Computation, 5(1):1–29, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olsson, B. (2000). NK-landscapes as Test Functions for Evaluation of Host-Parasite Algorithms. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_48

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics