Using dynamic mutation rates in gene-set genetic algorithms

In this paper, we use dynamic mutation rates in gene-set genetic algorithms to increase the number of offspring when the gene-set size is large. Experiments on three problems are made to show the effectiveness of the genetic algorithm with dynamic mutation rates. From the experimental results, the proposed algorithm can get better convergence effects than the one with fixed mutation rates and than the simple GA, but spends only a little more computational time.