Name
Abstract | ||
|---|---|---|
An important decision to make when design- ing a GA is how to set the evolutionary pa- rameters. Among these parameters, the mu- tation rate has been acknowledged as the most sensitive one. All approaches so far for a near-optimal setting of the mutation rate have intrinsic limitations. A promising guideline is, however, the heuristic suggest- ing pm =1 /L where L is the string length. This paper is a first attempt to explore the scope and limitations of this heuristic on GAs with bit-string representation. Specifically, we select two real-world domains as test prob- lems and explore (i) whether optimal mu- tation rates change with time; and (ii) the interactions between the mutation rate and other evolutionary parameters. Results sug- gest that a constant mutation rate of 1/L is useful for a GA with a controlled 'moderate' selection pressure. It should be, however, re- vised for a weak or extremely strong selection pressure, and for a small population size. |
Year | Venue | Keywords |
|---|---|---|
2002 | GECCO | l heuristic,mutation rate,population size |
Field | DocType | ISBN |
Heuristic,Mathematical optimization,Mutation rate,Computer science | Conference | 1-55860-878-8 |
Citations | PageRank | References |
13 | 0.80 | 14 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gabriela Ochoa | 1 | 76 | 9.48 |