Sciweavers

16 search results - page 2 / 4
» Genetic Algorithms with Memory- and Elitism-Based Immigrants...
Sort
View
CEC
2005
IEEE
13 years 11 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
TEC
2008
165views more  TEC 2008»
13 years 5 months ago
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...
Shengxiang Yang, Xin Yao
CEC
2008
IEEE
13 years 11 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
EVOW
2006
Springer
13 years 9 months ago
Associative Memory Scheme for Genetic Algorithms in Dynamic Environments
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems...
Shengxiang Yang
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
13 years 11 months ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass