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...
Evolution strategies with q-Gaussian mutation, which allows the self-adaptation of the mutation dist...
There is a rife problem of premature convergence to local optimum in genetic algorithms. One of feas...
Abstract. A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator ins...
The standard choice for mutating an individual of an evolutionary algorithm with continuous variable...
The standard choice for mutating an individual of an evolutionary algorithm with continuous variable...
The standard choice for mutating an individual of an evolutionary algorithm with continuous variable...
Evolution strategies are a class of general optimisation algorithms which are applicable to function...
The self-adaptation of the mutation distribution is a distinguishing feature of evolutionary algorit...
Self-adaptive mutations are known to endow evolutionary algorithms (EAs) with the ability of locatin...
Self-adaptive mutations are known to endow evolutionary algorithms (EAs) with the ability of locatin...
The self-adaptation of the mutation distribution is a distinguishing feature of evolutionary algorit...
International audienceRandomization is an efficient tool for global optimization. We here define a m...
Abstract—The fast evolutionary programming (FEP) intro-duced the Cauchy distribution into its mutati...
Abstract. Hitting times of the global optimum for evolutionary algo-rithms are usually available for...
. The problem of setting the mutation step-size for real-coded evolutionary algorithms has received ...
Evolution strategies with q-Gaussian mutation, which allows the self-adaptation of the mutation dist...
There is a rife problem of premature convergence to local optimum in genetic algorithms. One of feas...
Abstract. A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator ins...
The standard choice for mutating an individual of an evolutionary algorithm with continuous variable...
The standard choice for mutating an individual of an evolutionary algorithm with continuous variable...
The standard choice for mutating an individual of an evolutionary algorithm with continuous variable...
Evolution strategies are a class of general optimisation algorithms which are applicable to function...
The self-adaptation of the mutation distribution is a distinguishing feature of evolutionary algorit...
Self-adaptive mutations are known to endow evolutionary algorithms (EAs) with the ability of locatin...
Self-adaptive mutations are known to endow evolutionary algorithms (EAs) with the ability of locatin...
The self-adaptation of the mutation distribution is a distinguishing feature of evolutionary algorit...
International audienceRandomization is an efficient tool for global optimization. We here define a m...
Abstract—The fast evolutionary programming (FEP) intro-duced the Cauchy distribution into its mutati...
Abstract. Hitting times of the global optimum for evolutionary algo-rithms are usually available for...
. The problem of setting the mutation step-size for real-coded evolutionary algorithms has received ...
Evolution strategies with q-Gaussian mutation, which allows the self-adaptation of the mutation dist...
There is a rife problem of premature convergence to local optimum in genetic algorithms. One of feas...
Abstract. A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator ins...