Crowd avoidance strategy in particle swarm algorithm

Authors:
Guimin Chen;Qi Han;Jianyuan Jia;Wenchao Song
Affiliations:
School of Electronical and Mechanical Engineering, Xidian University, Xi’an, China;School of Electronical and Mechanical Engineering, Xidian University, Xi’an, China;School of Electronical and Mechanical Engineering, Xidian University, Xi’an, China;School of Electronical and Mechanical Engineering, Xidian University, Xi’an, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 2
Cited 0

Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

To improve the linearly varying inertia weigh particle swarm optimization method (LPSO), a new concept of Crowd Avoidance is introduced in this paper. In this newly developed LPSO (CA-LPSO), particles can avoid entering into a crowded space while collaborate with other particles searching for optimum. Four well-known benchmarks were used to evaluate the performance of CA-LPSO in comparison with LPSO. The simulation results show that, although CA-LPSO falls behind LPSO when optimizing simple unimodal problems, it is more effective than LPSO for most complex functions. The crowd avoidance strategy enables the particles to explore more areas in the search space and thus decreases the chance of premature convergence.