2010 IEEE International Conference on Systems, Man and Cybernetics 2010
DOI: 10.1109/icsmc.2010.5642209
|View full text |Cite
|
Sign up to set email alerts
|

Using dynamic mutation rates in gene-set genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Besides the objective function, the effectiveness of the GAs relies on the selection of its control parameters (initial population, population size, generation size, crossover, and mutation) that interact in a complex way. 31…”
Section: Airfoil Optimizationmentioning
confidence: 99%
“…Besides the objective function, the effectiveness of the GAs relies on the selection of its control parameters (initial population, population size, generation size, crossover, and mutation) that interact in a complex way. 31…”
Section: Airfoil Optimizationmentioning
confidence: 99%
“…Beginning with the initial generation in each iteration, an offspring is generated through randomly selecting and modifying the parent gene values [5] [14]. In this experiment, single gene mutation and dynamic gene mutation are separately performed.…”
Section: B Mutationmentioning
confidence: 99%