Opposition-based differential evolution algorithms

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general weakness; they are computationally expensive due to slow nature of the evolutionary process. This paper presents some novel schemes to accelerate convergence of evolutionary algorithms. The proposed schemes employ opposition-based learning for population initialization and also for generation jumping. In order to investigate the performance of the proposed schemes, Differential Evolution (DE), an efficient and robust optimization method, has been used. The main idea is general and applicable to other population-based algorithms such as Genetic algorithms, Swarm Intelligence, and Ant Colonies. A set of test functions including unimodal and multimodal benchmark functions is employed for experimental verification. The details of proposed schemes and also conducted experiments are given. The results are highly promising.

Original languageEnglish (US)
Title of host publication2006 IEEE Congress on Evolutionary Computation, CEC 2006
Pages2010-2017
Number of pages8
StatePublished - 2006
Event2006 IEEE Congress on Evolutionary Computation, CEC 2006 - Vancouver, BC, Canada
Duration: Jul 16 2006Jul 21 2006

Publication series

Name2006 IEEE Congress on Evolutionary Computation, CEC 2006

Conference

Conference2006 IEEE Congress on Evolutionary Computation, CEC 2006
Country/TerritoryCanada
CityVancouver, BC
Period7/16/067/21/06

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Theoretical Computer Science

Fingerprint

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

Cite this