Choosing Selection Pressure for Wide-gap Problems

Research output: Contribution to journalArticle

Standard

Choosing Selection Pressure for Wide-gap Problems. / Chen, T; He, Jun; Chen, G; Yao, Xin.

In: Theoretical Computer Science, Vol. 411, No. 6, 06.02.2010, p. 926-934.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Bibtex

@article{72b7ecac5f174d349d1d7f5b508f17f3,
title = "Choosing Selection Pressure for Wide-gap Problems",
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.",
keywords = "Evolutionary computation theory, First hitting time, Evolutionary algorithm, Markov chain, Selection pressure",
author = "T Chen and Jun He and G Chen and Xin Yao",
year = "2010",
month = feb,
day = "6",
doi = "10.1016/j.tcs.2009.12.014",
language = "English",
volume = "411",
pages = "926--934",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "6",

}

RIS

TY - JOUR

T1 - Choosing Selection Pressure for Wide-gap Problems

AU - Chen, T

AU - He, Jun

AU - Chen, G

AU - Yao, Xin

PY - 2010/2/6

Y1 - 2010/2/6

N2 - 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.

AB - 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.

KW - Evolutionary computation theory

KW - First hitting time

KW - Evolutionary algorithm

KW - Markov chain

KW - Selection pressure

U2 - 10.1016/j.tcs.2009.12.014

DO - 10.1016/j.tcs.2009.12.014

M3 - Article

VL - 411

SP - 926

EP - 934

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 6

ER -