Now showing items 1-3 of 3
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. ...
Hyper-selection in dynamic environments.
In recent years, several approaches have been developed for genetic algorithms to enhance their performance in dynamic environments. Among these approaches, one kind of methods is to adapt genetic operators in order for ...
A hybrid immigrants scheme for genetic algorithms in dynamic environments
Dynamic optimization problems are a kind of optimization problems that involve changes over time. They pose a serious challenge to traditional optimization methods as well as conventional genetic algorithms since the goal ...