UMDAs for dynamic optimization problems. Fernandes, undefined, Lima, undefined, & Rosa, undefined In GECCO ’08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 399--406, New York, NY, USA, 2008. ACM.
UMDAs for dynamic optimization problems [link]Paper  doi  abstract   bibtex   
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.
@inproceedings{fernandes_umdas_2008,
	address = {New York, NY, USA},
	title = {{UMDAs} for dynamic optimization problems},
	isbn = {978-1-60558-130-9},
	url = {http://doi.acm.org/10.1145/1389095.1389170},
	doi = {10.1145/1389095.1389170},
	abstract = {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.},
	booktitle = {{GECCO} ’08: {Proceedings} of the 10th annual conference on {Genetic} and evolutionary computation},
	publisher = {ACM},
	author = {Fernandes,, Carlos M. and Lima,, Cláudio and Rosa,, Agostinho C.},
	year = {2008},
	pages = {399--406}
}
Downloads: 0