A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
2001
Evolutionary Computation
Self-adaptation is an essential feature of natural evolution. However, in the context of function optimization, self-adaptation features of evolutionary search algorithms have been explored only with evolution strategy (ES) and evolutionary programming (EP). In this paper, we demonstrate the selfadaptive feature of real-parameter genetic algorithms (GAs) using simulated binary crossover (SBX) operator and without any mutation operator. The connection between the working of self-adaptive ESs and
doi:10.1162/106365601750190406
pmid:11382356
fatcat:bs33xuhf6fhcrdpe32gh2zigwa