Opposition-based differential evolution

Rahnamayan S. Rahnamayan, Hamid R. Tizhoosh, Magdy M.A. Salama

Research output: Contribution to journalArticlepeer-review


Evolutionary algorithms (EAs) are well-known optimization approaches to deal with nonlinear and complex problems. However, these population-based algorithms are computationally expensive due to the slow nature of the evolutionary process. This paper presents a novel algorithm to accelerate the differential evolution (DE). The proposed opposition-based DE (ODE) employs opposition-based learning (OBL) for population initialization and also for generation jumping. In this work, opposite numbers have been utilized to improve the convergence rate of DE. A comprehensive set of 58 complex benchmark functions including a wide range of dimensions is employed for experimental verification. The influence of dimensionality, population size, jumping rate, and various mutation strategies are also investigated. Additionally, the contribution of opposite numbers is empirically verified. We also provide a comparison of ODE to fuzzy adaptive DE (FADE). Experimental results confirm that the ODE outperforms the original DE and FADE in terms of convergence speed and solution accuracy.

Original languageEnglish (US)
Pages (from-to)64-79
Number of pages16
JournalIEEE Transactions on Evolutionary Computation
Issue number1
StatePublished - Feb 2008


  • Differential evolution (DE)
  • Evolutionary algorithms
  • Opposite numbers
  • Opposition-based learning
  • Optimiztion

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Opposition-based differential evolution'. Together they form a unique fingerprint.

Cite this