On the desired behaviors of self-adaptive evolutionary algorithms

Beyer, Hans-Georg ; Deb, Kalyanmoy (2000) On the desired behaviors of self-adaptive evolutionary algorithms Lecture Notes in Computer Science, 1917/2000 . pp. 59-68. ISSN 0302-9743

Full text not available from this repository.

Official URL: http://www.springerlink.com/index/K6200175683210P4...

Related URL: http://dx.doi.org/10.1007/3-540-45356-3_6


In this paper, we postulate some desired behaviors of any evolutionary algorithm (EA) to demonstrate self-adaptive properties. Thereafter, by calculating population mean and variance growth equations, we find bounds on parameter values in a number of EA operators which will qualify them to demonstrate the self-adaptive behavior. Further, we show that if the population growth rates of different EAs are similar, similar performance is expected. This allows us to connect different self-adaptive EAs on an identical platform. This may lead us to find a more unified understanding of the working of different EAs.

Item Type:Article
Source:Copyright of this article belongs to Springer.
ID Code:83523
Deposited On:21 Feb 2012 07:09
Last Modified:21 Feb 2012 07:09

Repository Staff Only: item control page