Crossed particle swarm optimization algorithm

Authors:
Teng-Bo Chen;Yin-Li Dong;Yong-Chang Jiao;Fu-Shun Zhang
Affiliations:
National Laboratory of Antennas and Microwave Technology, Xidian University, Xi'an, Shanxi, P.R. China;National Laboratory of Antennas and Microwave Technology, Xidian University, Xi'an, Shanxi, P.R. China;National Laboratory of Antennas and Microwave Technology, Xidian University, Xi'an, Shanxi, P.R. China;National Laboratory of Antennas and Microwave Technology, Xidian University, Xi'an, Shanxi, P.R. China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Year:
2006

Citing 2
Cited 1

The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation
On the computation of all global minimizers through particle swarm optimization

IEEE Transactions on Evolutionary Computation

A hybrid genetically-bacterial foraging algorithm converged by particle swarm optimisation for global optimisation

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The particle swarm optimization (PSO) algorithm presents a new way for finding optimal solutions of complex optimization problems. In this paper a modified particle swarm optimization algorithm is presented. We modify the PSO algorithm in some aspects. Firstly, a contractive factor is introduced to the position update equation, and the particles are limited in search region. A new strategy for updating velocity is then adopted, in which the velocity is weakened linearly. Thirdly, using an idea of intersecting two modified PSO algorithms. Finally, adding an item of integral control in the modified algorithm can improve its global search ability. Based on these strategies, we proposed a new PSO algorithm named crossed PSO algorithm. Simulation results show that the crossed PSO is superior to the original PSO algorithm and can get overall promising performance over a wide range of problems.