Multi-level diversity promotion strategies for Grammar-guided Genetic Programming

被引:8
|
作者
Bartoli, Alberto [1 ]
De Lorenzo, Andrea [1 ]
Medvet, Eric [1 ]
Squillero, Giovanni [2 ]
机构
[1] Univ Trieste, DIA, Trieste, Italy
[2] Politecn Torino, Turin, Italy
关键词
Representation; Grammatical evolution; CFGGP; SGE; WHGE; LOCALITY; CROSSOVER; EVOLUTION; SEARCH;
D O I
10.1016/j.asoc.2019.105599
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Grammar-guided Genetic Programming (G3P) is a family of Evolutionary Algorithms that can evolve programs in any language described by a context-free grammar. The most widespread members of this family are based on an indirect representation: a sequence of bits or integers (the genotype) is transformed into a string of the language (the phenotype) by means of a mapping function, and eventually into a fitness value. Unfortunately, the flexibility brought by this mapping is also likely to introduce non-locality phenomena, reduce diversity, and hamper the effectiveness of the algorithm. In this paper, we experimentally characterize how population diversity, measured at different levels, varies for four popular G3P approaches. We then propose two strategies for promoting diversity which are general, independent both from the specific problem being tackled and from the other components of the Evolutionary Algorithm, such as genotype-phenotype mapping, selection criteria, and genetic operators. We experimentally demonstrate their efficacy in a wide range of conditions and from different points of view. The results also confirm the preponderant importance of the phenotype-level analyzes in diversity promotion. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] A multi-level grammar approach to grammar-guided genetic programming: the case of scheduling in heterogeneous networks
    Saber, Takfarinas
    Fagan, David
    Lynch, David
    Kucera, Stepan
    Claussen, Holger
    O'Neill, Michael
    [J]. GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2019, 20 (02) : 245 - 283
  • [2] A multi-level grammar approach to grammar-guided genetic programming: the case of scheduling in heterogeneous networks
    Takfarinas Saber
    David Fagan
    David Lynch
    Stepan Kucera
    Holger Claussen
    Michael O’Neill
    [J]. Genetic Programming and Evolvable Machines, 2019, 20 : 245 - 283
  • [3] Initialization method for grammar-guided genetic programming
    Garcia-Arnau, M.
    Manrique, D.
    Rios, J.
    Rodriguez-Paton, A.
    [J]. KNOWLEDGE-BASED SYSTEMS, 2007, 20 (02) : 127 - 133
  • [4] Grammar-guided genetic programming and automatically defined functions
    Rodrigues, E
    Pozo, A
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 2507 : 324 - 333
  • [5] On the Generalizability of Programs Synthesized by Grammar-Guided Genetic Programming
    Sobania, Dominik
    [J]. GENETIC PROGRAMMING, EUROGP 2021, 2021, 12691 : 130 - 145
  • [6] Mining exceptional relationships with grammar-guided genetic programming
    Jose Maria Luna
    Mykola Pechenizkiy
    Sebastian Ventura
    [J]. Knowledge and Information Systems, 2016, 47 : 571 - 594
  • [7] Mining exceptional relationships with grammar-guided genetic programming
    Maria Luna, Jose
    Pechenizkiy, Mykola
    Ventura, Sebastian
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2016, 47 (03) : 571 - 594
  • [8] Crossover and mutation operators for grammar-guided genetic programming
    Couchet, Jorge
    Manrique, Daniel
    Rios, Juan
    Rodriguez-Paton, Alfonso
    [J]. SOFT COMPUTING, 2007, 11 (10) : 943 - 955
  • [9] Crossover and mutation operators for grammar-guided genetic programming
    Jorge Couchet
    Daniel Manrique
    Juan Ríos
    Alfonso Rodríguez-Patón
    [J]. Soft Computing, 2007, 11 : 943 - 955
  • [10] Search Strategies for Grammatical Optimization Problems-Alternatives to Grammar-Guided Genetic Programming
    Kronberger, Gabriel
    Kommenda, Michael
    [J]. COMPUTATIONAL INTELLIGENCE AND EFFICIENCY IN ENGINEERING SYSTEMS, 2015, 595 : 89 - 102