Choosing selection pressure for wide-gap problems

Tianshi Chen, Jun He, Guoliang Chen, Xin Yao

Research output: Contribution to journalArticlepeer-review

11 Citations (SciVal)

Abstract

To exploit an evolutionary algorithm’s performance to the full extent, the selection scheme should be chosen carefully. Empirically, it is commonly acknowledged that low selection pressure can prevent an evolutionary algorithm from premature convergence, and is thereby more suitable for wide-gap problems. However, there are few theoretical time complexity studies that actually give the conditions under which a high or a low selection pressure is better. In this paper, we provide a rigorous time complexity analysis showing that low selection pressure is better for the wide-gap problems with two optima.
Original languageEnglish
Pages (from-to)926-934
JournalTheoretical Computer Science
Volume411
Issue number6
Early online date02 Jan 2010
DOIs
Publication statusPublished - 06 Feb 2010

Keywords

  • evolutionary algorithm
  • selection pressure
  • first hitting time
  • Marknov chain
  • evolutionary computation theory

Fingerprint

Dive into the research topics of 'Choosing selection pressure for wide-gap problems'. Together they form a unique fingerprint.

Cite this