Sciweavers

104 search results - page 1 / 21
» Mutation Rates in the Context of Hybrid Genetic Algorithms
Sort
View
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
13 years 10 months ago
Mutation Rates in the Context of Hybrid Genetic Algorithms
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
Seung-Hee Bae, Byung Ro Moon
EPS
1997
Springer
13 years 9 months ago
An Individually Variable Mutation-Rate Strategy for Genetic Algorithms
Abstract. In Neo-Darwinism, mutation can be considered to be unaffected by selection pressure. This is the metaphor generally used by the genetic algorithm for its treatment of the...
Stephen A. Stanhope, Jason M. Daida
GECCO
2008
Springer
157views Optimization» more  GECCO 2008»
13 years 6 months ago
Self-adaptive mutation rates in genetic algorithm for inverse design of cellular automata
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...
Ron Breukelaar, Thomas Bäck
ICGA
1993
140views Optimization» more  ICGA 1993»
13 years 6 months ago
Expected Allele Coverage and the Role of Mutation in Genetic Algorithms
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
David M. Tate, Alice E. Smith
EVOW
2005
Springer
13 years 11 months ago
Assortative Mating in Genetic Algorithms for Dynamic Problems
Non-random mating seems to be the norm in nature among sexual organisms. A common mating criteria among animals is assortative mating, where individuals mate according to their phe...
Gabriela Ochoa, Christian Mädler-Kron, Ricard...