Handling multiple objectives with particle swarm optimization

被引:1597
作者
Coello, CAC [1 ]
Pulido, GT
Lechuga, MS
机构
[1] CINVESTAV IPN, Secc Computac, Dept Ing Elect, Secc Computac, Mexico City 07300, DF, Mexico
[2] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England
关键词
evolutionary multiobjective optimization; multiobjective optimization; multiobjective particle swarm optimization; particle swarm optimization;
D O I
10.1109/tevc.2004.826067
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents an approach in which Pareto dominance is incorporated into particle swarm optimization (PSO) in order to allow this heuristic to handle problems with several objective functions. Unlike other current proposals to extend PSO to solve multiobjective optimization problems, our algorithm uses a secondary (i.e., external) repository of particles that is later used by other particles to guide their own flight. We also incorporate a special mutation operator that enriches the exploratory capabilities of our algorithm. The proposed approach is validated using several test functions and metrics taken from the standard literature on evolutionary multiobjective optimization. Results indicate that the approach is highly competitive and that can be considered a viable alternative to solve multiobjective optimization problems.
引用
收藏
页码:256 / 279
页数:24
相关论文
共 37 条
[1]  
[Anonymous], 1999, EVOLUTIONARY ALGORIT
[2]  
[Anonymous], THESIS WRIGHT PATTER
[3]  
Branke J., 2002, EVOLUTIONARY OPTIMIZ
[4]   Generalized center method for multiobjective engineering optimization [J].
Cheng, FY ;
Li, XS .
ENGINEERING OPTIMIZATION, 1999, 31 (05) :641-661
[5]  
Coello C.A., 2002, Evolutionary Algorithms for Solving Multi-Objective Problems
[6]  
Coello C.A., 2001, P 3 ANN C GEN EV COM, P274
[7]  
Coello CAC, 2002, IEEE C EVOL COMPUTAT, P1051, DOI 10.1109/CEC.2002.1004388
[8]  
Coello CAC, 2001, LECT NOTES COMPUT SC, V1993, P126
[9]  
Coello Coello C. A., EMOO REPOSITORY
[10]  
DEB K, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P42