Hybrid Evolutionary Search Method Based on Clusters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to creative evolutionary systems
Creative evolutionary systems
A Comparison of Evolution Strategies with Other Direct Search Methods in the Presence of Noise
Computational Optimization and Applications
A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search
Evolutionary Computation
A new optimization method: big bang-big crunch
Advances in Engineering Software
Robustness of Isotropic Stable Mutations in a General Search Space
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Foundations of Directed Mutation
Proceedings of the 2006 conference on Integrated Intelligent Systems for Engineering Design
A new optimization method: Big Bang-Big Crunch
Advances in Engineering Software
Computing gap free pareto front approximations with stochastic search algorithms
Evolutionary Computation
A particle gradient evolutionary algorithm based on statistical mechanics and convergence analysis
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Evolutionary algorithms with stable mutations based on a discrete spectral measure
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
When do heavy-tail distributions help?
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Convergence analysis and improvements of quantum-behaved particle swarm optimization
Information Sciences: an International Journal
Self organization for area coverage maximization and energy conservation in mobile ad hoc networks
Transactions on Computational Science XV
An improved swarm optimized functional link artificial neural network (ISO-FLANN) for classification
Journal of Systems and Software
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
Fundamenta Informaticae
Nonparametric estimation of multivariate elliptic densities via finite mixture sieves
Journal of Multivariate Analysis
| Hi-index | 0.00 |
The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution; however other distributions, especially some versions of the multivariate Cauchy distribution, have recently gained increased popularity in practical applications. Here the extent to which Cauchy mutation distributions may affect the local convergence behavior of evolutionary algorithms is analyzed. The results show that the order of local convergence is identical for Gaussian and spherical Cauchy distributions, whereas nonspherical Cauchy mutations lead to slower local convergence. As a by-product of the analysis, some recommendations for the parametrization of the self-adaptive step size control mechanism can be derived