Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II

  • Authors:

  • Hui Li;Qingfu Zhang

  • Affiliations:

  • School of Computer Science, University of Nottingham, Nottingham, UK and Department of Computing and Electronic Systems, University of Essex, Colchester, UK;Department of Computing and Electronic Systems, University of Essex, Colchester, UK

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Partly due to lack of test problems, the impact of the Pareto set (PS) shapes on the performance of evolutionary algorithms has not yet attracted much attention. This paper introduces a general class of continuous multiobjective optimization test instances with arbitrary prescribed PS shapes, which could be used for studying the ability of multiobjective evolutionary algorithms for dealing with complicated PS shapes. It also proposes a new version of MOEA/D based on differential evolution (DE), i.e., MOEA/D-DE, and compares the proposed algorithm with NSGA-II with the same reproduction operators on the test instances introduced in this paper. The experimental results indicate that MOEA/D could significantly outperform NSGA-II on these test instances. It suggests that decomposition based multiobjective evolutionary algorithms are very promising in dealing with complicated PS shapes.