TY - JOUR
T1 - Choosing selection pressure for wide-gap problems
AU - Chen, Tianshi
AU - He, Jun
AU - Chen, Guoliang
AU - Yao, Xin
N1 - Chen, T., He, J., Chen, G., Yao, X. (2010). Choosing selection pressure for wide-gap problems. Theoretical Computer Science, 411 (6), 926-934
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.
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.
KW - evolutionary algorithm
KW - selection pressure
KW - first hitting time
KW - Marknov chain
KW - evolutionary computation theory
UR - http://hdl.handle.net/2160/13240
U2 - 10.1016/j.tcs.2009.12.014
DO - 10.1016/j.tcs.2009.12.014
M3 - Article
SN - 0304-3975
VL - 411
SP - 926
EP - 934
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 6
ER -