An Improved Particle Swarm Optimization Algorithm

被引:0
作者
Wang, Fangxiu [1 ]
Zhou, Kong [1 ]
机构
[1] Wuhan Polytech Univ, Sch Math & Comp Sci, Wuhan 430023, Peoples R China
来源
2012 INTERNATIONAL CONFERENCE ON INTELLIGENCE SCIENCE AND INFORMATION ENGINEERING | 2012年 / 20卷
关键词
PSO; Smooth weight; improved particle swarm; Optimization algorithm;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The basic and improved algorithms of PSO focus on how to effectively search the optimal solution in the solution space using one of the particle swarm. However, the particles are always chasing the global optimal point and such points currently found on their way of search, rapidly leading their speed down to zero and hence being restrained in the local minimum. Consequently, the convergence or early maturity of particles exists. The improved PSO is based on the enlightenment of BP neural network while the improvement is similar to smooth the weight through low-pass filter. The test of classical functions show that the PSO provides a promotion in the convergence precision and calculation velocity to a certain extent.
引用
收藏
页码:156 / 158
页数:3
相关论文
共 5 条
[1]  
Colorni A., 1991, Distributed optimization by ant colonies, V142, P134
[2]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[3]  
Venter G., 2002, 43rd AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, P1
[4]  
Xiang Tao, 2007 IEEE C EV COMP, P2241
[5]  
Yu Huan-Jun, 2005, INFORM CONTR, V8, P500