Seung-Kyu Lee
ABSTRACT
We propose a genetic algorithm with adaptive elitism-based immigrants which tunes the balance between elitism-based immigrants and random immigrants by itself. Experimental results show that our genetic algorithm with adaptive elitism-based immigrants performs better than that with the elitism-based immigrants for onemax and produces comparable results for royal road and knapsack problems.
- S. Yang. Genetic algorithms with elitism-based immigrants for changing optimization problems. In Evo Workshops 2007, ages 627--636, 2007. Google Scholar
Digital Library
Index Terms
- Genetic algorithm with adaptive elitism-based immigrants for dynamic optimization problems
Recommendations
Genetic algorithms with memory-and elitism-based immigrants in dynamic environments
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants and memory schemes are two major ones. The random immigrants scheme ...
A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization
Traditional Genetic Algorithms (GAs) mating schemes select individuals for crossover independently of their genotypic or phenotypic similarities. In Nature, this behavior is known as random mating. However, non-random protocols, in which individuals ...
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
In this paper a genetic algorithm is proposed where the worst individual and individuals with indices close to its index are replaced in every generation by randomly generated individuals for dynamic optimization problems. In the proposed genetic ...
Comments