Key points are not available for this paper at this time.
Many-objective optimization problems (ManyOPs) refer, usually, to those multiobjective problems (MOPs) with more than three objectives. Their large numbers of objectives pose challenges to multiobjective evolutionary algorithms (MOEAs) in terms of convergence, diversity, and complexity. Most existing MOEAs can only perform well in one of those three aspects. In view of this, we aim to design a more balanced MOEA on ManyOPs in all three aspects at the same time. Among the existing MOEAs, the two-archive algorithm (TwoArch) is a low-complexity algorithm with two archives focusing on convergence and diversity separately. Inspired by the idea of TwoArch, we propose a significantly improved two-archive algorithm (i. e. , TwoArch2) for ManyOPs in this paper. In our TwoArch2, we assign different selection principles (indicator-based and Pareto-based) to the two archives. In addition, we design a new Lp-norm-based (p <; 1) diversity maintenance scheme for ManyOPs in TwoArch2. In order to evaluate the performance of TwoArch2 on ManyOPs, we have compared it with several MOEAs on a wide range of benchmark problems with different numbers of objectives. The experimental results show that TwoArch2 can cope with ManyOPs (up to 20 objectives) with satisfactory convergence, diversity, and complexity.
Wang et al. (Tue,) studied this question.