Sciweavers

117 search results - page 11 / 24
» Optimal Mutation Rates and Selection Pressure in Genetic Alg...
Sort
View
ACRI
2006
Springer
13 years 9 months ago
From Cells to Islands: An Unified Model of Cellular Parallel Genetic Algorithms
Abstract. This paper presents the Anisotropic selection scheme for cellular Genetic Algorithms (cGA). This new scheme allows to enhance diversity and to control the selective press...
David Simoncini, Philippe Collard, Sébastie...
FOGA
2011
12 years 11 months ago
On the movement of vertex fixed points in the simple GA
The Vose dynamical system model of the simple genetic algorithm models the behavior of this algorithm for large population sizes and is the basis of the exact Markov chain model. ...
Alden H. Wright, Tomás Gedeon, J. Neal Rich...
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
12 years 11 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
TEC
2002
117views more  TEC 2002»
13 years 7 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
13 years 11 months ago
Selecting for evolvable representations
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
Joseph Reisinger, Risto Miikkulainen