Convergence Theory and Applications of the Factorized Distribution Algorithm

作者: Thilo Mahnig , Heinz Muhlenbein

DOI:

关键词:

摘要: The paper investigates the optimization of additively decomposable functions (ADF) by a new evolutionary algorithm called Factorized Distribution Algorithm (FDA). FDA is based on factorization distribution to generate search points. First separable ADFs are considered. These mapped generalized linear with metavariables defined for multiple alleles. mapping transforms into an Univariate Marginal Frequency (UMDA). For UMDA exact equation response selection is.computed under assumption proportionate selection. truncation approximate time convergence used, derived from analysis OneMax function. also numerically investigated non functions. very similar ADFs. outpe1iorms genetic recombination strings far.

参考文章(2)
Leonard E. Baum, J. A. Eagon, An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology Bulletin of the American Mathematical Society. ,vol. 73, pp. 360- 363 ,(1967) , 10.1090/S0002-9904-1967-11751-8
David E. Goldberg, Genetic algorithms in search, optimization and machine learning Reading: Addison-Wesley. ,(1989)