196 search results - page 4 / 40 » Assortative Mating in Genetic Algorithms for Dynamic Problem... |
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
IJMC
2006
13 years 7 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The application of genetic algorithms (GAs) to many optimization problems in organizations often results in good performance and high quality solutions. For successful and efficien...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...