Particle Swarm Optimization with an Aging Leader and Challengers

被引:497
作者
Chen, Wei-Neng [1 ]
Zhang, Jun [1 ]
Lin, Ying [1 ]
Chen, Ni [1 ]
Zhan, Zhi-Hui [1 ]
Chung, Henry Shu-Hung [2 ]
Li, Yun [3 ]
Shi, Yu-Hui [4 ]
机构
[1] Sun Yat Sen Univ, Dept Comp Sci, Key Lab Machine Intelligence & Sensor Network, Minist Educ, Guangzhou 510275, Guangdong, Peoples R China
[2] City Univ Hong Kong, Kowloon, Hong Kong, Peoples R China
[3] Univ Glasgow, Glasgow G12 8QQ, Lanark, Scotland
[4] Xian Jiaotong Liverpool Univ, Dept Elect & Elect Engn, Suzhou 215123, Peoples R China
基金
中国国家自然科学基金;
关键词
Aging; global search; leader; particle swarm optimization (PSO); premature convergence; GLOBAL OPTIMIZATION; ALGORITHMS; OPTIMA;
D O I
10.1109/TEVC.2011.2173577
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In nature, almost every organism ages and has a limited lifespan. Aging has been explored by biologists to be an important mechanism for maintaining diversity. In a social animal colony, aging makes the old leader of the colony become weak, providing opportunities for the other individuals to challenge the leadership position. Inspired by this natural phenomenon, this paper transplants the aging mechanism to particle swarm optimization (PSO) and proposes a PSO with an aging leader and challengers (ALC-PSO). ALC-PSO is designed to overcome the problem of premature convergence without significantly impairing the fast-converging feature of PSO. It is characterized by assigning the leader of the swarm with a growing age and a lifespan, and allowing the other individuals to challenge the leadership when the leader becomes aged. The lifespan of the leader is adaptively tuned according to the leader's leading power. If a leader shows strong leading power, it lives longer to attract the swarm toward better positions. Otherwise, if a leader fails to improve the swarm and gets old, new particles emerge to challenge and claim the leadership, which brings in diversity. In this way, the concept "aging" in ALC-PSO actually serves as a challenging mechanism for promoting a suitable leader to lead the swarm. The algorithm is experimentally validated on 17 benchmark functions. Its high performance is confirmed by comparing with eight popular PSO variants.
引用
收藏
页码:241 / 258
页数:18
相关论文
共 49 条
[1]  
Andrews PS, 2006, IEEE C EVOL COMPUTAT, P1029
[2]   Using selection to improve particle swarm optimization [J].
Angeline, PJ .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :84-89
[3]  
[Anonymous], 2005, NAT COMPUT
[4]   Locating multiple optima using particle swarm optimization [J].
Brits, R. ;
Engelbrecht, A. P. ;
van den Bergh, F. .
APPLIED MATHEMATICS AND COMPUTATION, 2007, 189 (02) :1859-1883
[5]   Particle swarm optimization with recombination and dynamic linkage discovery [J].
Chen, Ying-Ping ;
Peng, Wen-Chih ;
Jian, Ming-Chung .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2007, 37 (06) :1460-1470
[6]   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
[7]   Bio-inspired algorithms for the design of multiple optimal power system stabilizers: SPPSO and BFA [J].
Das, Tridib Kumar ;
Venayagamoorthy, Ganesh Kumar ;
Aliyu, Usman O. .
IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS, 2008, 44 (05) :1445-1457
[8]   Particle swarm optimization: Basic concepts, variants and applications in power systems [J].
del Valle, Yamille ;
Venayagamoorthy, Ganesh Kumar ;
Mohagheghi, Salman ;
Hernandez, Jean-Carlos ;
Harley, Ronald G. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (02) :171-195
[9]  
Eberhart R., 1995, MHS 95, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]
[10]  
Gavrilov Leonid A, 2002, ScientificWorldJournal, V2, P339