1995
Optimal mutation probability for genetic algorithms
Search citation statements
Paper Sections
Select...
34
0
0
0
Citation Types
0
9
0
0
Year Published
1996
2025
Publication Types
Select...
25
5
4
Relationship
0
34
Authors
Journals
Cited by 34 publications
(9 citation statements)
References 4 publications
0
9
0
0
“…However, it is generally advised that the mutation rate should be low [16], as high mutation rates tend to convert the algorithm towards a random search. We have then adopted a fitness-based adaptive mutation probability [17]:…”
Section: E the Mutationmentioning
confidence: 99%
“…However, it is generally advised that the mutation rate should be low [16], as high mutation rates tend to convert the algorithm towards a random search. We have then adopted a fitness-based adaptive mutation probability [17]:…”
Section: E the Mutationmentioning
confidence: 99%
“…These individuals are mixed with other individuals by using the crossover operator, or some of them are modified with mutation operator. These operators have associated a probability following the values suggested in [49]. In this case, the operators were selected to create a high level of independence from the population, whose individuals depend on the complexity of the equation.…”
Section: Genetic Algorithm (Ga)mentioning
confidence: 99%
“…Fixed MRs: Lots of theoretical and empirical work has been done on finding the optimal fixed MR for specific problems [4,15], finding heuristics like the MR should be proportional to 1/𝐿 where 𝐿 is the length of the genotype [9,26]. Evolutionary bilevel optimization tries to find the optimal evolutionary parameters, including MR, by running an inner evolution with an outer loop searching over parameters [21,32].…”
Section: Related Workmentioning
confidence: 99%
