ε-Constrained Differential Evolution Using an Adaptive ε-Level Control Method

Abstract

Evolutionary algorithms and swarm intelligence algorithms have been widely used for constrained optimization problems for decades and numerous techniques for constraint handling have been proposed. The <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\varepsilon }$ </tex-math></inline-formula> -constrained method is a very effective one. In the literature, the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\varepsilon }$ </tex-math></inline-formula> value was usually controlled via an exponential function, which is not competent for solving certain types of constrained optimization problems, e.g., whose global optima are located near the boundary of the feasible and infeasible regions. To solve this problem, this article proposes a new adaptive <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\varepsilon }$ </tex-math></inline-formula> control method and incorporate it into a basic differential evolution (DE) algorithm: (DE/rand/1/exp). Based on the information of constraint violation in the current population, the adaptive method controls the value of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\varepsilon }$ </tex-math></inline-formula> through a simple heuristic rule. Compared with the traditional exponential function-based control methods, the proposed adaptive method can prevent the algorithm from being trapped into local optima while retaining the obtained near-optimal candidate solutions in the infeasible region for generating promising searching paths. Besides, we set the crossover rate (CR) as a more reasonable value for DE/rand/1/exp, which can enhance the efficiency significantly. The well-known 2006 IEEE Congress on Evolutionary Computation (CEC 2006) competition on real-parameter single-objective constrained optimization benchmark is adopted to evaluate the effectiveness of the proposed adaptive <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\varepsilon }$ </tex-math></inline-formula> -constrained DE. Fifteen constrained engineering optimization problems are collected from the literature to test the proposed algorithm. Moreover, the adaptive <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\varepsilon }$ </tex-math></inline-formula> control method is extended to an adaptive algorithm to solve the benchmark problems from CEC 2017. The comparison results confirm the superiority of the proposed method.