Sciweavers

84 search results - page 1 / 17
» An Individually Variable Mutation-Rate Strategy for Genetic ...
Sort
View
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
EVOW
2005
Springer
13 years 10 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...
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
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
CEC
2009
IEEE
13 years 11 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...