A MOPSO algorithm based exclusively on pareto dominance concepts

  • Authors:

  • Julio E. Alvarez-Benitez;Richard M. Everson;Jonathan E. Fieldsend

  • Affiliations:

  • Department of Computer Science, University of Exeter, UK;Department of Computer Science, University of Exeter, UK;Department of Computer Science, University of Exeter, UK

  • Venue:
  • EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In extending the Particle Swarm Optimisation methodology to multi-objective problems it is unclear how global guides for particles should be selected. Previous work has relied on metric information in objective space, although this is at variance with the notion of dominance which is used to assess the quality of solutions. Here we propose methods based exclusively on dominance for selecting guides from a non-dominated archive. The methods are evaluated on standard test problems and we find that probabilistic selection favouring archival particles that dominate few particles provides good convergence towards and coverage of the Pareto front. We demonstrate that the scheme is robust to changes in objective scaling. We propose and evaluate methods for confining particles to the feasible region, and find that allowing particles to explore regions close to the constraint boundaries is important to ensure convergence to the Pareto front.