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 language | English |
|---|---|
| Pages (from-to) | 926-934 |
| Number of pages | 9 |
| Journal | Theoretical Computer Science |
| Volume | 411 |
| Issue number | 6 |
| Early online date | 3 Jan 2010 |
| DOIs | |
| Publication status | Published - Feb 2010 |
| Externally published | Yes |
Funding
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