论文信息 - An Analysis of Estimation of Distribution Algorithms with Finite Population Models

An Analysis of Estimation of Distribution Algorithms with Finite Population Models

The convergence of estimation of distribution algorithms (EDAs) with finite population is analyzed in this paper. At first, the models of EDAs with finite population are designed by incorporating an error into expected distribution of parent population. Then the convergence of the EDAs is proved with finite population under three widely used selection schemes. The results show that EDAs converge to the optimal solutions within the range of error described in this paper.

Yuping Wang | Yan Wu | Xiaoxiong Liu

[1] G. Harik. Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[2] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[3] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[4] D. Goldberg,et al. BOA: the Bayesian optimization algorithm , 1999 .

[5] Heinz Mühlenbein,et al. The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[6] J. A. Lozano,et al. Analyzing the PBIL Algorithm by Means of Discrete Dynamical Systems , 2000 .

[7] Shumeet Baluja,et al. Fast Probabilistic Modeling for Combinatorial Optimization , 1998, AAAI/IAAI.

[8] Shumeet Baluja,et al. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[9] Markus H ohfeld,et al. Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[10] David E. Goldberg,et al. The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[11] Qingfu Zhang,et al. On the convergence of a class of estimation of distribution algorithms , 2004, IEEE Transactions on Evolutionary Computation.