Sciweavers

1927 search results - page 1 / 386
» UMDAs for dynamic optimization problems
Sort
View
CEC
2005
IEEE
13 years 10 months ago
Memory-enhanced univariate marginal distribution algorithms for dynamic optimization problems
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
Shengxiang Yang
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
13 years 5 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
TEC
2010
173views more  TEC 2010»
12 years 11 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
CIMCA
2005
IEEE
13 years 10 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
13 years 10 months ago
Genetic drift in univariate marginal distribution algorithm
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
Yi Hong, Qingsheng Ren, Jin Zeng