Sciweavers

196 search results - page 8 / 40
» Assortative Mating in Genetic Algorithms for Dynamic Problem...
Sort
View
GECCO
2003
Springer
14 years 28 days ago
A Case for Codons in Evolutionary Algorithms
A new method is developed for representation and encoding in population-based evolutionary algorithms. The method is inspired by the biological genetic code and utilizes a many-to-...
Joshua Gilbert, Margaret J. Eppstein
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 8 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
14 years 1 months ago
Dynamic optimization of migration topology in internet-based distributed genetic algorithms
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...
Johan Berntsson, Maolin Tang
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 2 months ago
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
Martin Jähne, Xiaodong Li, Jürgen Branke
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 28 days ago
Finding Building Blocks through Eigenstructure Adaptation
A fundamental aspect of many evolutionary approaches to synthesis of complex systems is the need to compose atomic elements into useful higher-level building blocks. However, the ...
Danica Wyatt, Hod Lipson