Abstract
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 (Two_Arch) is a low-complexity algorithm with two archives focusing on convergence and diversity separately. Inspired by the idea of Two_Arch, we propose a significantly improved two-archive algorithm (i.e., Two_Arch2) for ManyOPs in this paper. In our Two_Arch2, 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 Two_Arch2. In order to evaluate the performance of Two_Arch2 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 Two_Arch2 can cope with ManyOPs (up to 20 objectives) with satisfactory convergence, diversity, and complexity.
Funding Information
  • National Basic Research Program (973 Program) of China (2013CB329402)
  • EU FP7 IRSES Grant on “Nature Inspired Computation and its Applications (NICaiA)” (247619)
  • EPSRC Grant on “DAASE: Dynamic Adaptive Automated Software Engineering” (EP/J017515/1)
  • Program for Cheung Kong Scholars and Innovative Research Team in University (IRT1170)
  • National Natural Science Foundation of China (61329302)
  • National Research Foundation for the Doctoral Program of Higher Education of China (20100203120008)
  • Fundamental Research Funds for the Central Universities (K5051302028)
  • Royal Society Wolfson Research Merit Award

This publication has 47 references indexed in Scilit: