Advanced Cauchy Mutation for Differential Evolution in Numerical Optimization

Abstract

Among many evolutionary algorithms, differential evolution (DE) has received much attention over the last two decades. DE is a simple yet powerful evolutionary algorithm that has been used successfully to optimize various real-world problems. Since it was introduced, many researchers have developed new methods for DE, and one of them makes use of a mutation based on the Cauchy distribution to increase the convergence speed of DE. The method monitors the results of each individual in the selection operator and performs the Cauchy mutation on consecutively failed individuals, which generates mutant vectors by perturbing the best individual with the Cauchy distribution. Therefore, the method can locate the consecutively failed individuals to new positions close to the best individual. Although this approach is interesting, it fails to take into account establishing a balance between exploration and exploitation. In this paper, we propose a sigmoid based parameter control that alters the failure threshold for performing the Cauchy mutation in a time-varying schedule, which can establish a good ratio between exploration and exploitation. Experiments and comparisons have been done with six conventional and six advanced DE variants on a set of 30 benchmark problems, which indicate that the DE variants assisted by the proposed algorithm are highly competitive, especially for multimodal functions.

Using an Improved Differential Evolution for Scheduling Optimization of Dual-Gantry Multi-Head Surface-Mount Placement Machine

“…Choi and Lee [19] proposed an ex-tended self-adaptive differential evolution algorithm which increases the greediness of jDE algorithm searchability. Choi et al [20] developed a sigmoid-based parameter control in order to alternate the failure threshold for performing the Cauchy mutation. In this case, the proposed algorithm, which advances the Cauchy mutation, can establish a good ratio between exploration and exploitation.…”

Improved elephant herding optimization using opposition-based learning and K-means clustering to solve numerical optimization problems

“…Liu et al (2020) presented a differential evolution algorithm with a new encoding mechanism and Cauchy mutation for optimizing large unequally spaced planar array layouts with the minimum element spacing constraint. Choi et al (2020) proposed a sigmoid based parameter control that alters the failure threshold for performing the Cauchy mutation in a time-varying schedule, which can establish a good ratio between exploration and exploitation. Wang et al (2020) proposed a yin-yang firefly algorithm based on dimensionally Cauchy mutation for performance improvement of FA.…”

Elite Representative Based Individual Adaptive Regeneration Framework for Differential Evolution

“…Success-history based adaptive differential evolution (SHADE) [13] further enhanced JADE which records a series of F and CR for learning strategy. Choi et al [14] proposed a sigmoid based control of parameters that changes the threshold for operating the Cauchy mutation dynamically, which balances exploration and exploitation ability. Moreover, integrating various mutation strategies and a handful of parameter settings are promising research directions, variants in this kind include CoDE [15] with composite generation strategies and parameter settings, EPSDE [16], MPEDE [17] and its variant EDEV [18] which ensembles diverse DE variants from a high level.…”