Clubs-based Particle Swarm Optimization

by   Wesam Elshamy, et al.

This paper introduces a new dynamic neighborhood network for particle swarm optimization. In the proposed Clubs-based Particle Swarm Optimization (C-PSO) algorithm, each particle initially joins a default number of what we call 'clubs'. Each particle is affected by its own experience and the experience of the best performing member of the clubs it is a member of. Clubs membership is dynamic, where the worst performing particles socialize more by joining more clubs to learn from other particles and the best performing particles are made to socialize less by leaving clubs to reduce their strong influence on other members. Particles return gradually to default membership level when they stop showing extreme performance. Inertia weights of swarm members are made random within a predefined range. This proposed dynamic neighborhood algorithm is compared with other two algorithms having static neighborhood topologies on a set of classic benchmark problems. The results showed superior performance for C-PSO regarding escaping local optima and convergence speed.



There are no comments yet.


page 6


Dynamic Swarm Dispersion in Particle Swarm Optimization for Mining Unsearched Area in Solution Space (DSDPSO)

Premature convergence in particle swarm optimization (PSO) algorithm usu...

Random Drift Particle Swarm Optimization

The random drift particle swarm optimization (RDPSO) algorithm, inspired...

On how percolation threshold affects PSO performance

Statistical evidence of the influence of neighborhood topology on the pe...

A Bi-population Particle Swarm Optimizer for Learning Automata based Slow Intelligent System

Particle Swarm Optimization (PSO) is an Evolutionary Algorithm (EA) that...

Particle Swarm Optimization: A survey of historical and recent developments with hybridization perspectives

Particle Swarm Optimization (PSO) is a metaheuristic global optimization...

A Diverse Clustering Particle Swarm Optimizer for Dynamic Environment: To Locate and Track Multiple Optima

In real life, mostly problems are dynamic. Many algorithms have been pro...

Multi-swarm PSO algorithm for the Quadratic Assignment Problem: a massive parallel implementation on the OpenCL platform

This paper presents a multi-swarm PSO algorithm for the Quadratic Assign...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.