A Two-Archive Many-Objective Optimization Algorithm Based on D-Domination and Decomposition.

Decomposition-based evolutionary algorithms are popular with solving multi-objective optimization problems. It uses weight vectors and aggregate functions to keep the convergence and diversity. However, it is hard to balance diversity and convergence in high-dimensional objective space. In order to discriminate solutions and equilibrate the convergence and diversity in high-dimensional objective space, a two-archive many-objective optimization algorithm based on D-dominance and decomposition (Two Arch-D) is proposed. In Two Arch-D, the method of D-dominance and adaptive strategy adjusting parameter are used to apply selection pressure on the population to identify better solutions. Then, it uses the two archives’ strategy to equilibrate convergence and diversity, and after classifying solutions in convergence archive, the improved Tchebycheff function is used to evaluate the solution set and retain the better solutions. For the diversity archive, the diversity is maintained by making any two solutions as far apart and different as possible. Finally, the Two Arch-D is compared with other four multi-objective evolutionary algorithms on 45 many-objective test problems (including 5, 10 and 15 objectives). Good performance of the algorithm is verified by the description and analysis of the experimental results.