Abstract
Application of the isotropic distribution based on an \(\alpha \)-stable generator \(S\alpha SU(\sigma )\) (3.57) to a mutation operator in evolutionary algorithms seems to be closest to our purpose, which is the elimination of the dead surrounding effect. This conclusion stems from the fact that the random variable \(\Vert X \Vert \), where \(X\sim S\alpha SU(\sigma )\), depends only on the generating variable \(\Vert R \Vert \) and not on the space dimension n (or a proof, see (3.59)). Also, we hope that this fact weakens the dead surrounding effect, so important in the case of \(NS\alpha S(\varvec{\sigma })\) and \(IS\alpha S(\sigma )\). Can it be eliminated completely? We try to answer this question using an experiment described in the first section. Next, like in Chap. 5, the local convergence analysis of the\((1+1)\)ES\(_{S;\alpha }\) and \((1+\lambda )\)ES\(_{S;\alpha }\) strategies, as well as simulation research on exploration and exploitation abilities of the ESTS\(_{S;\alpha }\) algorithms, is presented. Finally simulation analysis of the ESSS\(_{S;\alpha }\) algorithms’ effectiveness in chosen global optimization problems is presented.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Karcz-Dulęba, I. (2001). Dynamics of infinite populations envolving in a landscape of uni- and bimodal fitness functions. IEEE Transactions on Evolutionary Computation, 5(4), 398–409.
Karcz-Dulęba, I. (2004). Time to convergence of evolution in the space of population states. International Journal of Applied Mathematics and Computer Science, 14(3), 279–287.
Kim, N. G., Won, J. M., Lee, J. S., Kim, S. W. (2002). Local convergence rate of evolutionary algorithm with combined mutation operator. 2002 Congress on Evolutionary Computation (pp. 261–266). New York: IEEE Press.
Obuchowicz, A., & Prętki, P. (2005). Isotropic symmetric \({\alpha }\)-stable mutations for evolutionary algorithms. IEEE Congress on Evolutionary Computation, Edinbourgh, UK (pp. 404–410).
Rudolph, G. (1997). Local convergence rates of simple evolutionary algorithms with Cauchy mutations. IEEE Transactions on Evolutionary Computation, 1(4), 249–258.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Obuchowicz, A. (2019). Isotropic Mutation Based on an \(\alpha \)-Stable Generator. In: Stable Mutations for Evolutionary Algorithms. Studies in Computational Intelligence, vol 797. Springer, Cham. https://doi.org/10.1007/978-3-030-01548-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-01548-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01547-3
Online ISBN: 978-3-030-01548-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)