Using Dynamic Mutation Rates in Gene-set Genetic Algorithms

被引：0

作者：

Hong, Tzung-Pei ^{[1
]}

Wu, Min-Thai ^{[2
]}

Lee, Yeong-Chyi ^{[3
]}

机构：

[1] Natl Univ Kaohsiung, Dept Comp Sci & Informat Engn, Kaohsiung, Taiwan

[2] Natl Sun Yat Sen Univ, Dept Comp Sci & Engn, Kaohsiung, Taiwan

[3] Cheng Shiu Univ, Dept Informat Management, Kaohsiung, Taiwan

来源：

IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010) | 2010年

关键词：

genetic algorithms; dynamic mutation rate; gene-set;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页数：5