This paper shows that the performance of coevolutionary genetic algorithms can be improved considerably by introducing a balancing mechanism. This is to prevent one population from “out-evolving” the other one. As a result, fitness variance is maintained and can be used to guide coevolution. Two different balancing mechanisms are introduced here. Their performance is compared to an unbalanced coevolutionary genetic algorithm. Finally, causal links are suggested between: a lack of balance, the loss of important niches and coevolutionary cycles.
CITATION STYLE
Paredis, J. (2000). Towards balanced coevolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1917, pp. 497–506). Springer Verlag. https://doi.org/10.1007/3-540-45356-3_49
Mendeley helps you to discover research relevant for your work.