A tournament-based competitive coevolutionary algorithm
For an efficient competitive coevolutionary algorithm, it is important that competing populations be capable of maintaining a coevolutionary balance and hence, continuing evolutionary arms race to increase the levels of complexity. We propose a competitive coevolutionary algorithm that combines the strategies of neighborhood-based evolution, entry fee exchange tournament competition (EFE-TC) and localized elitism. An emphasis is placed on analyzing the effects of these strategies on the performance of competitive coevolutionary algorithms. We have tested the proposed algorithm with two adversarial problems: sorting network and Nim game problems that have different characteristics. The experimental results show that the interacting effects of the strategies appear to promote a balanced evolution between host and parasite populations, which naturally leads them to keep on evolutionary arms race. Consequently, the proposed algorithm provides good quality solutions with a little computation time.
competitive coevolutionary algorithm entry fee exchange tournament competition localized elitism sorting network