Using holey fitness landscapes to counteract premature convergence in evolutionary algorithms

Premature convergence is a persisting problem in evolutionary optimisation, in particular - genetic algorithms. While a number of methods exist to approach this issue, they usually require problem specific calibration or only partially resolve the issue, at best by delaying the premature convergence of an evolving population. Analytical models in biology show that resiliently diverse populations evolve on high-dimensional fitness landscapes with "holey" rather than "rugged" topographies, but the implications for artificial evolutionary systems remain largely unexplored. Here I show how holey fitness landscapes (HFLs) can be incorporated in an evolutionary algorithm and use this approach to investigate the ability of HFLs to maintain genetic diversity in an evolving population. The results indicate that an underlying HFL can counteract premature genetic convergence and sustain diversity. They also suggest that HFL may provide a flexible mechanism for dynamic creation and maintenance of subpopulations that concentrate their evolutionary search in different regions of the solution space. Finally, I discuss on-going work on using the HFL model in optimisation problems.

[1]  Uri Alon,et al.  Varying environments can speed up evolution , 2007, Proceedings of the National Academy of Sciences.

[2]  Tania G. Leishman,et al.  A Dual Phase Evolution Model of Adaptive Radiation in Landscapes , 2007, ACAL.

[3]  Sergey Gavrilets,et al.  PERSPECTIVE: MODELS OF SPECIATION: WHAT HAVE WE LEARNED IN 40 YEARS? , 2003, Evolution; international journal of organic evolution.

[4]  J. Gravner,et al.  Percolation on the fitness hypercube and the evolution of reproductive isolation. , 1997, Journal of theoretical biology.

[5]  Fitness landscapes in individual-based simulation models of adaptive radiation , 2007 .

[6]  M. Slatkin,et al.  Estimation of levels of gene flow from DNA sequence data. , 1992, Genetics.

[7]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[8]  N. Barton Fitness Landscapes and the Origin of Species , 2004 .

[9]  Sergey Gavrilets,et al.  PERSPECTIVE: MODELS OF SPECIATION: WHAT HAVE WE LEARNED IN 40 YEARS? , 2003, Evolution; international journal of organic evolution.

[10]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[11]  S. Dongen Graph clustering by flow simulation , 2000 .

[12]  M. Newman,et al.  Efficient Monte Carlo algorithm and high-precision results for percolation. , 2000, Physical review letters.

[13]  Sergey Gavrilets,et al.  Dynamic patterns of adaptive radiation. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Liu Jianqin,et al.  Premature convergence in genetic algorithm: analysis and prevention based on chaos operator , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[15]  Samir W. Mahfoud Niching methods for genetic algorithms , 1996 .

[16]  Motoo Kimura,et al.  A model of mutation appropriate to estimate the number of electrophoretically detectable alleles in a finite population*. , 1973, Genetical research.

[17]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[18]  David G. Green,et al.  Holey Fitness Landscapes and the Maintenance of Evolutionary Diversity , 2008, ALIFE.