An Improved Estimation of Distribution Algorithm Based on the Entropy Increment Theorem

Article Preview

Abstract:

To systematically harmonize the conflict between selective pressure and population diversity in estimation of distribution algorithms, an improved estimation of distribution algorithms based on the entropy increment theorem (IEDAEI) is proposed in this paper. IEDAEI conforms to the entropy increment theorem in simulating the competitive mechanism between energy and entropy in annealing process, in which population diversity is measured by the entropy increment theorem. By solving some typical high-dimension problems with multiple local optimizations, satisfactory results are achieved. The results show that this algorithm has preferable capability to avoid the premature convergence effectively and reduce the cost in search to some extent.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1675-1678

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Hu T and Ding W: A new dynamical evolutionary algorithm based on the principle of minimal free energy. Progress in Intelligence Computation and Applications. Vol. 2 (2005). p.749.

Google Scholar

[2] Ying Weiqing and Li Yuanxiang: Improving the Computational Efficiency of Thermodynamical Genetic Algorithms. Journal of Software. Vol. 5 (2008). p.1613.

DOI: 10.3724/sp.j.1001.2008.01613

Google Scholar

[3] David Wallin and Conor Ryan: Maintaining Diversity in EDAs for Real-Valued Optimisation Problems, In Proceedings of Frontiers in the Convergence of Bioscience and Information Technologies. Vol. 3 (2008). p.795.

DOI: 10.1109/fbit.2007.132

Google Scholar

[4] Quiang Lu and Xin Yao: Clustering and Learning Gaussian Distribution for Continuous Optimization, IEEE Transactions on Systems, Vol. 2, No. 6 (2006), p.195.

Google Scholar

[5] Weishan Dong and Xin Yao: NichingEDA: Utilizing the diversity inside a population of EDAs for continuous optimization, In Proceedings of the IEEE Congress on Evolutionary Computation, Vol. 8 (2008). p.1260.

DOI: 10.1109/cec.2008.4630958

Google Scholar