By Topic

Using archiving methods to control convergence and diversity for Many-Objective Problems in Particle Swarm Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Andre Britto ; Federal University of Parana, Curitiba, Brazil 81531-980 ; Aurora Pozo

Multi-Objective Particle Swarm Optimization (MOPSO) is a population based multi-objective meta-heuristic inspired on animal swarm intelligence. It is used to solve several Multi-Objective Optimization Problems (MOPs), problems with more than one objective function. However, Multi-Objective Evolutionary Algorithms (MOEAs), including MOPSO, have some limitations when the number of objective grows. Many-Objective Optimization research methods to decrease the negative effect of applying MOEAs into problems with more than three objective functions. In this context, the goal of this work is to explore several archiving methods from the literature used by MOPSO to store the selected leaders into Many-Objective Problems. Moreover, new archiving methods are proposed specially for these problems. The use of the archiving methods into MOPSO is evaluated through an empirical analysis aiming to observe the impact of these methods in the convergence and the diversity to the Pareto front, in Many-Objective scenarios.

Published in:

2012 IEEE Congress on Evolutionary Computation

Date of Conference:

10-15 June 2012