Symbiogenetic coevolution

David Wallin, Conor Ryan, R. Muhammad Atif Azad

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we introduce a cooperative coevolutionary 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.

Original languageEnglish
Title of host publication2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Pages1613-1620
Number of pages8
Publication statusPublished - 2005
Event2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 - Edinburgh, Scotland, United Kingdom
Duration: 2 Sep 20055 Sep 2005

Publication series

Name2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Volume2

Conference

Conference2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005
Country/TerritoryUnited Kingdom
CityEdinburgh, Scotland
Period2/09/055/09/05

Fingerprint

Dive into the research topics of 'Symbiogenetic coevolution'. Together they form a unique fingerprint.

Cite this