Strength Pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization

Evol Comput. 2010 Spring;18(1):127-56. doi: 10.1162/evco.2010.18.1.18105.

Abstract

This paper proposes an efficient particle swarm optimization (PSO) technique that can handle multi-objective optimization problems. It is based on the strength Pareto approach originally used in evolutionary algorithms (EA). The proposed modified particle swarm algorithm is used to build three hybrid EA-PSO algorithms to solve different multi-objective optimization problems. This algorithm and its hybrid forms are tested using seven benchmarks from the literature and the results are compared to the strength Pareto evolutionary algorithm (SPEA2) and a competitive multi-objective PSO using several metrics. The proposed algorithm shows a slower convergence, compared to the other algorithms, but requires less CPU time. Combining PSO and evolutionary algorithms leads to superior hybrid algorithms that outperform SPEA2, the competitive multi-objective PSO (MO-PSO), and the proposed strength Pareto PSO based on different metrics.

MeSH terms

  • Algorithms*
  • Computer Simulation*
  • Models, Theoretical*
  • Search Engine / methods*