A heuristic particle swarm optimization

Authors:
Hoang Thanh Lam;Popova Nina Nicolaevna;Nguyen Thoi Minh Quan
Affiliations:
Lomonosov Moscow State University, Moscow, Russian Fed.;Lomonosov Moscow State University, Moscow, Russian Fed.;Lomonosov Moscow State University, Moscow, Russian Fed.
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 1
Cited 1

The gregarious particle swarm optimizer (G-PSO)

Proceedings of the 8th annual conference on Genetic and evolutionary computation

A review on particle swarm optimization algorithms and their applications to data clustering

Artificial Intelligence Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic version of the particle swarm optimization (PSO) is introduced in this paper. In this new method called "The heuristic particle swarm optimization(HPSO)", we use heuristics to choose the next particle to update its velocity and position. By using heuristics , the convergence rate to local minimum is faster. To avoid premature convergence of the swarm, the particles are re-initialized with random velocity when moving too close to the global best position. The combination of heuristics and re-initialization mechanism make HPSO outperform the basic PSO and recent versions of PSO.