Effectiveness of scalability improvement attempts on the performance of NSGA-II for many-objective problems

  • Authors:
  • Hisao Ishibuchi;Noritaka Tsukamoto;Yasuhiro Hitotsuyanagi;Yusuke Nojima

  • Affiliations:
  • Osaka Prefecture University, Sakai, Japan;Osaka Prefecture University, Sakai, Japan;Osaka Prefecture University, Sakai, Japan;Osaka Prefecture University, Sakai, Japan

  • Venue:
  • Proceedings of the 10th annual conference on Genetic and evolutionary computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently a number of approaches have been proposed to improve the scalability of evolutionary multiobjective optimization (EMO) algorithms to many-objective problems. In this paper, we examine the effectiveness of those approaches through computational experiments on multiobjective knapsack problems with two, four, six, and eight objectives. First we briefly review related studies on evolutionary many-objective optimization. Next we explain why Pareto dominance-based EMO algorithms do not work well on many-objective optimization problems. Then we explain various scalability improvement approaches. We examine their effects on the performance of NSGA-II through computational experiments. Experimental results clearly show that the diversity of solutions is decreased by most scalability improvement approaches while the convergence of solutions to the Pareto front is improved. Finally we conclude this paper by pointing out future research directions.