• DocumentCode
    3427789
  • Title

    SMPSO: A new PSO-based metaheuristic for multi-objective optimization

  • Author

    Nebro, A.J. ; Durillo, J.J. ; García-Nieto, J. ; Coello, C. A Coello ; Luna, F. ; Alba, E.

  • Author_Institution
    Dept. de Lenguajes y Cienc. de la Comput., Univ. of Malaga, Malaga
  • fYear
    2009
  • fDate
    March 30 2009-April 2 2009
  • Firstpage
    66
  • Lastpage
    73
  • Abstract
    In this work, we present a new multi-objective particle swarm optimization algorithm (PSO) characterized by the use of a strategy to limit the velocity of the particles. The proposed approach, called Speed-constrained Multi-objective PSO (SMPSO) allows to produce new effective particle positions in those cases in which the velocity becomes too high. Other features of SMPSO include the use of polynomial mutation as a turbulence factor and an external archive to store the non-dominated solutions found during the search. Our proposed approach is compared with respect to five multi-objective metaheuristics representative of the state-of-the-art in the area. For the comparison, two different criteria are adopted: the quality of the resulting approximation sets and the convergence speed to the Pareto front. The experiments carried out indicate that SMPSO obtains remarkable results in terms of both, accuracy and speed.
  • Keywords
    Pareto optimisation; convergence; particle swarm optimisation; PSO-based metaheuristic; Pareto front; convergence speed; multi-objective optimization; multi-objective particle swarm optimization algorithm; polynomial mutation; speed-constrained multi-objective PSO; Birds; Contracts; Educational institutions; Genetic algorithms; Genetic mutations; Marine animals; Particle swarm optimization; Performance analysis; Polynomials; Proposals;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational intelligence in miulti-criteria decision-making, 2009. mcdm '09. ieee symposium on
  • Conference_Location
    Nashville, TN
  • Print_ISBN
    978-1-4244-2764-2
  • Type

    conf

  • DOI
    10.1109/MCDM.2009.4938830
  • Filename
    4938830