Measuring the convergence and diversity of CDAS Multi-Objective Particle Swarm Optimization Algorithms: A study of many-objective problems

  • Authors:
  • Andre B. de Carvalho;Aurora Pozo

  • Affiliations:
  • Computer Science Department, Federal University of Paraná (UFPR), PO 19081, 81531-970 Curitiba, Brazil;Computer Science Department, Federal University of Paraná (UFPR), PO 19081, 81531-970 Curitiba, Brazil

  • Venue:
  • Neurocomputing
  • Year:
  • 2012

Quantified Score

Hi-index 0.01

Visualization

Abstract

The interest for many-objective optimization has grown due to the limitations of Pareto dominance based Multi-Objective Evolutionary Algorithms when dealing with problems of a high number of objectives. Recently, some many-objective techniques have been proposed to avoid the deterioration of these algorithms' search ability. At the same time, the interest in the use of Particle Swarm Optimization (PSO) algorithms in multi-objective problems also grew. The PSO has been found to be very efficient to solve multi-objective problems (MOPs) and several Multi-Objective Particle Swarm Optimization (MOPSO) algorithms have been proposed. This work presents a study of the behavior of MOPSO algorithms in many-objective problems. The many-objective technique named control of dominance area of solutions (CDAS) is used on two Multi-Objective Particle Swarm Optimization algorithms. An empirical analysis is performed to identify the influence of the CDAS technique on the convergence and diversity of MOPSO algorithms using three different many-objective problems. The experimental results are compared applying quality indicators and statistical tests.