A Memetic Differential Evolution Algorithm Based on Dynamic Preference for Constrained Optimization Problems

الملخص EN

The constrained optimization problem (COP) is converted into a biobjective optimization problem first, and then a new memetic differential evolution algorithm with dynamic preference is proposed for solving the converted problem.

In the memetic algorithm, the global search, which uses differential evolution (DE) as the search scheme, is guided by a novel fitness function based on achievement scalarizing function (ASF).

The novel fitness function constructed by a reference point and a weighting vector adjusts preference dynamically towards different objectives during evolution, in which the reference point and weighting vector are determined adapting to the current population.

In the local search procedure, simplex crossover (SPX) is used as the search engine, which concentrates on the neighborhood embraced by both the best feasible and infeasible individuals and guides the search approaching the optimal solution from both sides of the boundary of the feasible region.

As a result, the search can efficiently explore and exploit the search space.

Numerical experiments on 22 well-known benchmark functions are executed, and comparisons with five state-of-the-art algorithms are made.

The results illustrate that the proposed algorithm is competitive with and in some cases superior to the compared ones in terms of the quality, efficiency, and the robustness of the obtained results.