New mutation schemes for differential evolution algorithm and their application to the optimization of directional over-current relay settings

The performance of Differential Evolution is significantly affected by the mutation scheme, which attracts many researchers to develop and enhance the mutation scheme in DE. In this article, the authors introduce an enhanced DE algorithm (EDDE) that utilizes the information given by good individuals and bad individuals in the population. The new mutation scheme maintains effectively the exploration/exploitation balance. Numerical experiments are conducted on 24 test problems presented in CEC'2006, and five constrained engineering problems from the literature for verifying and analyzing the performance of EDDE. The presented algorithm showed competitiveness in some cases and superiority in other cases in terms of robustness, efficiency and quality the of the results.

Download Full-text

Dispatching a 19-Unit Indian Utility System Using a Refined Differential Evolution Algorithm

Mathematical Problems in Engineering ◽

10.1155/2014/423426 ◽

2014 ◽

Vol 2014 ◽

pp. 1-12 ◽

Cited By ~ 2

Author(s):

J. Jasper ◽

T. Aruldoss Albert Victoire

Keyword(s):

Differential Evolution ◽

Operating Cost ◽

Differential Evolution Algorithm ◽

New Mutation ◽

Time Period ◽

Utility System ◽

Evolution Algorithm ◽

Neighborhood Topology ◽

The Cost ◽

Dynamic Economic Dispatch

This paper presents a differential evolution with neighborhood based mutation (DE-NM) technique to solve Dynamic Economic Dispatch (DED) problem with valve point effects and multiple fuel options. A new mutation scheme based on neighborhood topology is presented with an aim to achieve the cost reduction together satisfying the dynamic behavior of the generating units over the considered time period. The neighborhood based mutation (NM) balances the exploration and exploitation of the search effort of differential evolution (DE) technique. The NM method enhances the convergence speed and the performance of the DE technique. The performance of the DE-NM is tested on a 10-unit and a real public Indian utility system with 19 generating units. Both the test systems are illustrated under different load patterns. The dispatch results obtained using the proposed method for the Indian system have considerably reduced the operating cost and optimized its operation.

Download Full-text

A modified differential evolution algorithm based on a new mutation strategy and chaos local search for optimization problems

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) ◽

10.1109/iccke.2014.6993450 ◽

2014 ◽

Cited By ~ 3

Author(s):

Behrouz Ahadzadeh ◽

Mohammad Bagher Menhaj

Keyword(s):

Local Search ◽

Differential Evolution ◽

Optimization Problems ◽

Differential Evolution Algorithm ◽

New Mutation ◽

Mutation Strategy ◽

Evolution Algorithm

Download Full-text

Diversifying Search Moves in a Shuffled Differential Evolution Algorithm

International Journal of Computational Intelligence and Applications ◽

10.1142/s1469026816500024 ◽

2016 ◽

Vol 15 (01) ◽

pp. 1650002

Author(s):

Morteza Alinia Ahandani ◽

Seyyed Sadegh Bibak Sareshkeh

Keyword(s):

Differential Evolution ◽

Spread Spectrum ◽

Optimization Problem ◽

Differential Evolution Algorithm ◽

Code Design ◽

Mutation Operator ◽

Secondary Mutation ◽

New Mutation ◽

Phase Code ◽

Evolution Algorithm

The shuffled differential evolution (SDE) is a recently proposed version of differential evolution (DE). However the SDE employs several efforts to compensate limited amount of search moves in the original DE, but these efforts are performed by the same operator. To vary search moves of the SDE, this research proposes employing a secondary mutation operator beside of first mutation operator. This new mutation operator can generate some different offspring than those generated by the first one. Experiments demonstrate a better performance of the proposed algorithm than the SDE. In a later part of the comparative experiments, performance comparisons of the proposed algorithm with some modern DE and other evolutionary algorithms reported in the literature confirm a better or at least a competitive performance of our proposed algorithm. Also a real-world optimization problem, namely, Spread Spectrum Radar Polly phase Code Design, is solved to show the wide applicability of the DSDE.

Download Full-text