196 search results - page 9 / 40 » Assortative Mating in Genetic Algorithms for Dynamic Problem... |
KES
2000
Springer
13 years 11 months ago
2000
Springer
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
SLS
2009
Springer
14 years 8 days ago
2009
Springer
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
GECCO
2003
Springer
14 years 28 days ago
2003
Springer
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...