Estimation distribution algorithms on constrained optimization problems

• Published in: Applied mathematics and computation Vol. 339; pp. 323 - 345
• Main Authors: Gao, Shujun, de Silva, Clarence W.
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 15.12.2018
• Subjects: Constrained optimization problems; Estimation distribution algorithms; Extreme elitism selection; Gaussian distribution; Top best solutions; Gaussian distribution; Extreme elitism selection; Estimation distribution algorithms; Top best solutions; Constrained optimization problems
• ISSN: 0096-3003; 1873-5649
• DOI: 10.1016/j.amc.2018.07.037

Estimation distribution algorithm (EDA) is an evolution technique that uses sampling to generate the offspring. Most developed EDAs focus on solving the optimization problems which only have the constraints of variable boundaries. In this paper, EDAs are proposed for solving the constrained optimization problems (COPs) involving various types of constraints. In particular, a modified extreme elitism selection method is designed for EDAs to handle the constraints. This selection extrudes the role of some top best solutions to pull the mean vector of the Gaussian distribution towards these best solutions and makes EDAs form a primary evolutionary direction. The EDAs based on five different Gaussian distribution with this selection are evaluated using a set of benchmark functions and some engineering design problems. It is found that for solving these problems, the EDA that is based on a single multivariate Gaussian distribution model with the modified extreme elitism selection outperforms the other EDAs and some state-of-the-art techniques.