A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems
Published 17 January 2005
Jørgen Vesterstrøm, René Thomsen
Citations1,205
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.
TL;DR
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.
Abstract
Several extensions to evolutionary algorithms (EAs) and particle swarm optimization (PSO) have been suggested during the last decades offering improved performance on selected benchmark problems. Recently, another search heuristic termed differential evolution (DE) has shown superior performance in several real-world applications. In this paper, we evaluate the performance of DE, PSO, and EAs regarding their general applicability as numerical optimization techniques. The comparison is performed on a suite of 34 widely used benchmark problems. The results from our study show that DE generally outperforms the other algorithms. However, on two noisy functions, both DE and PSO were outperformed by the EA.
Keywords
Computer Science
Particle swarm optimization
47,523 Citations2002James Kennedy, R.C. Eberhart
The MIT Press eBooksAdaptation in Natural and Artificial Systems
35,568 Citations1992John H. Holland
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.
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.
A modified particle swarm optimizer
10,157 Citations2002Yibing Shi, R.C. Eberhart
A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces
3,354 Citations2004Kenneth V. Price
A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented and it will be demonstrated that the new method converges faster and with more certainty than Adaptive Simulated Annealing as well as the Annealed Nelder&Mead approach.
Handbook of Evolutionary Computation
3,001 Citations1997
Lecture notes in computer scienceEvolutionary optimization versus particle swarm optimization: Philosophy and performance differences
1,119 Citations1998Peter J. Angeline
This paper investigates the philosophical and performance differences of particle swarm and evolutionary optimization by comparison experiments involving four non-linear functions well studied in the evolutionary optimization literature.
Fast Evolutionary Programming.
284 Citations1996Xin Yao, Yong Liu
This paper proposes a fast EP (FEP) which uses a Cauchy instead of Gaussian mutation operator as the primary search operator and shows that FEP performs much better than CEP for multi-modal functions with many local minima while being comparable to CEP in performance for unimodal and multi- modal function optimisation problems with only a fewLocal minima.
Microwave and Optical Technology LettersParticle swarm optimization for reconfigurable phase‐differentiated array design
236 Citations2003Dennis Gies, Yahya Rahmat‐Samii
This paper describes a method of designing a reconfigurable dual‐beam antenna array using a new evolutionary algorithm called particle swarm optimization (PSO) to find element excitations that will result in a sector pattern main beam with low side lobes.
Parameter identification of induction motors using differential evolution
134 Citations2004Rasmus K. Ursem, P. Vadstrup
The differential evolution algorithm is applied to parameter identification of two induction motors used in the house circulation pumps produced by the Danish pump manufacturer Grundfos A/S and outperformed the previously best known algorithms on both problems.
BiosystemsFlexible ligand docking using evolutionary algorithms: investigating the effects of variation operators and local search hybrids
62 Citations2003René Thomsen
The introduced DockEA using the best settings found obtained the overall best docking solutions compared to the Lamarckian GA (LGA) provided with AutoDock and proved to be more robust than the LGA on the more difficult problems with a high number of flexible torsion angles.
A particle swarm optimization for reactive power and voltage control in electric power systems
54 Citations2002Yoshikazu Fukuyama, Shinichi Takayama
Flexible ligand docking using differential evolution
52 Citations2004René Thomsen
The introduced DockDE algorithm is compared with the Lamarckian GA provided with AutoDock, and the DockEA previously found to outperform the LGA, and shows remarkable performance in terms of convergence speed and robustness regarding the found solution.