4.6 Article

Fitness distance correlation and mixed search strategy for differential evolution

Journal

NEUROCOMPUTING
Volume 458, Issue -, Pages 514-525

Publisher

ELSEVIER
DOI: 10.1016/j.neucom.2019.12.141

Keywords

Fitness landscape; Fitness distance correlation; Differential evolution; Single-objective optimization problems

Funding

  1. National Natural Science Foundation of China [62066019, 61903089]
  2. Jiangxi Provincial Natural Science Foundation [20202BABL202020, 20202BAB202014]
  3. ScienceFoundation of Jiangxi University of Science and Technology [JXXJBS18059]

Ask authors/readers for more resources

The theory of fitness landscape is applied to explain the behavior of evolutionary algorithms in solving optimization problems in biological evolution. By analyzing the features of fitness landscape, it can help to understand the difficulty of solving optimization problems and the distribution of optimal solutions.
The fitness landscape is a theory applied to the evolutionary dynamics of biological evolution to explain the behavior of evolutionary algorithms in the solution of optimization problems. With the continuous advancement of evolutionary algorithm optimization, a fitness landscape can present more abundant feature information, such as the local fitness, fitness distance correlation, and landscape roughness. These landscape features reflect the optimal solution distribution, quantity, and local unimodal topology of the optimization problem from various angles. This paper expresses the adaptability landscape features of typical optimization problems, engages in a quantitative analysis of the fitness distance correlation information, evaluates the difficulty of solving the problem within the search space, and obtains the correlation degree classification result. The search strategy adapts the mixed mutation and the fitness distance correlation for differential evolution. Empirical studies show that, the fitness distance correlation search strategy for the differential evolution algorithm can avoid falling into the local optimum, improve accuracy and convergence, and solve the single-objective optimization problem in a more comprehensive manner. (c) 2020 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available