Choosing selection pressure for wide-gap problems

Tianshi CHEN, Jun HE, Guoliang CHEN, Xin YAO

Research output: Journal PublicationsJournal Article (refereed)peer-review

11 Citations (Scopus)

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. © 2009 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)926-934
Number of pages9
JournalTheoretical Computer Science
Volume411
Issue number6
Early online date3 Jan 2010
DOIs
Publication statusPublished - Feb 2010
Externally publishedYes

Bibliographical note

The authors would like to thank Dr. Ke Tang for his valuable comments and revision of the paper. This work was partially supported by National Natural Science Foundation of China grants (No. 60533020 and U0835002), the Fund for Foreign Scholars in University Research and Teaching Programs (Grant No. B07033), and an Engineering and Physical Science Research Council grant in the UK (No. EP/C520696/1).

Keywords

  • Evolutionary algorithm
  • Evolutionary computation theory
  • First hitting time
  • Markov chain
  • Selection pressure

Fingerprint

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

Cite this