A bi-objective constrained optimization algorithm using a hybrid evolutionary and penalty function approach

作者：Deb Kalyanmoy^*; Datta Rituparna

来源：Engineering Optimization, 2013, 45(5): 503-527.

DOI：10.1080/0305215X.2012.685074

• constraint handling
• inequality and equality constraint
• penalty function
• bi-objective optimization
• hybrid methodology

Constrained optimization is a computationally difficult task, particularly if the constraint functions are nonlinear and non-convex. As a generic classical approach, the penalty function approach is a popular methodology which degrades the objective function value by adding a penalty proportional to the constraint violation. However, the penalty function approach has been criticized for its sensitivity to the associated penalty parameters. Since its inception, evolutionary algorithms have been modified in various ways to solve constrained optimization problems. Of them, the recent use of a bi-objective evolutionary algorithm in which the minimization of the constraint violation is included as an additional objective has received significant attention. In this article, a combination of a bi-objective evolutionary approach with the classical penalty function methodology is proposed, in a manner complementary to each other. The evolutionary approach provides an appropriate estimate of the penalty parameter, while the solution of an unconstrained penalized function by a classical method induces a convergence property to the overall hybrid algorithm. The working of the procedure on a number of standard numerical test problems and an engineering design problem is demonstrated. In most cases, the proposed hybrid methodology is observed to take one or more orders of magnitude fewer function evaluations to find the constrained minimum solution accurately than some of the best reported existing methodologies.

• 出版日期2013-5-1