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

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 hybri...

Full description

Saved in:
Bibliographic Details
Published in:Evolutionary computation Vol. 18; no. 1; p. 127
Main Authors: Elhossini, Ahmed, Areibi, Shawki, Dony, Robert
Format: Journal Article
Language:English
Published: United States 01.03.2010
Subjects:
Algorithms
Computer Simulation
Models, Theoretical
Search Engine - methods
ISSN:1530-9304, 1530-9304
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1530-9304
1530-9304
DOI:10.1162/evco.2010.18.1.18105