Sciweavers

74 search results - page 1 / 15
» Genetic Algorithms with Elitism-Based Immigrants for Changin...
Sort
View
EVOW
2007
Springer
15 years 3 months ago
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
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...
Shengxiang Yang
EC
2008
120views ECommerce» more  EC 2008»
14 years 9 months ago
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...
Shengxiang Yang
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 3 months ago
Memory-based immigrants for genetic algorithms in dynamic environments
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
Shengxiang Yang
PPSN
2010
Springer
14 years 8 months ago
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
Michalis Mavrovouniotis, Shengxiang Yang
CEC
2005
IEEE
15 years 3 months ago
Genetic algorithms with self-organized criticality for dynamic optimization problems
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...
Renato Tinós, Shengxiang Yang