A Constrained Multi-Objective Evolutionary Algorithm Based on Boundary Search and Archive

In this paper, we propose a decomposition-based evolutionary algorithm with boundary search and archive for constrained multi-objective optimization problems (CMOPs), named CM2M. It decomposes a CMOP into a number of optimization subproblems and optimizes them simultaneously. Moreover, a novel constraint handling scheme based on the boundary search and archive is proposed. Each subproblem has one archive, including a subpopulation and a temporary register. Those individuals with better objective values and lower constraint violations are recorded in the subpopulation, while the temporary register consists of those individuals ever found before. To improve the efficiency of the algorithm, the boundary search method is designed. This method makes the feasible individuals with a higher probability to perform genetic operator with the infeasible individuals. Especially, when the constraints are active at the Pareto solutions, it can play its leading role. Compared with two algorithms, i.e. CMOEA/D-DE-CDP and Gary's algorithm, on 18 CMOPs, the results show the effectiveness of the proposed constraint handling scheme.