Constraint handling techniques for a non-parametric real-valued estimation distribution algorithm

This article introduces the Non-Parametric Real-valued Estimation Distribution Algorithm (NOPREDA), and its application to constrained optimization problems. NOPREDA approximates the target probability density function by building the cumulative empirical distribution of the decision variables. Relationships and structure among the data is modeled through a rank correlation matrix (Spearmans statistics). The procedure to induce a target rank correlation matrix into the new population is described. NOPREDA is used to solve constrained optimization problems. Three constraint handling techniques are investigated: truncation selection, feasibility tournament, and Stochastic Ranking. NOPREDA's performance is competitive in problems with inequality constraints. However, a mechanism for properly handling equality constraints remains as part of our future research work.

[1]  K. Ramachandran,et al.  Mathematical Statistics with Applications. , 1992 .

[2]  Anne Auger,et al.  EEDA : A New Robust Estimation of Distribution Algorithms , 2004 .

[3]  Carlos A. Coello Coello,et al.  PASSSS: an implementation of a novel diversity strategy for handling constraints , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[4]  Carlos A. Coello Coello,et al.  Handling constraints using multiobjective optimization concepts , 2004 .

[5]  Xin Yao,et al.  Clustering and learning Gaussian distribution for continuous optimization , 2005, IEEE Trans. Syst. Man Cybern. Part C.

[6]  Pedro Larrañaga,et al.  Optimization in Continuous Domains by Learning and Simulation of Gaussian Networks , 2000 .

[7]  Marcus Gallagher,et al.  On the importance of diversity maintenance in estimation of distribution algorithms , 2005, GECCO '05.

[8]  Chris P. Tsokos,et al.  Mathematical Statistics with Applications , 2009 .

[9]  Franz Rothlauf,et al.  The correlation-triggered adaptive variance scaling IDEA , 2006, GECCO.

[10]  R. Iman,et al.  A distribution-free approach to inducing rank correlation among input variables , 1982 .

[11]  P. Bosman,et al.  An algorithmic framework for density estimation based evolutionary algorithms , 1999 .

[12]  Topon Kumar Paul,et al.  RESEARCH ON THE IMPROVEMENT OF EFFICIENCY OF EDAS FOR OPTIMIZATION , 2004 .

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

[14]  Marcus Gallagher,et al.  Experimental results for the special session on real-parameter optimization at CEC 2005: a simple, continuous EDA , 2005, 2005 IEEE Congress on Evolutionary Computation.

[15]  David Heckerman,et al.  Learning Gaussian Networks , 1994, UAI.

[16]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[17]  P. Bosman,et al.  Continuous iterated density estimation evolutionary algorithms within the IDEA framework , 2000 .

[18]  P. A. Simionescu,et al.  Constrained optimization problem solving using estimation of distribution algorithms , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[19]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..