Particle swarm optimization with FUSS and RWS for high dimensional functions

被引:34
作者
Cui, Zhihua [1 ,2 ]
Cai, Xingjuan [2 ]
Zeng, Jianchao [2 ]
Sun, Guoji [1 ]
机构
[1] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Peoples R China
[2] Taiyuan Univ Sci & Technol, Div Syst Simulat & Comp Applicat, Taiyuan 030024, Peoples R China
基金
中国国家自然科学基金;
关键词
Particle swarm optimization; Fitness uniform selection strategy; Random walk strategy;
D O I
10.1016/j.amc.2008.05.147
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
High dimensional optimization problems play an important role in many complex engineering area. Though many variants of particle swarm optimization (PSO) have been proposed, however, most of them are tested and compared with dimension no larger than 300. Since numerical problem with high-dimension maintains a large linkage and correlation among different variables, and the number of local optimum increases significantly with different dimensions, this paper proposes a novel variant of PSO aiming to provide a balance between exploration and exploitation capability. Firstly, the fitness uniform selection strategy (FUSS) with a weak selection pressure is incorporated into the standard PSO. Secondly, "random walk strategy" (RWS) with four different form, is designed to further enhance the exploration capability to escaping from a local optimum. Finally, the proposed PSO combined with FUSS and RWS is applied to seven famous high dimensional benchmark with the dimension up to 3000. Simulation results demonstrate good performance of the new method in solving high dimensional multi-modal problems when compared with two other variants of the PSO. (C) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:98 / 108
页数:11
相关论文
共 28 条
[1]   Using selection to improve particle swarm optimization [J].
Angeline, PJ .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :84-89
[2]  
[Anonymous], 2002, Proceedings of 43rd AIAA/ASME/ASCE/AHS/ASC Structure, Structures Dynamics and Materials Conference
[3]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[4]  
Cui ZH, 2004, LECT NOTES ARTIF INT, V3066, P762
[5]  
Cui ZH, 2006, LECT NOTES COMPUT SC, V4115, P145
[6]  
Cui ZH, 2006, INT J INNOV COMPUT I, V2, P1365
[7]  
DELAMAZA M, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P124
[8]  
Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
[9]  
Eberhart R., 1995, MHS 95 P 6 INT S MIC, DOI DOI 10.1109/MHS.1995.494215
[10]  
Eberhart R.C., 1998, P IEEE INT C EV COMP