A dynamic dual-population co-evolution multi-objective evolutionary algorithm for constrained multi-objective optimization problems

Abstract

Listen

Translate article

Many multi-objective evolutionary algorithms are proposed to handle constrained multi-objective optimization problems. Nevertheless, they often fail to appropriately balance feasibility, convergence and diversity of the population. This paper proposed a dynamic dual-population co-evolution multi-objective evolutionary algorithm (DDCMEA) to solve this issue. In DDCMEA, a dynamic dual-population co-evolution strategy is employed to balance the convergence and the feasibility by dynamically adjusting the offspring number of the two populations. In the early stage of evolution, the algorithm mainly focuses on the convergence and more offspring of the first population are generated. In the late stage of evolution, the algorithm mainly focuses on the feasibility and more offspring of the second population are generated. Finally, feasible solutions with good convergence could be obtained. To further enhance the diversity of the offspring and obtain feasible solutions with a wide spread of distribution, the evolution operators of the genetic algorithm and the differential evolution are chosen as the search engines for the first population and the second population, respectively. The performance of DDCMEA is further tested through thirty-one bench-mark test problems and two real-world problems in comparison with other five state-of-the-art algorithms. The results show the proposed algorithm DDCMEA achieves competitive performance when handling constrained multi-objective optimization problems.