In this paper we continue the investigation of the effect of local search in geometric semantic genetic programming (GSGP), with the introduction of a new general local search operator that can be easily customized. We show that it is able to obtain results on par with the current best-performing GSGP with local search and, in most cases, better than standard GSGP.
Extending local search in geometric semantic genetic programming
Manzoni Luca;
2019-01-01
Abstract
In this paper we continue the investigation of the effect of local search in geometric semantic genetic programming (GSGP), with the introduction of a new general local search operator that can be easily customized. We show that it is able to obtain results on par with the current best-performing GSGP with local search and, in most cases, better than standard GSGP.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
cover, indice, Manzoni.pdf
Accesso chiuso
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright Editore
Dimensione
497.81 kB
Formato
Adobe PDF
|
497.81 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.
