A constraint-handling mechanism for particle swarm optimization

被引:110
作者
Pulido, GT [1 ]
Coello, CAC [1 ]
机构
[1] IPN, CINVESTAV, Comp Sci Sect, Elect Engn Dept,Evolutionary Computat Grp,EVOCINV, Mexico City 07300, DF, Mexico
来源
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2004年
关键词
D O I
10.1109/CEC.2004.1331060
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a simple mechanism to handle constraints with a particle swarm optimization algorithm. Our proposal uses a simple criterion based on closeness of a particle to the feasible region in order to select a leader. Additionally, our algorithm incorporates a turbulence operator that improves the exploratory capabilities of our particle swarm optimization algorithm. Despite its relative simplicity, our comparison of results indicates that the proposed approach is highly competitive with respect to three constraint-handling techniques representative of the state-of-the-art in the area.
引用
收藏
页码:1396 / 1403
页数:8
相关论文
共 18 条
[1]  
[Anonymous], 2000, SOLVE IT MODERN HEUR
[2]  
Coath G, 2003, IEEE C EVOL COMPUTAT, P2419
[3]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[4]  
DEB K, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P42
[5]  
FIELDSEND JE, 2002, P 2002 UK WORKSH COM, P37
[6]  
Hamida SB, 2002, IEEE C EVOL COMPUTAT, P884, DOI 10.1109/CEC.2002.1007042
[7]  
HU X, 2002, P 6 WORLD MULT SYST, V5
[8]   Engineering optimization with particle swarm [J].
Hu, XH ;
Eberhart, RC ;
Shi, YH .
PROCEEDINGS OF THE 2003 IEEE SWARM INTELLIGENCE SYMPOSIUM (SIS 03), 2003, :53-57
[9]  
Kennedy J., 2001, SWARM INTELLIGENCE
[10]   Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization [J].
Koziel, Slawomir ;
Michalewicz, Zbigniew .
EVOLUTIONARY COMPUTATION, 1999, 7 (01) :19-44