2009•Jisuanji yingyong yanjiuRequires access

Novel differential evolution algorithm for function optimization

Changyong Liang

Open publisher page 0 citations

Abstract

This paper proposed a novel differential evolution algorithm to overcome the premature convergence and slow convergent speed during the late evolution in differential evolution algorithm.The new algorithm was based on single population without intermediate population,in which mutation operation,crossover operation and selection operation were used on the current population.In addition,the parameters of mutation and crossover in the new DE were time-varying.The probability of mutation decreased with the evolution,while the probability of crossover was increasing.Results of several typical benchmark functions show the algorithm can avoid premature convergence and improve the performance of differential evolution algorithm in optimization.

About this research paper

What this paper is about

This paper proposed a novel differential evolution algorithm to overcome the premature convergence and slow convergent speed during the late evolution in differential evolution algorithm.The new algorithm was based on single population without intermediate population,in which mutation operation,crossover operation and selection operation were used on the current population.In addition,the parameters of mutation and crossover in the new DE were time-varying.The probability of mutation decreased with the evolution,while the probability of crossover was increasing.Results of several typical benchmark functions show the algorithm can avoid premature convergence and improve the performance of differential evolution algorithm in optimization.

Why it matters

A significance statement is not available in the OpenAlex record.

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

This paper proposed a novel differential evolution algorithm to overcome the premature convergence and slow convergent speed during the late evolution in differential evolution algorithm.The new algorithm was based on single population without intermediate population,in which mutation operation,crossover operation and selection operation were used on the current population.In addition,the parameters of mutation and crossover in the new DE were time-varying.The probability of mutation decreased with the evolution,while the probability of crossover was increasing.Results of several typical benchmark functions show the algorithm can avoid premature convergence and improve the performance of differential evolution algorithm in optimization.

Key concepts: Crossover, Differential evolution, Benchmark (surveying), Premature convergence, Mutation, Computer science, Convergence (economics), Population

Related papers

Back to paper searchBrowse research topicsOriginal source
Novel differential evolution algorithm for function optimization — Research Paper | ScholarLens