2017•Unpublished venueRequires access

Alopex-based mutation strategy in Differential Evolution

Miguel León, Ning Xiong

Open publisher page 8 citations

Abstract

Differential Evolution represents a class of evolutionary algorithms that are highly competitive for solving numerical optimization problems. In a Differential Evolution algorithm, there are a few alternative mutation strategies, which may lead to good or a bad performance depending on the property of the problem. A new mutation strategy, called DE/Alopex/1, is proposed in this paper. This mutation strategy distinguishes itself from other mutation strategies in that it uses the fitness values of the individuals in the population in order to calculate the probabilities of move directions. The performance of DE/Alopex/1 has been evaluated on the benchmark suite from CEC2013. The results of the experiments show that DE/Alopex/1 outperforms some state-of-the-art mutation strategies.

About this research paper

What this paper is about

Differential Evolution represents a class of evolutionary algorithms that are highly competitive for solving numerical optimization problems. In a Differential Evolution algorithm, there are a few alternative mutation strategies, which may lead to good or a bad performance depending on the property of the problem. A new mutation strategy, called DE/Alopex/1, is proposed in this paper. This mutation strategy distinguishes itself from other mutation strategies in that it uses the fitness values of the individuals in the population in order to calculate the probabilities of move directions. The performance of DE/Alopex/1 has been evaluated on the benchmark suite from CEC2013. The results of the experiments show that DE/Alopex/1 outperforms some state-of-the-art mutation strategies.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Differential Evolution represents a class of evolutionary algorithms that are highly competitive for solving numerical optimization problems. In a Differential Evolution algorithm, there are a few alternative mutation strategies, which may lead to good or a bad performance depending on the property of the problem. A new mutation strategy, called DE/Alopex/1, is proposed in this paper. This mutation strategy distinguishes itself from other mutation strategies in that it uses the fitness values of the individuals in the population in order to calculate the probabilities of move directions. The performance of DE/Alopex/1 has been evaluated on the benchmark suite from CEC2013. The results of the experiments show that DE/Alopex/1 outperforms some state-of-the-art mutation strategies.

Key concepts: Mutation, Differential evolution, Benchmark (surveying), Suite, Evolutionary algorithm, Population, Computer science, Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
Alopex-based mutation strategy in Differential Evolution — Research Paper | ScholarLens