A New Chaotic Starling Particle Swarm Optimization Algorithm for Clustering Problems

الملخص EN

A new method using collective responses of starling birds is developed to enhance the global search performance of standard particle swarm optimization (PSO).

The method is named chaotic starling particle swarm optimization (CSPSO).

In CSPSO, the inertia weight is adjusted using a nonlinear decreasing approach and the acceleration coefficients are adjusted using a chaotic logistic mapping strategy to avoid prematurity of the search process.

A dynamic disturbance term (DDT) is used in velocity updating to enhance convergence of the algorithm.

A local search method inspired by the behavior of starling birds utilizing the information of the nearest neighbors is used to determine a new collective position and a new collective velocity for selected particles.

Two particle selection methods, Euclidean distance and fitness function, are adopted to ensure the overall convergence of the search process.

Experimental results on benchmark function optimization and classic clustering problems verified the effectiveness of this proposed CSPSO algorithm.