Using Fitness Landscape to Improve the Performance of Particle Swarm Optimization

被引:17
作者
Cui, Zhihua [1 ,2 ]
Cai, Xingjuan [1 ]
Shi, Zhongzhi [2 ]
机构
[1] Taiyuan Univ Sci & Technol, Complex Syst & Computat Intelligence Lab, Taiyuan 030024, Shanxi, Peoples R China
[2] Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Beijing 100190, Peoples R China
基金
中国国家自然科学基金;
关键词
Particle Swarm Optimization; Fitness Landscape Modification Strategy; Convex Weighted Combination Strategy; Stochastic Expected Model; ALGORITHM; PSO;
D O I
10.1166/jctn.2012.2020
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Particle swarm optimization (PSO) is a swarm intelligent stochastic optimization algorithm inspired by social behavior. Due to the fast convergent speed, it gets easily trapped into a local optimum when solving high-dimensional multi-modal numerical optimization problems. To avoid this phenomenon, a new strategy fitness landscape modification is introduced to reduce the number of local optima. In this new strategy, the fitness values of some particles are estimated, while others are evaluated with the truly objective functions. To provide a precise estimation, the estimated fitnesses are weighted combination where each weight of one parent individual is proportional to the distance among estimated particle and itself. With this manner, many potential local optima which may guide a wrong searching direction departing from global optimum are removed. To testify the performance of this new strategy, several famous multi-modal benchmarks are chosen, and simulation results show fitness landscape modification is an effective strategy which improves the performance significantly when compared with the standard PSO. Furthermore, this new modification is used to solve stochastic expected model, the performance increases 4.29%similar to 5.37% when compared with the known best results.
引用
收藏
页码:258 / 265
页数:8
相关论文
共 42 条
[1]  
Abraham A, 2009, STUD COMPUT INTELL, V203, P291
[2]   Particle swarm optimisation based Diophantine equation solver [J].
Abraham, Siby ;
Sanyal, Sugata ;
Sanglikar, Mukund .
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2010, 2 (02) :100-114
[3]   On Model-Based Evolutionary Computation [J].
L. Bull .
Soft Computing, 1999, 3 (2) :76-82
[4]   Predicted modified PSO with time-varying accelerator coefficients [J].
Cai, Xingjuan ;
Cui, Yan ;
Tan, Ying .
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2009, 1 (1-2) :50-60
[5]  
Cui ZH, 2004, LECT NOTES ARTIF INT, V3066, P762
[6]   Particle swarm optimization with FUSS and RWS for high dimensional functions [J].
Cui, Zhihua ;
Cai, Xingjuan ;
Zeng, Jianchao ;
Sun, Guoji .
APPLIED MATHEMATICS AND COMPUTATION, 2008, 205 (01) :98-108
[7]  
Cui ZH, 2006, INT J INNOV COMPUT I, V2, P1365
[8]  
Eberhart R., 1995, MHS 95, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]
[9]   An Adaptive Particle Swarm Optimizer Using Balanced Explorative and Exploitative Behaviors [J].
Ghosh, Sayan ;
Kundu, Debarati ;
Suresh, Kaushik ;
Das, Swagatam ;
Abraham, Ajith .
PROCEEDINGS OF THE 10TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, 2009, :543-+
[10]  
He Ran, 2005, Journal of Software, V16, P2036, DOI 10.1360/jos162036