Continuous Gaussian estimation of distribution algorithm

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Metaheuristics algorithms such as Estimation of Distribution Algorithms use probabilistic modeling to generate candidate solutions in optimization problems. The probabilistic presentation and modeling allows the algorithms to climb the hills in the search space. Similarly in this paper, Continuous Gaussian Estimation of Distribution Algorithm (CGEDA) which is kind of multivariate EDAs is proposed for real coded problems. The proposed CGEDA needs no initialization of parameters; mean and standard deviation of solution is extracted from population information during optimization processing adaptively. Gaussian Data distribution and dependent Individuals are two assumptions that are considered in CGEDA. The fitting task model in CGEDA is based on maximum likelihood procedure to estimate parameters of assumed Gaussian distribution for data distribution. The proposed algorithm is evaluated and compared experimentally with Univariate Marginal Distribution Algorithm (UMDA), Particle Swarm Optimization (PSO) and Cellular Probabilistic Optimization Algorithm (CPOA). Experimental results show superior performance of CGEDA V.S. the other algorithms. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Shahraki, S., & Tutunchy, M. R. A. (2013). Continuous Gaussian estimation of distribution algorithm. In Advances in Intelligent Systems and Computing (Vol. 190 AISC, pp. 211–218). Springer Verlag. https://doi.org/10.1007/978-3-642-33042-1_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free