A Hybrid PSO-BFGS Strategy for Global Optimization of Multimodal Functions

被引:68
作者
Li, Shutao [1 ]
Tan, Mingkui [1 ]
Tsang, Ivor W. [2 ]
Kwok, James Tin-Yau [3 ]
机构
[1] Hunan Univ, Coll Elect & Informat Engn, Changsha 410082, Hunan, Peoples R China
[2] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
[3] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS | 2011年 / 41卷 / 04期
基金
中国国家自然科学基金;
关键词
Local diversity; particle swarm optimizer (PSO); reconstruction technique; territory; PARTICLE SWARM OPTIMIZATION; ALGORITHM; MUTATION;
D O I
10.1109/TSMCB.2010.2103055
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Particle swarm optimizer (PSO) is a powerful optimization algorithm that has been applied to a variety of problems. It can, however, suffer from premature convergence and slow convergence rate. Motivated by these two problems, a hybrid global optimization strategy combining PSOs with a modified Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is presented in this paper. The modified BFGS method is integrated into the context of the PSOs to improve the particles' local search ability. In addition, in conjunction with the territory technique, a reposition technique to maintain the diversity of particles is proposed to improve the global search ability of PSOs. One advantage of the hybrid strategy is that it can effectively find multiple local solutions or global solutions to the multimodal functions in a box-constrained space. Based on these local solutions, a reconstruction technique can be adopted to further estimate better solutions. The proposed method is compared with several recently developed optimization algorithms on a set of 20 standard benchmark problems. Experimental results demonstrate that the proposed approach can obtain high-quality solutions on multimodal function optimization problems.
引用
收藏
页码:1003 / 1014
页数:12
相关论文
共 32 条
[21]   Classification of adaptive memetic algorithms: a comparative study [J].
Ong, YS ;
Lim, MH ;
Zhu, N ;
Wong, KW .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2006, 36 (01) :141-152
[22]   On the computation of all global minimizers through particle swarm optimization [J].
Parsopoulos, KE ;
Vrahatis, MN .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :211-224
[23]   Multimodal function optimization based on particle swarm optimization [J].
Seo, JH ;
Im, CH ;
Heo, CG ;
Kim, JK ;
Jung, HK ;
Lee, CG .
IEEE TRANSACTIONS ON MAGNETICS, 2006, 42 (04) :1095-1098
[24]   A modified particle swarm optimizer [J].
Shi, YH ;
Eberhart, R .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :69-73
[25]   Discovering Unique, Low-Energy Pure Water Isomers: Memetic Exploration, Optimization, and Landscape Analysis [J].
Soh, Harold ;
Ong, Yew-Soon ;
Quoc Chinh Nguyen ;
Quang Huy Nguyen ;
Habibullah, Mohamed Salahuddin ;
Hung, Terence ;
Kuo, Jer-Lai .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (03) :419-437
[26]  
SUGANTHAN PN, 2005, 2005005 NAN TECHN U
[27]   A cooperative approach to particle swarm optimization [J].
van den Bergh, F ;
Engelbrecht, AP .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :225-239
[28]   Dynamic Multiple Swarms in Multiobjective Particle Swarm Optimization [J].
Yen, Gary G. ;
Leong, Wen Fung .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2009, 39 (04) :890-911
[29]   Adaptive Particle Swarm Optimization [J].
Zhan, Zhi-Hui ;
Zhang, Jun ;
Li, Yun ;
Chung, Henry Shu-Hung .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (06) :1362-1381
[30]   An evolutionary algorithm with guided mutation for the maximum clique problem [J].
Zhang, QF ;
Sun, JY ;
Tsang, E .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (02) :192-200