Sciweavers

835 search results - page 19 / 167
» Dynamic populations in genetic algorithms
Sort
View
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 1 months ago
Using Genetic Algorithms with Asexual Transposition
Traditional Genetic Algorithms (GA) use crossover and mutation as the main genetic operators to achieve population diversity. Previous work using a biologically inspired genetic o...
Anabela Simões, Ernesto Costa
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
15 years 1 months ago
Heterogeneous cooperative coevolution: strategies of integration between GP and GA
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
Leonardo Vanneschi, Giancarlo Mauri, Andrea Valsec...
72
Voted
ICGA
1993
140views Optimization» more  ICGA 1993»
14 years 10 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
TEC
2002
101views more  TEC 2002»
14 years 9 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim
FLAIRS
2007
14 years 12 months ago
Performance Analysis of Evolutionary Search with a Dynamic Restart Policy
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...
Michael Solano, Istvan Jonyer