Extending self-adaptation in evolutionary algorithms

David B. Fogel

doi:10.1117/12.455870

6 December 2002 Extending self-adaptation in evolutionary algorithms

David B. Fogel

Proceedings Volume 4787, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation V; (2002) https://doi.org/10.1117/12.455870
Event: International Symposium on Optical Science and Technology, 2002, Seattle, WA, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
9 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Data modeling

Chemical elements

Computer programming

Evolutionary algorithms

Optimization (mathematics)

Transform theory

Mathematical modeling

Show All Keywords

Keywords/Phrases

Search In:

Publication Years