Paper
22 March 1999 Fitness distributions in evolutionary computation: analysis of noisy functions
Kumar Chellapilla, David B. Fogel
Author Affiliations +
Abstract
Traditional techniques for designing evolutionary algorithms rely on schema processing, minimizing expected losses, and emphasize certain genetic operators such as crossover. Unfortunately, these have failed to provide robust optimization performance. Recently, fitness distribution analysis has been proposed as an alternative tool for designing efficient evolutionary computations. This analysis has concentrated on obtaining very accurate expected improvement (EI) and probability of improvement (PI) statistics for specific mutation operators (using as many as 5000 Monte Carlo trials) on noiseless object functions. In practice, such extensive analysis might be computationally prohibitive and the objective functions might also be noisy. Experiments were designed here to determine the amount of sampling required to obtain useful estimates of the EI and PI both in the presence and absence of noise. Simulations indicate that useful statistics can be obtained in as few as 10 trials in the absence of noise. On noisy functions, however, the required number of trials increased as the 'signal to noise ratio' decreased.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kumar Chellapilla and David B. Fogel "Fitness distributions in evolutionary computation: analysis of noisy functions", Proc. SPIE 3722, Applications and Science of Computational Intelligence II, (22 March 1999); https://doi.org/10.1117/12.342886
Lens.org Logo
CITATIONS
Cited by 7 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Electroluminescence

Error analysis

Evolutionary algorithms

Statistical analysis

Genetics

Monte Carlo methods

Optimization (mathematics)

Back to Top