Holder functions and deception of genetic algorithms

We present a deception analysis for Holder functions. Our approach uses a decomposition on the Haar basis, which reflects in a natural way the Holder structure of the function. This allows the relation of the deception, the Holder exponent, and some parameters of the genetic algorithms (GAs). These...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on evolutionary computation 1998-07, Vol.2 (2), p.56-71
Main Authors: Lutton, E., Levy Vehel, J.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Convergence
Evolution (biology)
Fractals
Genetic algorithms
Image analysis
Inverse problems
Mathematics
Optimization methods
Performance analysis
Probability
Stochastic processes
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a deception analysis for Holder functions. Our approach uses a decomposition on the Haar basis, which reflects in a natural way the Holder structure of the function. This allows the relation of the deception, the Holder exponent, and some parameters of the genetic algorithms (GAs). These results prove that deception is connected to the irregularity of the fitness function and shed a new light on the schema theory. In addition, this analysis may assist in understanding the influence of some of the parameters on the performance of a GA.
ISSN:1089-778X
1941-0026
DOI:10.1109/4235.728208