<p>The incorporation of a Cellular Automata (CA)-like structure into the population of Evolutionary Algorithms (EAs) has been shown to enhance solution quality. However, research on CA-like structures in the context of Genetic Programming (GP) remains limited. This work examines the impact of introducing such structures in Geometric Semantic variants of GP, specifically focusing on the well-established Geometric Semantic GP (GSGP) and the recently proposed SLIM-GSGP, which prioritizes generating smaller and more interpretable individuals. Furthermore, we analyze how cellular structures influence the effectiveness of semantic-based recombination and mutation in both GSGP and SLIM-GSGP. To this end, we conduct a comprehensive evaluation of these genetic operators, examining their effects both individually and in combination. We provide insights into how CA-like structures and semantic genetic operators influence both the quality and size of solutions in GSGP and SLIM-GSGP, offering a clear understanding of the trade-offs associated with these approaches.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Semantic-based recombination and mutation in cellular-inspired genetic programming

  • Luigi Rovito,
  • Lorenzo Bonin,
  • Davide Farinati,
  • Leonardo Vanneschi,
  • Luca Manzoni,
  • Andrea De Lorenzo,
  • Gloria Pietropolli

摘要

The incorporation of a Cellular Automata (CA)-like structure into the population of Evolutionary Algorithms (EAs) has been shown to enhance solution quality. However, research on CA-like structures in the context of Genetic Programming (GP) remains limited. This work examines the impact of introducing such structures in Geometric Semantic variants of GP, specifically focusing on the well-established Geometric Semantic GP (GSGP) and the recently proposed SLIM-GSGP, which prioritizes generating smaller and more interpretable individuals. Furthermore, we analyze how cellular structures influence the effectiveness of semantic-based recombination and mutation in both GSGP and SLIM-GSGP. To this end, we conduct a comprehensive evaluation of these genetic operators, examining their effects both individually and in combination. We provide insights into how CA-like structures and semantic genetic operators influence both the quality and size of solutions in GSGP and SLIM-GSGP, offering a clear understanding of the trade-offs associated with these approaches.