Nonstationary function optimization using genetic algorithm with dominance and diploidy
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Applying Population Based ACO to Dynamic Optimization Problems
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Tracking Extrema in Dynamic Environments
EP '97 Proceedings of the 6th International Conference on Evolutionary Programming VI
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Sub-structural niching in estimation of distribution algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Drift and Scaling in Estimation of Distribution Algorithms
Evolutionary Computation
Does overfitting affect performance in estimation of distribution algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Univariate marginal distribution algorithms for non-stationary optimization problems
International Journal of Knowledge-based and Intelligent Engineering Systems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Addressing sampling errors and diversity loss in UMDA
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Agent-Based Model of Genotype Editing
Evolutionary Computation
Sub-structural niching in non-stationary environments
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Assortative mating in genetic algorithms for dynamic problems
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
An ant-based rule for UMDA's update strategy
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
A framework to hybridize PBIL and a hyper-heuristic for dynamic environments
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Hi-index | 0.00 |
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designed to correct diversity loss. Although their performance when solving Dynamic Optimization Problems (DOP) is less studied than population-based Evolutionary Algorithms, UMDA and other Estimation of Distribution Algorithms may follow similar schemes when tracking moving optima: genetic diversity maintenance, memory schemes, niching methods, and even reinicialization of the probability vectors. This study is focused on diversity maintenance schemes. A new update strategy for UMDA's probability model, based on Ant Colony Optimization transition probability equations, is presented and empirically compared with other strategies recently published that aim to correct diversity loss in UMDA. Results demonstrate that loss correction strategies delay or avoid full convergence, thus increasing UMDA's adaptability to changing environments. However, the strategy proposed in this paper achieves a higher performance on the DOP test set when compared with other methods. In addition, the new strategy incorporates two parameters that control the diversity of the probability model.