Dynamic population variation in genetic programming

被引:14
作者
Kouchakpour, Peyman [1 ]
Zaknich, Anthony [1 ]
Braeunl, Thomas [1 ]
机构
[1] Univ Western Australia, Sch Elect Elect & Comp Engn, Nedlands, WA 6009, Australia
关键词
Genetic programming; Computational effort; Average number of evaluations; Convergence; Diversity; Population variation; Dynamic population variation; CLASSIFICATION; ROBOT; DISCOVERY; SELECTION; STRATEGY; DESIGN;
D O I
10.1016/j.ins.2008.12.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Three innovations are proposed for dynamically varying the population size during the run of the genetic programming (GP) system. These are related to what is called Dynamic Population Variation (DPV), where the size of the population is dynamically varied using a heuristic feedback mechanism during the execution of the GP with the aim of reducing the computational effort compared with Standard Genetic Programming (SGP). Firstly, previously developed population variation pivot functions are controlled by four newly proposed characteristic measures. Secondly, a new gradient based pivot function is added to this dynamic population variation method in conjunction with the four proposed measures. Thirdly, a formula for population variations that is independent of special constants is introduced and evaluated. The efficacy of these innovations is examined using a comprehensive range of standard representative problems. It is shown that the new ideas do have the capacity to provide solutions at a lower computational cost compared with standard genetic programming and previously reported algorithms such as the plague operator and the static population variation schemes previously introduced by the authors. (C) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:1078 / 1091
页数:14
相关论文
共 57 条
[1]  
Alfaro-Cid E, 2005, LECT NOTES COMPUT SC, V3447, P250
[2]   A parallel implementation of genetic programming that achieves super-linear performance [J].
Andre, D ;
Koza, JR .
INFORMATION SCIENCES, 1998, 106 (3-4) :201-218
[3]  
Angeline P., 1993, Proceedings of the Second Annual Conference on Evolutionary Programming, P154
[4]  
[Anonymous], 2003, Genetic programming IV: routine human-competitive machine intelligence
[5]   Genetic programming for computational pharmacokinetics in drug discovery and development [J].
Archetti, Francesco ;
Lanzeni, Stefano ;
Messina, Enza ;
Vanneschi, Leonardo .
GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2007, 8 (04) :413-432
[6]   Strategy creation, decomposition and distribution in particle navigation [J].
Beldek, Ulas ;
Leblebicioglu, Kemal .
INFORMATION SCIENCES, 2007, 177 (03) :755-770
[7]  
BURKE E, 2002, LNCS, V2439, P341, DOI DOI 10.1007/3-540-45712-7_33
[8]  
Burke E., 2002, GECCO 2002, P716
[9]   Agent-based computational modeling of the stock price-volume relation [J].
Chen, SH ;
Liao, CC .
INFORMATION SCIENCES, 2005, 170 (01) :75-100
[10]  
Chen YH, 2006, LECT NOTES ARTIF INT, V4253, P398