Evolving dynamic fitness measures for genetic programming

被引:8
作者
Ragalo, Anisa [1 ]
Pillay, Nelishia [2 ]
机构
[1] Univ KwaZulu Natal, Sch Math Stat & Comp Sci, Durban, South Africa
[2] Univ Pretoria, Dept Comp Sci, Pretoria, South Africa
基金
新加坡国家研究基金会;
关键词
Genetic programming; Genetic algorithm; Fitness; CONFIGURATION; ALGORITHM;
D O I
10.1016/j.eswa.2018.03.060
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This research builds on the hypothesis that the use of different fitness measures on the different generations of genetic programming (GP) is more effective than the convention of applying the same fitness measure individually throughout GP. Whereas the previous study used a genetic algorithm (GA) to induce the sequence in which fitness measures should be applied over the GP generations, this research uses a meta- (or high-level) GP to evolve a combination of the fitness measures for the low-level GP. The study finds that the meta-GP is the preferred approach to generating dynamic fitness measures. GP systems applying the generated dynamic fitness measures consistently outperform the previous approach, as well as standard GP on benchmark and real world problems. Furthermore, the generated dynamic fitness measures are shown to be reusable, whereby they can be used to solve unseen problems to optimality. (C) 2018 Published by Elsevier Ltd.
引用
收藏
页码:162 / 187
页数:26
相关论文
共 48 条
  • [1] [Anonymous], AUSTR J INTELLIGENT
  • [2] [Anonymous], LOGIC COMPUTER DESIG
  • [3] [Anonymous], UCI REPOSITORY MACHI
  • [4] [Anonymous], P 15 ANN C GEN EV CO
  • [5] [Anonymous], 1997, LATE BREAKING PAPERS
  • [6] [Anonymous], P 19 ANN C DOCT STUD
  • [7] [Anonymous], LNCS
  • [8] [Anonymous], MICR EXC OFF 2010
  • [9] [Anonymous], JAV VERS 8 UPD 91
  • [10] [Anonymous], WORKSH EXPL NEW HOR