Sciweavers

444 search results - page 30 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
FOGA
1998
13 years 10 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 2 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 3 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
GECCO
2005
Springer
200views Optimization» more  GECCO 2005»
14 years 2 months ago
An extension of vose's markov chain model for genetic algorithms
The paper presents an extension of Vose’s Markov chain model for genetic algorithm (GA). The model contains not only standard genetic operators such as mutation and crossover bu...
Anna Paszynska
EMO
2006
Springer
161views Optimization» more  EMO 2006»
14 years 8 days ago
Design Issues in a Multiobjective Cellular Genetic Algorithm
In this paper we study a number of issues related to the design of a cellular genetic algorithm (cGA) for multiobjective optimization. We take as an starting point an algorithm fol...
Antonio J. Nebro, Juan José Durillo, Franci...