Choosing Selection Pressure for Wide-gap Problems

Research output: Contribution to journalArticle

Authors

Colleges, School and Institutes

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. (C) 2009 Elsevier B.V. All rights reserved.

Details

Original languageEnglish
Pages (from-to)926-934
Number of pages9
JournalTheoretical Computer Science
Volume411
Issue number6
Publication statusPublished - 6 Feb 2010

Keywords

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