Estimation of distribution algorithms: Basic ideas and future directions

Ying-Ping Chen*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Estimation of distribution algorithms (EDAs) are a class of evolutionary algorithms which can be regarded as abstraction of genetic algorithms (GAs) because in the design of EDAs, the population, one of the GA distinctive features, is replaced by probabilistic models/distributions. Building and sampling from the models substitute for the common genetic operators, such as crossover and mutation. Due to their excellent optimization performance, EDAs have been intensively studied and extensively applied in recent years. In order to interest more people to join the research of EDAs, this paper plays as an entry level introduction to EDAs. It starts with introducing the origination and basic ideas of EDAs, followed by presenting the current EDA frameworks, which are broadly applied in many scientific and engineering disciplines. Finally, this paper also describes some ongoing topics and potential directions in the hope that readers may get further insights into EDAs.

Original languageEnglish
Title of host publication2010 World Automation Congress, WAC 2010
StatePublished - 1 Dec 2010
Event2010 World Automation Congress, WAC 2010 - Kobe, Japan
Duration: 19 Sep 201023 Sep 2010

Publication series

Name2010 World Automation Congress, WAC 2010


Conference2010 World Automation Congress, WAC 2010


  • Computational intelligence
  • Estimation of distribution algorithm
  • Evolutionary algorithm
  • Evolutionary computation
  • Global optimization
  • Probabilistic model building genetic algorithm


Dive into the research topics of 'Estimation of distribution algorithms: Basic ideas and future directions'. Together they form a unique fingerprint.

Cite this