Translator Disclaimer
Paper
6 December 2002 Extending self-adaptation in evolutionary algorithms
Author Affiliations +
Abstract
Self-adaptation in evolutionary algorithms concerns processes in which individuals incorporate information on how to search for new individuals. Instead of detailing the means for searching the space of possible solutions a priori, a process of random variation is applied both in terms of searching the space and searching for strategies to search the space. In one common implementation, each individual in the population is represented as a pair of vectors (x,σ), where x is the candidate solution to an optimization problem scored in terms of function f(x), and σ is the so-called strategy parameter vector that influences how offspring will be created from the individual. Typically, σ describes a variance or covariance matrix under Gaussian mutations. Experimental evidence suggest that the elements of σ can sometimes become too small to explore the given search space adequately. The evolutionary search then stagnates until the elements of σ grown sufficiently large as a result of random variation. Several methods have been offered to remedy this situation. This paper reviews recent results with one such method, which associates multiple strategy parameter vectors with a single individual. A single strategy vector is active at any time and dictates how offspring will be generated. Experiments on four 10-dimensional benchmark functions are reviewed, in which the number of strategy parameter vector is varied over 1, 2, 3, 4, 5, 10, and 20. The results indicate advantages for using multiple strategy parameter vectors. Furthermore, the relationship between the mean best result after a fixed number of generations and the number of strategy parameter vectors can be determined reliably in each case.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David B. Fogel "Extending self-adaptation in evolutionary algorithms", Proc. SPIE 4787, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation V, (6 December 2002); https://doi.org/10.1117/12.455870
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Routing in DiffServ multicast environment
Proceedings of SPIE (July 01 2002)
Revisiting evolutionary programming
Proceedings of SPIE (March 25 1998)
Evolving predictors for chaotic time series
Proceedings of SPIE (March 25 1998)
Evolutionary optimization of cascaded networks
Proceedings of SPIE (June 30 1994)

Back to Top