The performance of polyploid evolutionary algorithms is improved both by having many chromosomes and by having many copies of each chromosome on symbolic regression problems
Rachel Cavill, Stephen L. Smith, Andy M. Tyrrell · 2005
This paper presents important new findings for a new method for evolving individual programs with multiple chromosomes. Previous results have shown that evolving individuals with multiple chromosomes produced improved results over evolving individuals with a single chromosome. The multiple chromosomes are organised along two axes; there are a number of different chromosomes and a number of copies of each chromosome. This paper investigates the effects which these two axes have on the performance of the algorithm; whether the improvement in performance comes from just one of these features or whether it is a combination of them both.