Abstract
The performance of the evolutionary algorithms depends strongly upon the combined effect of the operators (e.g. mutation) and the mappings from genotype to phenotype space and phenotype to fitness space. We demonstrate, with the example of the canonical Genetic Algorithm (cGA) for parameter optimization, that the right choice of the mutation operator should depend on the genom position and we show that generally point-mutation alone might not be sufficient for the particular binary mapping in the cGA. We take up the idea from Evolution Strategy to mutate via addition of normally distributed random numbers and construct the point-mutation operator in a way to resemble this on average. This concrete approach for genetic algorithms is accompanied by more general remarks on the analysis of evolutionary algorithms in the first and the last section of this paper.
Preview
Unable to display preview. Download preview PDF.
References
Thomas Bäck. Self-adaptation in genetic algorithms. In Proceedings of the First European Conference on Artificial Life, pages 263–271, Paris, France, 1991. MIT Press.
Thomas Bäck and Hans-Paul Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1):1–23, 1993.
James Edward Baker. Adaptive selection methods for genetic algorithms. In John J. Grefenstette, editor, Proc. 1st International Conference on Genetic Algorithms and Their Applications, pages 101–111, Pittsburgh, PA, 1985. Lawrence Erlbaum Associates (Hillsdale, NJ, 1988).
Bronstein and Semendjajew. Taschenbuch der Mathematik. Verlag Harri Deutsch, 23 edition, 1987.
Terence C. Fogarty. Varying the probability of mutation in the genetic algorithm. In J. David Schaffer, editor, Proc. 3rd International Conference on Genetic Algorithms, pages 104–109, San Mateo, CA, 1989. Morgan Kaufmann Publishers.
Jürgen Hesser and Reinhard Männer. Towards an optimal mutation probability for genetic algorithms. In H.-P. Schwefel and Reinhard Männer, editors, Parallel Problem Solving from Nature PPSN, pages 23–32. Springer Verlag, 1990.
Bernhard Sendhoff and Martin Kreutz. Causality and the analysis of evolutionary algorithms, in preparation.
Bernhard Sendhoff and Martin Kreutz. Variable, genom-dependent mutation probability for genetic algorithms. Internal Report 95-07, Institut für Neuroinformatik, Ruhr-Universität Bochum, 44780 Bochum, Germany, 1995. availabe via WWW: http://www.neuroinformatik.ruhr-uni-bochum.de/ini/VS/PUB-LIST/1995/html/irini95.html.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sendhoff, B., Kreutz, M. (1996). Analysis of possible genome-dependence of mutation rates in genetic algorithms. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1996. Lecture Notes in Computer Science, vol 1143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032788
Download citation
DOI: https://doi.org/10.1007/BFb0032788
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61749-5
Online ISBN: 978-3-540-70671-7
eBook Packages: Springer Book Archive