Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problems

被引:154
作者
Li, Yuhua [1 ,2 ]
Zhan, Zhi-Hui [2 ,3 ]
Lin, Shujin [4 ]
Zhang, Jun [3 ]
Luo, Xiaonan [1 ,2 ]
机构
[1] Natl Engn Res Ctr Digital Life, Guangzhou 510006, Guangdong, Peoples R China
[2] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China
[3] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[4] Sun Yat Sen Univ, Sch Commun & Design, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Particle swarm optimization (PSO); Competition; Cooperation; Information sharing; Global optimization problems; HARMONY SEARCH ALGORITHM; EVOLUTIONARY; DIVERSITY; OPTIMA; MODEL;
D O I
10.1016/j.ins.2014.09.030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes an information sharing mechanism (ISM) to improve the performance of particle swarm optimization (PSO). The ISM allows each particle to share its best search information, so that all the other particles can take advantage of the shared information by communicating with it. In this way, the particles could enhance the mutual interaction with the others sufficiently and heighten their search ability greatly by using the search information of the whole swarm. Also, a competitive and cooperative (CC) operator is designed for a particle to utilize the shared information in a proper and efficient way. As the ISM share the search information among all the particles, it is an appropriate way to mix up information of the whole swarm for a better exploration of the landscape. Therefore, the competitive and cooperative PSO with ISM (CCPSO-ISM) is capable to prevent the premature convergence when solving global optimization problems. The satisfactory performance of CCPSO-ISM is evaluated by comparing it with other variants of PSOs on a set of 16 global optimization functions. Moreover, the effectiveness and efficiency of CCPSO-ISM is validated under different test environments such as biased initialization, coordinate rotated and high dimensionality. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:370 / 382
页数:13
相关论文
共 43 条
[1]  
Andrews PS, 2006, IEEE C EVOL COMPUTAT, P1029
[2]  
Angeline P.J., 1998, P IEEE INT C EV COMP, P1945
[3]   CAPSO: Centripetal accelerated particle swarm optimization [J].
Beheshti, Zahra ;
Shamsuddin, Siti Mariyam Hj. .
INFORMATION SCIENCES, 2014, 258 :54-79
[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]   A robust adaptive array beamformer using particle swarm optimization for space-time code division multiple access systems [J].
Chang, Jhih-Chung .
INFORMATION SCIENCES, 2014, 278 :174-186
[6]   Co-operation and competition: Contributions to an evolutionary and developmental model [J].
Charlesworth, WR .
INTERNATIONAL JOURNAL OF BEHAVIORAL DEVELOPMENT, 1996, 19 (01) :25-38
[7]   A hybrid ANFIS model for business failure prediction utilizing particle swarm optimization and subtractive clustering [J].
Chen, Mu-Yen .
INFORMATION SCIENCES, 2013, 220 :180-195
[8]  
Eberhart R., P 6 INT S MICROMACHI, P39, DOI DOI 10.1109/MHS.1995.494215
[9]   Self-adaptive mix of particle swarm methodologies for constrained optimization [J].
Elsayed, Saber M. ;
Sarker, Ruhul A. ;
Mezura-Montes, Efren .
INFORMATION SCIENCES, 2014, 277 :216-233
[10]  
Engelbrecht A.P., 2006, Fundamentals of Computational Swarm Intelligence