Difficulty of Unimodal and Multimodal Landscapes in Genetic Programming - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Difficulty of Unimodal and Multimodal Landscapes in Genetic Programming

Résumé

This paper presents an original study of fitness distance correlation as a measure of problem difficulty in genetic programming. A new definition of distance, called structural distance, is used and suitable mutation operators for the program space are defined. The difficulty is studied for a number of problems, including, for the first time in GP, multimodal ones, both for the new hand-tailored mutation operators and standard crossover. Results are in agreement with empirical observations, thus confirming that fitness distance correlation can be considered a reasonable index of difficulty for genetic programming, at least for the set of problems studied here.
Fichier principal
Vignette du fichier
GECCO_2003_Hardness.pdf (288.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00159827 , version 1 (04-07-2007)

Identifiants

  • HAL Id : hal-00159827 , version 1

Citer

Leonardo Vanneschi, Marco Tomassini, Manuel Clergue, Philippe Collard. Difficulty of Unimodal and Multimodal Landscapes in Genetic Programming. Genetic and Evolutionary Computation Conference - GECCO 2003, 2003, Chicago, United States. pp.1788-1799. ⟨hal-00159827⟩
114 Consultations
150 Téléchargements

Partager

Gmail Facebook X LinkedIn More