Static and dynamic selection thresholds governing the accumulation of information in genetic algorithms using ranked populations

  • Authors:

  • John Milton;Paul J. Kennedy

  • Affiliations:

  • Faculty of Engineering and Information Technology, University of Technology, Sydney, Broadway, New South Wales 2007, Australia. miltonj77@bigpond.com;Faculty of Engineering and Information Technology, University of Technology, Sydney, Broadway, New South Wales 2007, Australia. paulk@it.uts.edu.au

  • Venue:
  • Evolutionary Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mutation applied indiscriminately across a population has, on average, a detrimental effect on the accumulation of solution alleles within the population and is usually beneficial only when targeted at individuals with few solution alleles. Many common selection techniques can delete individuals with more solution alleles than are easily recovered by mutation. The paper identifies static and dynamic selection thresholds governing accumulation of information in a genetic algorithm (GA). When individuals are ranked by fitness, there exists a dynamic threshold defined by the solution density of surviving individuals and a lower static threshold defined by the solution density of the information source used for mutation. Replacing individuals ranked below the static threshold with randomly generated individuals avoids the need for mutation while maintaining diversity in the population with a consequent improvement in population fitness. By replacing individuals ranked between the thresholds with randomly selected individuals from above the dynamic threshold, population fitness improves dramatically. We model the dynamic behavior of GAs using these thresholds and demonstrate their effectiveness by simulation and benchmark problems.