A hybrid particle swarm optimizer with sine cosine acceleration coefficients

被引:156
作者
Chen, Ke [1 ]
Zhou, Fengyu [1 ]
Yin, Lei [1 ]
Wang, Shuqian [1 ]
Wang, Yugang [1 ]
Wan, Fang [1 ]
机构
[1] Shandong Univ, Sch Control Sci & Engn, Jinan 250061, Shandong, Peoples R China
基金
中国国家自然科学基金;
关键词
Particle swarm optimizer; Sine cosine acceleration coefficients; Opposition-based learning; Sine map; GLOBAL OPTIMIZATION; ALGORITHM; CONVERGENCE; SYSTEMS; PSO;
D O I
10.1016/j.ins.2017.09.015
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Particle swarm optimization (PSO) has been widely used to solve complex global optimization tasks due to its implementation simplicity and inexpensive computational overhead. However, PSO has premature convergence, is easily trapped in the local optimum solution and is ineffective in balancing exploration and exploitation, especially in complex multi peak search functions. To overcome the shortcomings of PSO, a hybrid particle swarm optimizer with sine cosine acceleration coefficients (H-PSO-SCAC) is proposed to solve these problems. It is verified by the application of twelve numerical optimization problems. In H-PSO-SCAC, we make the following improvements: First, we introduce sine cosine acceleration coefficients (SCAC) to efficiently control the local search and convergence to the global optimum solution. Second, opposition-based learning (OBL) is adopted to initialize the population. Additionally, we utilize a sine map to adjust the inertia weight omega. Finally, we propose a modified position update formula. Experimental results show that, in the majority of cases, the H-PSO-SCAC approach is capable of efficiently solving numerical optimization tasks and outperforms the existing similar population-based algorithms and PSO variants proposed in recent years. Therefore, the H-PSO-SCAC algorithm is successfully employed as a novel optimization strategy. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:218 / 241
页数:24
相关论文
共 49 条
[1]   Opposition-based learning in the shuffled bidirectional differential evolution algorithm [J].
Ahandani, Morteza Alinia .
SWARM AND EVOLUTIONARY COMPUTATION, 2016, 26 :64-85
[2]  
[Anonymous], J INTELL MANUF
[3]  
[Anonymous], INT SOC OPTICS PHOTO
[4]  
[Anonymous], 2006, IEEE Comput. Intell. Mag., DOI [10.1109/MCI.2006.329691, DOI 10.1109/MCI.2006.329691]
[5]  
[Anonymous], 1995, 1995 IEEE INT C
[6]   A survey on optimization metaheuristics [J].
Boussaid, Ilhern ;
Lepagnot, Julien ;
Siarry, Patrick .
INFORMATION SCIENCES, 2013, 237 :82-117
[7]   Multiattribute decision making based on interval-valued intuitionistic fuzzy values and particle swarm optimization techniques [J].
Chen, Shyi-Ming ;
Huang, Zhi-Cheng .
INFORMATION SCIENCES, 2017, 397 :206-218
[8]   Nature-inspired metaheuristic optimization in least squares support vector regression for obtaining bridge scour information [J].
Chou, Jui-Sheng ;
Anh-Duc Pham .
INFORMATION SCIENCES, 2017, 399 :64-80
[9]   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
[10]   A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization [J].
Cui, Laizhong ;
Li, Genghui ;
Zhu, Zexuan ;
Lin, Qiuzhen ;
Wen, Zhenkun ;
Lu, Nan ;
Wong, Ka-Chun ;
Chen, Jianyong .
INFORMATION SCIENCES, 2017, 414 :53-67