A host-parasite genetic algorithm for asymmetric tasks

  • Björn Olsson
Genetic Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1398)


We present a formalisation of host-parasite coevolution in Evolutionary Computation [2]. The aim is to gain a better understanding of host-parasite Genetic Algorithms (GAs) [3]. We discuss Rosin's [10] competetive theory of games, and show how it relates to host-parasite GAs. We then propose a new host-parasite optimisation algorithm based on this formalisation. The new algorithm takes into account the asymmetry of the two tasks: evolving hosts and evolving parasites. By self-adaptation the algorithm can find a suitable balance between the amount of resources spent on these two tasks. Our results show that this makes it possible to evolve optimal solutions by testing fewer candidates.


Evolutionary Computation Genetic Algorithms Coevolution 


  1. 1.
    D. Cliff and G.F. Miller. Co-evolution of pursuit and evasion ii: Simulation methods and results. In From Animals to Animals 4: Proc. of the 4th Intern. Conf. on Simulation of Adaptive Behavior (SAB96), 1996.Google Scholar
  2. 2.
    D.B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, 1995.Google Scholar
  3. 3.
    D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.Google Scholar
  4. 4.
    D. Hillis. Co-evolving parasites improve simulated evolution as an optimization procedure. In Proceedings of the 2nd Conf. on Artificial Life, 1992.Google Scholar
  5. 5.
    B. Olsson. Optimization using a host-parasite model with variable-size distributed populations. In Proceedings of the 1996 IEEE 3rd International Conference on Evolutionary Computation. IEEE Press, 1996.Google Scholar
  6. 6.
    B. Olsson. Evaluation of a simple host-parasite genetic algorithm. In Proc. of the 7th Annual Conf. on Evolutionary Programming, 1997.Google Scholar
  7. 7.
    J. Paredis. Steps towards co-evolutionary classification networks. In Proc. the 4th Conference on Artifical Life, 1994.Google Scholar
  8. 8.
    M.A. Potter. The Design and Analysis of a Computational Model of Cooperative Coevolution. PhD thesis, George Mason University, 1997.Google Scholar
  9. 9.
    C.D. Rosin. Coevolutionary Search Among Adversaries. PhD thesis, University of California, San Diego, 1997.Google Scholar
  10. 10.
    C.D. Rosin and R.K. Belew. A competetive approach to game learning. In Proc. of the 9th Annual ACM Conf. on Computational Learning Theory, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Björn Olsson
    • 1
  1. 1.Dept. of Computer ScienceUniversity of SkövdeSkövdeSweden

Personalised recommendations