Geometric semantic operators have recently shown their ability to outperform standard genetic operators on different complex real world problems. Nonetheless, they are affected by drawbacks. In this paper, we focus on one of these drawbacks, i.e. the fact that geometric semantic crossover has often a poor impact on the evolution. Geometric semantic crossover creates an offspring whose semantics stands in the segment joining the parents (in the semantic space). So, it is intuitive that it is not able to find, nor reasonably approximate, a globally optimal solution, unless the semantics of the individuals in the population “contains” the target. In this paper, we introduce the concept of convex hull of a genetic programming population and we present a method to calculate the distance from the target point to the convex hull. Then, we give experimental evidence of the fact that, in four different real-life test cases, the target is always outside the convex hull. As a consequence, we show that geometric semantic crossover is not helpful in those cases, and it is not even able to approximate the population to the target. Finally, in the last part of the paper, we propose ideas for future work on how to improve geometric semantic crossover.

An Analysis of Geometric Semantic Crossover: A Computational Geometry Approach

Manzoni, Luca;
2016-01-01

Abstract

Geometric semantic operators have recently shown their ability to outperform standard genetic operators on different complex real world problems. Nonetheless, they are affected by drawbacks. In this paper, we focus on one of these drawbacks, i.e. the fact that geometric semantic crossover has often a poor impact on the evolution. Geometric semantic crossover creates an offspring whose semantics stands in the segment joining the parents (in the semantic space). So, it is intuitive that it is not able to find, nor reasonably approximate, a globally optimal solution, unless the semantics of the individuals in the population “contains” the target. In this paper, we introduce the concept of convex hull of a genetic programming population and we present a method to calculate the distance from the target point to the convex hull. Then, we give experimental evidence of the fact that, in four different real-life test cases, the target is always outside the convex hull. As a consequence, we show that geometric semantic crossover is not helpful in those cases, and it is not even able to approximate the population to the target. Finally, in the last part of the paper, we propose ideas for future work on how to improve geometric semantic crossover.
File in questo prodotto:
File Dimensione Formato  
ECTA_2016_34.pdf

Accesso chiuso

Tipologia: Documento in Versione Editoriale
Licenza: Copyright Editore
Dimensione 400.65 kB
Formato Adobe PDF
400.65 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11368/2947984
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 3
social impact