On Some Properties of the lbest Topology in Particle Swarm Optimization

Authors:
Sayan Ghosh;Debarati Kundu;Kaushik Suresh;Swagatam Das;Ajith Abraham;Bijaya K. Panigrahi;Václav Snasel
Affiliations:
-;-;-;-;-;-;-
Venue:
HIS '09 Proceedings of the 2009 Ninth International Conference on Hybrid Intelligent Systems - Volume 03
Year:
2009

Citing 0
Cited 2

Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

Information Sciences: an International Journal
Convergence and boundary estimation of the particle dynamics in generalized particle swarm optimization

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on PSO is mostly based on the gbest (global best) particle topology, which usually is susceptible to false or premature convergence over multi-modal fitness landscapes. The present standard PSO (SPSO 2007) uses an lbest (local best) topology where a particle is stochastically attracted not towards the best position found in the entire swarm, but towards the best position found by any particle in its topological neighborhood. This paper presents a first step towards a probabilistic analysis of the lbest PSO with variable random neighborhood topology by addressing issues like inter-particle interaction and probabilities of selection based on particle ranks.