scispace - formally typeset
Journal ArticleDOI

Self-adaptive differential evolution algorithm with discrete mutation control parameters

Reads0
Chats0
TLDR
A self-adaptive DE algorithm with discrete mutation control parameters (DMPSADE) is proposed that was compared with 8 state-of-the-art DE variants and 3 non-DE algorithms by using 25 benchmark functions and indicates that the average performance of DMPSADE is better than those of all other competitors.
Abstract
In DMPSADE, control parameters and mutation strategies could be automatically adjusted.We first proposed a new encoding for parameter control in DE algorithm.Roulette wheel is used to implement the selection of mutation strategies. Generally, the optimization problem has different relationships (i.e., linear, approximately linear, non-linear, or highly non-linear) with different optimized variables. The choices of control parameters and mutation strategies would directly affect the performance of differential evolution (DE) algorithm in satisfying the evolution requirement of each optimized variable and balancing its exploitation and exploration capabilities. Therefore, a self-adaptive DE algorithm with discrete mutation control parameters (DMPSADE) is proposed. In DMPSADE, each variable of each individual has its own mutation control parameter, and each individual has its own crossover control parameter and mutation strategy. DMPSADE was compared with 8 state-of-the-art DE variants and 3 non-DE algorithms by using 25 benchmark functions. The statistical results indicate that the average performance of DMPSADE is better than those of all other competitors.

read more

Citations
More filters
Journal ArticleDOI

Chaotic gravitational constants for the gravitational search algorithm

TL;DR: Ten chaotic maps are embedded into the gravitational constant of the recently proposed population-based meta-heuristic algorithm called Gravitational Search Algorithm (GSA) and it is demonstrated that sinusoidal map is the best map for improving the performance of GSA significantly.
Journal ArticleDOI

Review of Differential Evolution population size

TL;DR: Quite clear relation between the population size and the convergence speed has been found, showing that the fewer function calls are available, the lower population sizes perform better and which specific algorithms with population size adaptation perform better depends on the number of function calls allowed.
Journal ArticleDOI

Adaptive Differential Evolution With Sorting Crossover Rate for Continuous Optimization Problems

TL;DR: A modified JADE version with sorting crossover rate (CR) is introduced, called as JADE algorithm with sorting CR (JADE_sort), where a smaller CR value is assigned to individual with better fitness value.
Journal ArticleDOI

Self-adaptive parameter and strategy based particle swarm optimization for large-scale feature selection problems with multiple classifiers

TL;DR: Experimental results show that the strategy and parameter self-adaptive mechanisms can improve the performance of the evolutionary algorithms, and that SPS-PSO can achieve higher classification accuracy and obtain more concise solutions than those of the other algorithms on the large-scale feature problems selected in this research.
Journal ArticleDOI

Differential evolution: A recent review based on state-of-the-art works

TL;DR: This study aims to review the massive progress of DE in the research community by analysing the 192 articles published on this subject from 1997 to 2021, particularly studies in the past five years.
References
More filters
Journal ArticleDOI

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Book ChapterDOI

Individual Comparisons by Ranking Methods

TL;DR: The comparison of two treatments generally falls into one of the following two categories: (a) a number of replications for each of the two treatments, which are unpaired, or (b) we may have a series of paired comparisons, some of which may be positive and some negative as mentioned in this paper.
Journal ArticleDOI

No free lunch theorems for optimization

TL;DR: A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.
Journal ArticleDOI

Use of Ranks in One-Criterion Variance Analysis

TL;DR: In this article, a test of the hypothesis that the samples are from the same population may be made by ranking the observations from from 1 to Σn i (giving each observation in a group of ties the mean of the ranks tied for), finding the C sums of ranks, and computing a statistic H. Under the stated hypothesis, H is distributed approximately as χ2(C − 1), unless the samples were too small, in which case special approximations or exact tables are provided.
Book

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

TL;DR: This volume explores the differential evolution (DE) algorithm in both principle and practice and is a valuable resource for professionals needing a proven optimizer and for students wanting an evolutionary perspective on global numerical optimization.
Related Papers (5)