Abstract
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not be good for hybrid genetic algorithms. We try, in this paper, the opposite. In the context of hybrid genetic algorithms, we raise the mutation rate over the generations. The rationale behind this strategy is as follows: i) The perturbation rate of crossover decreases over the generations as the chromosomes in the population become similar; ii) Local optimization algorithms can undo a considerable level of perturbation and return the offspring to one of the parents; iii) Thus, we rather need stronger mutation at a later stage of a hybrid genetic algorithm. Experimental results supported our strategy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, SH., Moon, BR. (2004). Mutation Rates in the Context of Hybrid Genetic Algorithms. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-24855-2_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22343-6
Online ISBN: 978-3-540-24855-2
eBook Packages: Springer Book Archive