Two Improved Differential Evolution Schemes for Faster Global Search

Swagatam Das, Amit Konar, Uday Kumar Chakraborty

Research output: Contribution to journalArticlepeer-review

Abstract

Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of DE. Performance comparisons of the two proposed methods are provided against (a) the original DE, (b) the canonical particle swarm optimization (PSO), and (c) two PSO-variants. The new DE-variants are shown to be statistically significantly better on a seven-function test bed for the following performance measures: solution quality, time to find the solution, frequency of finding the solution, and scalability. 
Original languageAmerican English
JournalGenetic and Evolutionary Computation Conference
DOIs
StatePublished - Jun 25 2005

Disciplines

  • Applied Mathematics
  • Computer Sciences
  • Artificial Intelligence and Robotics

Cite this