Using adaptive operators in genetic search
Abstract
In this paper, we provided an extension of our previous work on adaptive genetic algorithm [1]. Each individual encodes the probability (rate) of its genetic operators. In every generation, each individual is modified by only one operator. This operator is selected according to its encoded rates. The rates are updated according to the performance achieved by the offspring (compared to its parents) and a random learning rate. The proposed approach is augmented with a simple transposition operator and tested on a number of benchmark functions. © Springer-Verlag Berlin Heidelberg 2003.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Gómez, J., Dasgupta, D., & González, F. (2003). Using adaptive operators in genetic search. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2724, 1580-1581. https://doi.org/10.1007/3-540-45110-2_34
