Differential Evolution
Published 1 January 2016
Ke-Lin Du, M. N. S. Swamy
Citations8
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Differential evolution (DE) is a popular, simple yet efficient EA for solving real-parameter global optimization problems [30]. DE is an elitist EA. It creates new candidate solutions by a multiparent reproduction strategy. DE uses the directional information from the current population for each individual to form a simplex-like triangle.
Keywords
Computer Science
Journal of Global OptimizationDifferential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
28,706 Citations1997Rainer Storn, Kenneth V. Price
It is demonstrated that the new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous spacefunctions Converges faster and with more certainty than manyother acclaimed global optimization methods.
IEEE Transactions on Evolutionary ComputationDifferential Evolution: A Survey of the State-of-the-Art
5,201 Citations2010Swagatam Das, Ponnuthurai Nagaratnam Suganthan
A detailed review of the basic concepts of DE and a survey of its major variants, its application to multiobjective, constrained, large scale, and uncertain optimization problems, and the theoretical studies conducted on DE so far are presented.
A discrete binary version of the particle swarm algorithm
4,683 Citations2002James Kennedy, R.C. Eberhart
The paper reports a reworking of the particle swarm algorithm to operate on discrete binary variables, where trajectories are changes in the probability that a coordinate will take on a zero or one value.
IEEE Transactions on Evolutionary ComputationJADE: Adaptive Differential Evolution With Optional External Archive
3,636 Citations2009Jingqiao Zhang, Arthur C. Sanderson
Simulation results show that JADE is better than, or at least comparable to, other classic or adaptive DE algorithms, the canonical particle swarm optimization, and other evolutionary algorithms from the literature in terms of convergence performance for a set of 20 benchmark problems.
IEEE Transactions on Evolutionary ComputationDifferential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization
3,582 Citations2008A. K. Qin, V. L. Huang +1 more
This paper proposes a self- Adaptive DE (SaDE) algorithm, in which both trial vector generation strategies and their associated control parameter values are gradually self-adapted by learning from their previous experiences in generating promising solutions.
IEEE Transactions on Evolutionary ComputationSelf-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems
3,055 Citations2006Janez Brest, Sao Greiner +3 more
The results show that the algorithm with self-adaptive control parameter settings is better than, or at least comparable to, the standard DE algorithm and evolutionary algorithms from literature when considering the quality of the solutions obtained.
IEEE Transactions on Evolutionary ComputationOpposition-Based Differential Evolution
1,602 Citations2008Shahryar Rahnamayan, Hamid R. Tizhoosh +1 more
This paper presents a novel algorithm to accelerate the differential evolution (DE), which employs opposition-based learning (OBL) for population initialization and also for generation jumping and results confirm that the ODE outperforms the original DE and FADE in terms of convergence speed and solution accuracy.
A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems
1,205 Citations2005Jørgen Vesterstrøm, René Thomsen
The results from this study show that DE generally outperforms the other algorithms, however, on two noisy functions, both DE and PSO were outperformed by the EA.
IEEE Transactions on Evolutionary ComputationDifferential Evolution Using a Neighborhood-Based Mutation Operator
1,147 Citations2009Swagatam Das, Ajith Abraham +2 more
A family of improved variants of the DE/target-to-best/1/bin scheme, which utilizes the concept of the neighborhood of each population member, and is shown to be statistically significantly better than or at least comparable to several existing DE variants as well as a few other significant evolutionary computing techniques over a test suite of 24 benchmark functions.
Statistics and ComputingA Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: easy Bayesian computing for real parameter spaces
946 Citations2006Cajo J. F. ter Braak
The essential ideas of DE and MCMC are integrated, resulting in Differential Evolution Markov Chain (DE-MC), a population MCMC algorithm, in which multiple chains are run in parallel, showing simplicity, speed of calculation and convergence, even for nearly collinear parameters and multimodal densities.
Soft ComputingA Fuzzy Adaptive Differential Evolution Algorithm
818 Citations2004Jiazeng Liu, Jouni Lampinen
IEEE Transactions on Evolutionary ComputationAccelerating Differential Evolution Using an Adaptive Local Search
601 Citations2008Nasimul Noman, Hitoshi Iba
It is shown that the proposed new version of DE, with the adaptive LS, performs better, or at least comparably, to classic DE algorithm.
Real-Parameter Optimization with Differential Evolution
569 Citations2005Jani Rönkkönen, Saku Kukkonen +1 more
This study reports how the differential evolution (DE) algorithm performed on the test bed developed for the CEC05 contest for real parameter optimization.
Self-adaptive differential evolution with neighborhood search
358 Citations2008Zhenyu Yang, Ke Tang +1 more
A self-adaptive NSDE (SaNSDE) is proposed to improve NSDEpsilas performance, and the proposed SaNSDE has shown significant superiority over NSDE.
Applied IntelligencePopulation size reduction for the differential evolution algorithm
348 Citations2007Janez Brest, Mirjam Sepesy Maučec
The original version uses fixed population size but a method for gradually reducing population size is proposed, which improves the efficiency and robustness of the algorithm and can be applied to any variant of a Differential Evolution algorithm.
IEEE Transactions on Evolutionary ComputationEnhancing Differential Evolution Utilizing Proximity-Based Mutation Operators
314 Citations2011Michael G. Epitropakis, Dimitris K. Tasoulis +3 more
This paper incorporates a novel framework based on the proximity characteristics among the individual solutions as they evolve, which incorporates information of neighboring individuals in an attempt to efficiently guide the evolution of the population toward the global optimum.
Applied Soft ComputingInfluence of crossover on the behavior of Differential Evolution Algorithms
295 Citations2009Daniela Zaharie
This work aims to analyze the impact the crossover operator and its parameter, the crossover rate, has on the behavior of Differential Evolution and illustrates the difference between binomial and exponential crossover variants.
IEEE Transactions on Evolutionary ComputationDifferential Evolution With Dynamic Parameters Selection for Optimization Problems
274 Citations2013Ruhul Sarker, Saber Elsayed +1 more
A DE algorithm is proposed that uses a new mechanism to dynamically select the best performing combinations of parameters for a problem during the course of a single run and shows better performance over the state-of-the-art algorithms.
IEEE Transactions on CyberneticsGaussian Bare-Bones Differential Evolution
268 Citations2012Hui Wang, Shahryar Rahnamayan +2 more
A Gaussian bare-bones DE and its modified version (MGBDE) are proposed which are almost parameter free and indicate that the MGBDE performs significantly better than, or at least comparable to, several state-of-the-art DE variants and some existing bare-bone algorithms.
IEEE Transactions on Evolutionary ComputationEnhancing Differential Evolution Utilizing Eigenvector-Based Crossover Operator
236 Citations2014Shu‐Mei Guo, Chin-Chang Yang
The proposed eigenvector-based crossover operator utilizes eigenvectors of covariance matrix of individual solutions, which makes the crossover rotationally invariant, and can be applied to any crossover strategy with minimal changes.
European Journal of Operational ResearchBare bones differential evolution
198 Citations2008Mahamed G. H. Omran, Andries P. Engelbrecht +1 more
The barebones differential evolution (BBDE) is a new, almost parameter-free optimization algorithm that is a hybrid of the barebones particle swarm optimizer and differential evolution that performs very well compared to other state-of-the-art clustering algorithms in all measured criteria.
Natural computing seriesAdvances in Metaheuristics for Hard Optimization
191 Citations2007Patrick Siarry, Zbigniew Michalewicz
A comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization and some guidelines for Genetic Algorithm implementation in MINLP Batch Plant Design Problems.
Binary Differential Evolution
141 Citations2006Gary Pamparà, Andries P. Engelbrecht +1 more
Experimental results indicate the effectiveness of the technique and the viability for the DE to operate in binary space and an interesting and unique mapping method is examined which will enable the DE algorithm to operate within binary space.
NeurocomputingA novel modified binary differential evolution algorithm and its applications
117 Citations2012Ling Wang, Xiping Fu +3 more
A novel modified binary differential evolution algorithm (NMBDE) inspired by the concept of Estimation of Distribution Algorithm and DE is proposed, which can efficiently maintain diversity of population and achieve a better tradeoff between the exploration and exploitation capabilities by cooperating with the selection operator.
Advances in soft computingDifferential Evolution for Binary Encoding
104 Citations2007Tao Gong, Andrew Tuson
This paper aims to investigate how DE can be adapted with binary encoding and to study its behaviors on the binary level.
Structural and Multidisciplinary OptimizationTopology optimization of structures using modified binary differential evolution
95 Citations2010Chun-Yin Wu, Ko-Ying Tseng
The experimental studies show that the proposed modified binary differential evolution algorithm is not only suitable for structural topology optimization, but also has high viability in terms of solving numerical optimization problems.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)On Convergence of Differential Evolution Over a Class of Continuous Functions With Unique Global Optimum
90 Citations2011Susanta Ghosh, Swagatam Das +2 more
This paper takes a first significant step toward the convergence analysis of a canonical DE (DE/rand/1/bin) algorithm by deduces a time-recursive relationship for the probability density function (PDF) of the trial solutions, taking into consideration the DE-type mutation, crossover, and selection mechanisms.
AI CommunicationsOn stability and convergence of the population-dynamics in differential evolution
84 Citations2009Sambarta Dasgupta, Swagatam Das +2 more
The paper proposes a simple mathematical model of the underlying evolutionary dynamics of a one-dimensional DE-population and shows that the fundamental dynamics of each search-agent in DE employs the gradient-descent type search strategy, with a learning rate parameter that depends on control parameters like scale factor F and crossover rate CR of DE.
Soft ComputingOpposition-based learning in the shuffled differential evolution algorithm
80 Citations2012Morteza Alinia Ahandani, Hosein Alavi-Rad
New versions of the DE are introduced which, on one hand, use the partitioning and shuffling concepts of SDE to compensate for the limited amount of search moves of the original DE and, on the other hand, employ the OBL to accelerate the DE without making premature convergence.
Applied Soft ComputingAn evolving surrogate model-based differential evolution algorithm
75 Citations2015Rammohan Mallipeddi, Minho Lee
An evolving surrogate model-based differential evolution (ESMDE) method, wherein a surrogate model constructed based on the population members of the current generation is used to assist the DE algorithm in order to generate competitive offspring using the appropriate parameter setting during different stages of the evolution.
Differential evolution and non-separability
74 Citations2007Andrew M. Sutton, Monte Lunacek +1 more
It is found that imposing pressure in the form of rank-based differential mutation results in a significant improvement of exploitation on rotated benchmarks.
Hybrid DE algorithm with adaptive crossover operator for solving real-world numerical optimization problems
63 Citations2011Gilberto Reynoso-Meza, Javier Sanchis +2 more
The proposed hybrid differential evolution algorithm uses a local search routine to improve convergence and an adaptive crossover operator to find competitive solutions with reported results.
Applied Soft ComputingA directional mutation operator for differential evolution algorithms
47 Citations2015Xin Zhang, Shiu Yin Yuen
The directional mutation operator is shown to be better than the proximity based mutation operator on the five variants in the DE family and can be applied into any DE mutation strategy.
A Novel Binary Differential Evolution Algorithm Based on Artificial Immune System
38 Citations2007Xingshi He, Han Lin
In spite of the simplicity of the technique, simulation results show the improvement of the searching ability and increment in the convergence speed in comparison with the other binary particle swarm optimization algorithms.
Evolutionary ComputationGeometric Differential Evolution for Combinatorial and Programs Spaces
32 Citations2012Alberto Moraglio, Julian Togelius +1 more
The theory behind the GDE algorithm is reviewed, the resulting algorithms are representation-specific differential evolution algorithms searching the target spaces by acting directly on their underlying representations, and experiments show that overall the new DE algorithms are competitive with well-tuned standard search algorithms.
Solving 0-1 Knapsack Problems by a Discrete Binary Version of Differential Evolution
29 Citations2008Chen Peng, Jian Li +1 more
DBDE outperformed DPSO for all the cases with better solutions and more rapid convergence speed to solve 0-1 knapsack problem.
Soft ComputingThree modified versions of differential evolution algorithm for continuous optimization
28 Citations2010Morteza Alinia Ahandani, Naser Pourqorban Shirjoposh +1 more
Three modified versions of the DE to improve its performance, to repair its defect in accurate converging to individual optimal point and to compensate the limited amount of search moves of original DE are proposed.
Information SciencesA metaheuristic algorithm to solve satellite broadcast scheduling problem
27 Citations2015Ayed Salman, Imtiaz Ahmad +1 more
Experimental results show that the proposed SD-BDE algorithm outperformed the existing algorithms by finding better or optimal solutions for almost all tested benchmarks.
Advances in intelligent systems and computingA Switched Parameter Differential Evolution for Large Scale Global Optimization – Simpler May Be Better
22 Citations2015Swagatam Das, Arka Ghosh +1 more
Two very simple modifications to Differential Evolution (DE) are presented to enhance its performance for the high-dimensional numerical functions while still preserving the simplicity of its algorithmic framework.
The population dynamics of Differential Evolution: A mathematical model
16 Citations2008Sambarta Dasgupta, Arijit Biswas +2 more
This article provides a simple mathematical model of the underlying evolutionary dynamics of a one-dimensional DE that relates the search process of DE with the classical gradient descent search and also analyzes the convergence behavior of a DE population, very near to optima.