Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization

被引:85
作者
Elhossini, Ahmed [1 ]
Areibi, Shawki [1 ]
Dony, Robert [1 ]
机构
[1] Univ Guelph, Sch Engn, Guelph, ON N1G 2W1, Canada
关键词
Multi-objective optimization; particle swarm optimization; evolutionary algorithms; strength Pareto evolutionary algorithm; SYSTEM; ALGORITHMS;
D O I
10.1162/evco.2010.18.1.18105
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes in efficient particle swarm optimization (PSO) technique that can handle multi-objective optimization problems. It is based on the strength Pareto approach originally used ill 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.
引用
收藏
页码:127 / 156
页数:30
相关论文
共 35 条
[1]   Particle swarm optimization versus genetic algorithms for phased array synthesis [J].
Boeringer, DW ;
Werner, DH .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2004, 52 (03) :771-779
[2]   Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[3]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[4]   Handling multiple objectives with particle swarm optimization [J].
Coello, CAC ;
Pulido, GT ;
Lechuga, MS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :256-279
[5]  
Deb, 1994, EVOLUTIONARY COMPUTA, V2, P221, DOI DOI 10.1162/EVCO.1994.2.3.221
[6]  
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]   Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems [J].
Deb, Kalyanmoy .
EVOLUTIONARY COMPUTATION, 1999, 7 (03) :205-230
[9]  
Eberhart R., 1995, MHS 95, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]
[10]  
Elhossini A, 2008, CAN CON EL COMP EN, P143