VarMOPSO: multi-objective particle swarm optimization with variable population size

  • Authors:
  • Javier López;Laura Lanzarini;Armando De Giusti

  • Affiliations:
  • Instituto de Investigación en Informática LIDI, School of Computer Sciences, National University of La Plata, La Plata, Buenos Aires, Argentina;Instituto de Investigación en Informática LIDI, School of Computer Sciences, National University of La Plata, La Plata, Buenos Aires, Argentina;Instituto de Investigación en Informática LIDI, School of Computer Sciences, National University of La Plata, La Plata, Buenos Aires, Argentina

  • Venue:
  • IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The PSO (Particle Swarm Optimization) metaheuristics, originally defined for solving single-objective problems, has been applied to multi-objective problems with very good results. In its initial conception, the algorithm has a fixed-size population. In this paper, a new variation of this metaheuristics, called VarMOPSO (Variable Multi-Objective Particle Swarm Optimization), characterized by a variable-sized population, is proposed. To this end, the concepts of age and neighborhood are incorporated to be able to modify the size of the population for the different generations. This algorithm was compared with the version that uses fixed-size populations, as well as with other metaheuristics, all of them representative of the state of the art in multi-objective optimization. In all cases, three widely used metrics were considered as quality indicators for Pareto front. The results obtained were satisfactory.