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 条
[1]   Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[3]   A LIMITED MEMORY ALGORITHM FOR BOUND CONSTRAINED OPTIMIZATION [J].
BYRD, RH ;
LU, PH ;
NOCEDAL, J ;
ZHU, CY .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (05) :1190-1208
[4]   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
[5]   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
[6]  
COBB HG, 1992, FDN GENETIC ALGORITH, V2
[7]   A novel chaotic particle swarm optimization approach using Henon map and implicit filtering local search for economic load dispatch [J].
Coelho, Leandro dos Santos ;
Mariani, Viviana Cocco .
CHAOS SOLITONS & FRACTALS, 2009, 39 (02) :510-518
[8]   A hybrid simplex search and particle swarm optimization for unconstrained optimization [J].
Fan, Shu-Kai S. ;
Zahara, Erwie .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (02) :527-548
[9]  
Houck C., 1995, GENETIC ALGORITHM FU
[10]   Efficient Population Utilization Strategy for Particle Swarm Optimizer [J].
Hsieh, Sheng-Ta ;
Sun, Tsung-Ying ;
Liu, Chan-Cheng ;
Tsai, Shang-Jeng .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (02) :444-456