196 search results - page 18 / 40 » Assortative Mating in Genetic Algorithms for Dynamic Problem... |
JCP
2008
13 years 7 months ago
2008
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
ASPDAC
2000
ACM
13 years 11 months ago
2000
ACM
We have developed a new GA hardware called GAA-I (Genetic Algorithm Accelerator-I), in which the crossover operator to be applied to each individual was dynamically selected during...
PPSN
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
EGC
2005
Springer
14 years 1 months ago
2005
Springer
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...