Sciweavers

18 search results - page 1 / 4
» Dominance learning in diploid genetic algorithms for dynamic...
Sort
View
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 8 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
HIS
2008
13 years 6 months ago
Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
Stefano Benedettini, Luca Di Gaspero, Andrea Roli
CORR
2011
Springer
239views Education» more  CORR 2011»
12 years 8 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
13 years 10 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
2009
Springer
124views Optimization» more  GECCO 2009»
13 years 11 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