Abstract
The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution. It is shown that there is a broad class of alternative mutation distributions offering local convergence rates being asymptotical equal to the convergence rates achieved with normally distributed mutations. Such mutation distributions must be factorizing and the absolute fourth moments must be finite. Under these conditions an asymptotical theory of the convergence rates of simple evolutionary algorithms can be established for the entire class of distributions.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Kappler. Are evolutionary algorithms improved by large mutations? In H.M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature-PPSN IV, pages 346–355. Springer, Berlin, 1996.
X. Yao and Y. Liu. Fast evolutionary programming. In L. J. Fogel, P. J. Angeline, and T. Bäck, editors, Proceedings of the Fifth Annual Conference on Evolutionary Programming, pages 451–460. MIT Press, Cambridge (MA), 1996.
X. Yao and Y. Liu. Fast evolution strategies. In P. J. Angeline, R. G. Reynolds, J. R. McDonnell, and R. Eberhart, editors, Proceedings of the Sixth Annual Conference on Evolutionary Programming, pages 151–161. Springer, Berlin, 1997.
W. Feller. An Introduction to Probability Theory and Its Applications, Vol. 2. Wiley, New York, 2nd edition, 1971.
T. Bäck, G. Rudolph, and H.-P. Schwefel. Evolutionary programming and evolution strategies: Similarities and differences. In D. B. Fogel and W. Atmar, editors, Proceedings of the 2nd Annual Conference on Evolutionary Programming, pages 11–22. Evolutionary Programming Society, La Jolla (CA), 1993.
I. Rechenberg. Evolutions-strategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart, 1973.
Y. S. Chow and H. Teicher. Probability Theory. Springer, New York, 1978.
G. Rudolph. Convergence Properties of Evolutionary Algorithms. Kovač, Hamburg, 1997.
B. V. Gnedenko and A. N. Kolmogorov. Limit Distributions for Sums of Independent Random Variables. Addison-Wesley, Reading (MA), revised edition, 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rudolph, G. (1998). Asymptotical convergence rates of simple evolutionary algorithms under factorizing mutation distributions. In: Hao, JK., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1997. Lecture Notes in Computer Science, vol 1363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026603
Download citation
DOI: https://doi.org/10.1007/BFb0026603
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64169-8
Online ISBN: 978-3-540-69698-8
eBook Packages: Springer Book Archive