Crossover and mutation operators for grammar-guided genetic programming

  • Authors:
  • Jorge Couchet;Daniel Manrique;Juan Ríos;Alfonso Rodríguez-Patón

  • Affiliations:
  • Universidad Politécnica de Madrid, Facultad de Informática, Campus de Montegancedo s/n. 28660 Boadilla del Monte, Madrid, Spain;Universidad Politécnica de Madrid, Facultad de Informática, Campus de Montegancedo s/n. 28660 Boadilla del Monte, Madrid, Spain;Universidad Politécnica de Madrid, Facultad de Informática, Campus de Montegancedo s/n. 28660 Boadilla del Monte, Madrid, Spain;Universidad Politécnica de Madrid, Facultad de Informática, Campus de Montegancedo s/n. 28660 Boadilla del Monte, Madrid, Spain

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a new grammar-guided genetic programming (GGGP) system by introducing two original genetic operators: crossover and mutation, which most influence the evolution process. The first, the so-called grammar-based crossover operator, strikes a good balance between search space exploration and exploitation capabilities and, therefore, enhances GGGP system performance. And the second is a grammar-based mutation operator, based on the crossover, which has been designed to generate individuals that match the syntactical constraints of the context-free grammar that defines the programs to be handled. The use of these operators together in the same GGGP system assures a higher convergence speed and less likelihood of getting trapped in local optima than other related approaches. These features are shown throughout the comparison of the results achieved by the proposed system with other important crossover and mutation methods in two experiments: a laboratory problem and the real-world task of breast cancer prognosis.