Symbiogenetic coevolution

In this paper we introduce a cooperative revolutionary algorithm based on the ideas of endosymbiosis. We compare it to a generational GA on two deceptive and decomposable problems and show that it has better scaling properties as the problem size increases. We then analyse what effect crossover and parasite mutation has on its performance and conclude that a high parasite mutation rate is preferred over a lower rate and that crossover has no, or a very small, effect on its performance.