A Two-State Dynamic Decomposition-Based Evolutionary Algorithm for Handling Many-Objective Optimization Problems

Abstract

Decomposition-based many-objective evolutionary algorithms (D-MaOEAs) are brilliant at keeping population diversity for predefined reference vectors or points. However, studies indicate that the performance of an D-MaOEA strongly depends on the similarity between the shape of the reference vectors (points) and that of the PF (a set of Pareto-optimal solutions symbolizing balance among objectives of many-objective optimization problems) of the many-objective problem (MaOP). Generally, MaOPs with expected PFs are not realistic. Consequently, the inevitable weak similarity results in many inactive subspaces, creating huge difficulties for maintaining diversity. To address these issues, we propose a two-state method to judge the decomposition status according to the number of inactive reference vectors. Then, two novel reference vector adjustment strategies, set as parts of the environmental selection approach, are tailored for the two states to delete inactive reference vectors and add new active reference vectors, respectively, in order to ensure that the reference vectors are as close as possible to the PF of the optimization problem. Based on the above strategies and an efficient convergence performance indicator, an active reference vector-based two-state dynamic decomposition-base MaOEA, referred to as ART-DMaOEA, is developed in this paper. Extensive experiments were conducted on ART-DMaOEA and five state-of-the-art MaOEAs on MaF1-MaF9 and WFG1-WFG9, and the comparative results show that ART-DMaOEA has the most competitive overall performance.