Sciweavers

196 search results - page 20 / 40
» Assortative Mating in Genetic Algorithms for Dynamic Problem...
Sort
View
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
14 years 1 months ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
13 years 8 months ago
Rank based variation operators for genetic algorithms
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...
Jorge Cervantes, Christopher R. Stephens
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
13 years 8 months ago
Optinformatics for schema analysis of binary genetic algorithms
Given the importance of optimization and informatics which are the two broad fields of research, we present an instance of Optinformatics which denotes the specialization of info...
Minh Nghia Le, Yew-Soon Ong, Quang Huy Nguyen 0001
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
13 years 8 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
14 years 1 months ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass