The Max Problem Revisited: The Importance of Mutation in Genetic Programming

被引:8
作者
Koetzing, Timo [1 ]
Sutton, Andrew M. [1 ]
Neumann, Frank [1 ]
O'Reilly, Una-May [1 ]
机构
[1] Max Planck Inst Informat, D-66123 Saarbrucken, Germany
来源
PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE | 2012年
关键词
Genetic Programming; Mutation; Theory; Runtime Analysis;
D O I
10.1145/2330163.2330348
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper contributes to the rigorous understanding of genetic programming algorithms by providing runtime complexity analyses of the well-studied Max problem. Several experimental studies have indicated that it is hard to solve the M a x problem with crossover-based algorithms. Our analyses show that different variants of the M a x problem can provably be solved using simple mutation-based genetic programming algorithms. Our results advance the body of computational complexity analyses of genetic programming, indicate the importance of mutation in genetic programming, and reveal new insights into the behavior of mutation-based genetic programming algorithms.
引用
收藏
页码:1333 / 1340
页数:8
相关论文
共 15 条
[1]  
[Anonymous], 2003, Genetic programming IV: routine human-competitive machine intelligence
[2]  
Auger A., 2011, Theory of randomized search heuristics: Foundations and recent developments
[3]  
Cathabard S, 2011, FOGA 11: PROCEEDINGS OF THE 2011 ACM/SIGEVO FOUNDATIONS OF GENETIC ALGORITHMS XI, P173
[4]  
Durrett G, 2011, FOGA 11: PROCEEDINGS OF THE 2011 ACM/SIGEVO FOUNDATIONS OF GENETIC ALGORITHMS XI, P69
[5]  
Feldman V, 2008, ACM S THEORY COMPUT, P619
[6]  
Gathercole C., 1996, Genetic Programming. Proceedings of the First Annual Conference 1996, P291
[7]  
Goldberg D. E., 1998, Genetic Programming. First European Workshop, EuroGP'98. Proceedings, P16, DOI 10.1007/BFb0055925
[8]  
Kötzing T, 2011, GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P2091
[9]  
Langdon W.B., 1997, ADV GENETIC PROGRAMM, V3, P301
[10]  
Motwani R., 1995, Randomized algorithms