Parent Selection Pressure Auto-Tuning for Tournament Selection in Genetic Programming

被引:49
作者
Xie, Huayang [1 ]
Zhang, Mengjie [2 ]
机构
[1] Oracle New Zealand, Wellington, New Zealand
[2] Victoria Univ Wellington, Sch Engn & Comp Sci, Wellington 6140, New Zealand
关键词
Evolutionary dynamics; genetic programming (GP); selection pressure; tournament selection; tuning strategy; ALGORITHMS;
D O I
10.1109/TEVC.2011.2182652
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Selection pressure restrains the selection of individuals from the current population to produce a new population in the next generation. It gives individuals of higher quality a higher probability of being used to create the next generation so that evolutionary algorithms (EAs) can focus on promising regions in the search space. An evolutionary learning process is dynamic and requires different selection pressures at different learning stages in order to speed up convergence or avoid local optima. Therefore, it is desirable for selection mechanisms to be able to automatically tune selection pressure during evolution. Tournament selection is a popular selection method in EAs, especially genetic algorithms and genetic programming (GP). This paper focuses on tournament selection and shows that the standard tournament selection scheme is unaware of the dynamics in the evolutionary process and that the standard tournament selection scheme is unable to tune selection pressure automatically. This paper then presents a novel approach which integrates the knowledge of the fitness rank distribution (FRD) of a population into tournament selection. Through mathematical modeling, simulations, and experimental study in GP, this paper shows that the new approach is effective and using the knowledge of FRD is a promising way to modify the standard tournament selection method for tuning the selection pressure dynamically and automatically along evolution.
引用
收藏
页码:1 / 19
页数:19
相关论文
共 44 条
[1]
Affenzeller M, 2005, LECT NOTES COMPUT SC, V3562, P262
[2]
[Anonymous], 1981, Ph.D. Thesis
[3]
[Anonymous], 1991, Foundations of Genetic Algorithms
[4]
Blake C. L., 1998, Uci repository of machine learning databases
[5]
Blickle T., 1995, MATH ANAL TOURNAMENT, V95, P9
[6]
A ComDarison of Selection Schemes Used in Evolutionary Algorithms [J].
Blickle, Tobias ;
Thiele, Lothar .
EVOLUTIONARY COMPUTATION, 1996, 4 (04) :361-394
[7]
Box G.E.P., 2005, Statistics for Experimenters. Design, Innovation, and Discovery, V2
[8]
Branke J., 1996, P AISB96 WORKSH EV C, P6
[9]
De Jong K, 2007, STUD COMPUT INTELL, V54, P1
[10]
Filipovic V., 2000, Proceedings of the 5th Online World Conference on Soft Computing Methods in Industrial Applications, P152