A Host-Parasite Genetic Algorithm for Asymmetric Tasks
Abstract
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.
Cite
Text
Olsson. "A Host-Parasite Genetic Algorithm for Asymmetric Tasks." European Conference on Machine Learning, 1998. doi:10.1007/BFB0026705Markdown
[Olsson. "A Host-Parasite Genetic Algorithm for Asymmetric Tasks." European Conference on Machine Learning, 1998.](https://mlanthology.org/ecmlpkdd/1998/olsson1998ecml-hostparasite/) doi:10.1007/BFB0026705BibTeX
@inproceedings{olsson1998ecml-hostparasite,
title = {{A Host-Parasite Genetic Algorithm for Asymmetric Tasks}},
author = {Olsson, Björn},
booktitle = {European Conference on Machine Learning},
year = {1998},
pages = {346-351},
doi = {10.1007/BFB0026705},
url = {https://mlanthology.org/ecmlpkdd/1998/olsson1998ecml-hostparasite/}
}