Adaptive mutation with fitness and allele distribution correlation for genetic algorithms

ABSTRACT

In this paper, a new gene based adaptive mutation scheme is proposed for genetic algorithms (GAs), where the information on gene based fitness statistics and on gene based allele distribution statistics are correlated to explicitly adapt the mutation probability for each gene locus over time. A convergence control mechanism is combined with the proposed mutation scheme to maintain sufficient diversity in the population. Experiments are carried out to compare the proposed mutation scheme to traditional mutation and two advanced adaptive mutation schemes on a set of optimization problems. The experimental results show that the proposed mutation scheme efficiently improves GA's performance.

REFERENCES

• 1: T. Bäck. Self-adaptation in genetic algorithms. In Proc. of the 1st European Conf. on Artificial Life, pages 263--271, 1992.
• 2: T. Bäck. Mutation parameters. In T. Bäck, D. B. Fogel, and Z. Michalewicz (eds.), Handbook of Evolutionary Computation, E1.2.1-E1.2.7, 1997. Oxford University Press.
• 3: Terence C. Fogarty, Varying the Probability of Mutation in the Genetic Algorithm, Proceedings of the 3rd International Conference on Genetic Algorithms, p.104-109, June 01, 1989
• 4: David E. Goldberg, The Design of Innovation: Lessons from and for Competent Genetic Algorithms, Kluwer Academic Publishers, Norwell, MA, 2002
• 5: Jürgen Hesser , Reinhard Männer, Towards an Optimal Mutation Probability for Genetic Algorithms, Proceedings of the 1st Workshop on Parallel Problem Solving from Nature, p.23-32, October 01-03, 1990
• 6: Bryant A. Julstrom, What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm, Proceedings of the 6th International Conference on Genetic Algorithms, p.81-87, July 15-19, 1995
• 7: H. Mühlenbein. How genetic algorithms really work: I. mutation and hillclimbing. In Parallel Problem Solving from Nature 2, pages 15--29, 1992.
• 8: J. David Schaffer , Rich Caruana , Larry J. Eshelman , Rajarshi Das, A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization, Proceedings of the 3rd International Conference on Genetic Algorithms, p.51-60, June 01, 1989
• 9: J. E. Smith and T. C. Fogarty. Self-adaptation of mutation rates in a steady-state genetic algorithm. In Proc. of the 3rd IEEE Conf. on Evolutionary Computation, pages 318--323, 1996.
• 10: W. Spears. Crossover or mutation. In Foundations of Genetic Algorithms 2, 1992.
• 11: D. Thierens. Adaptive mutation control schemes in genetic algorithms. In Proc. of the 2002 Congress on Evolutionary Computation, 2002.
• 12: A. Tuson and P. Ross. Adapting operator settings in genetic algorithms. Evol. Comput., 6(2):161--184, 1998.
• 13: S. Uyar, S. Sariel, and G. Eryigit. A gene based adaptive mutation strategy for genetic algorithms. Proc. of the 2004 Genetic and Evolutionary Computation Conference, 2004.
• 14: S. Yang. Adaptive mutation using statistics mechanism for genetic algorithms. In F. Coenen, A. Preece and A. Macintosh (editors), Research and Development in Intelligent Systems XX, pages 19--32, 2003. London: Springer-Verlag.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search

General Terms:
Algorithms, Experimentation, Performance

Keywords:
fitness and allele distribution correlation, gene based adaptive mutation, genetic algorithms