Adapting mutations in genetic algorithms using gene flow principles

G.W. Greenwood · 2004

Bit mutation in genetic algorithms is usually done with a single fixed probability. Methods to adapt this probability have been suggested, but they operate at the genome level. This paper describes a gene level adaption scheme, based on allele frequencies, which gives a better escape from local optima.

Read the paper · More papers on PaperTik