All-dimension neighborhood based particle swarm optimization with randomly selected neighbors

被引:45
作者
Sun, Wei [1 ,2 ]
Lin, Anping [1 ,2 ]
Yu, Hongshan [1 ]
Liang, Qiaokang [1 ,2 ]
Wu, Guohua [3 ]
机构
[1] Hunan Univ, Coll Elect & Informat Engn, Changsha 410082, Hunan, Peoples R China
[2] Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China
[3] Natl Univ Def Technol, Coll Informat Syst & Management, Changsha, Hunan, Peoples R China
关键词
Particle swarm optimization; All-dimension neighborhood search; Randomly selected neighbors; Local search; GLOBAL OPTIMIZATION; SEARCH; LEADER;
D O I
10.1016/j.ins.2017.04.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Particle swarm optimization (PSO) is widely used for solving various optimization problems, since it has few parameters and is easy to implement. However, canonical PSO generally suffers from premature convergence because it usually loses diversity too rapidly during the evolutionary process. To improve the performance of PSO on complex problems, an all-dimension-neighborhood-based PSO with randomly selected neighbors learning strategy (ADN-RSN-PSO) is proposed in this study. The randomly selected neighbors (RSN) learning strategy is adopted in the early stage of PSO to enhance the swarm diversity, while the all-dimension neighborhood (ADN) strategy is utilized in the later stage to accelerate the convergence rate. The ADN strategy enhances the local search capability around the global-best solution in a dimension by dimension manner, and the search distance is adapted by shrinking and random-expansion operators. Experimental results show that ADN-PSO can improve the exploitation capability of the global version of PSO. To test the performance of the proposed ADN-RSN-PSO, comparison tests on the CEC2013 test suite are carried out. The comparison results reveal that ADN-RSN-PSO outperforms other peer PSO variants. In the end, the proposed ADN-RSN-PSO is applied to the radar system design problem to demonstrate its potential in real-life applications. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:141 / 156
页数:16
相关论文
共 42 条
[1]   Chaos embedded particle swarm optimization algorithms [J].
Alatas, Bilal ;
Akin, Erhan ;
Ozer, A. Bedri .
CHAOS SOLITONS & FRACTALS, 2009, 40 (04) :1715-1734
[2]   The best-so-far selection in Artificial Bee Colony algorithm [J].
Banharnsakun, Anan ;
Achalakul, Tiranee ;
Sirinaovakul, Booncharoen .
APPLIED SOFT COMPUTING, 2011, 11 (02) :2888-2901
[3]  
Barr R. S., 1995, Journal of Heuristics, V1, P9, DOI 10.1007/BF02430363
[4]   CAPSO: Centripetal accelerated particle swarm optimization [J].
Beheshti, Zahra ;
Shamsuddin, Siti Mariyam Hj. .
INFORMATION SCIENCES, 2014, 258 :54-79
[5]   Particle Swarm Optimization with an Aging Leader and Challengers [J].
Chen, Wei-Neng ;
Zhang, Jun ;
Lin, Ying ;
Chen, Ni ;
Zhan, Zhi-Hui ;
Chung, Henry Shu-Hung ;
Li, Yun ;
Shi, Yu-Hui .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2013, 17 (02) :241-258
[6]   A social learning particle swarm optimization algorithm for scalable optimization [J].
Cheng, Ran ;
Jin, Yaochu .
INFORMATION SCIENCES, 2015, 291 :43-60
[7]   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
[8]  
de França FO, 2005, GECCO 2005: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOLS 1 AND 2, P289
[9]   A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms [J].
Derrac, Joaquin ;
Garcia, Salvador ;
Molina, Daniel ;
Herrera, Francisco .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :3-18
[10]   A METHOD OF A SPREAD-SPECTRUM RADAR POLYPHASE CODE DESIGN [J].
DUKIC, ML ;
DOBROSAVLJEVIC, ZS .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1990, 8 (05) :743-749