The particle swarm optimizer (PSO) is a stochastic, population-based optimization technique that can be applied to a wide range of problems, including neural network training. This paper presents a variation on the traditional PSO algorithm, called the cooperative particle swarm optimizer, or CPSO, employing cooperative behavior to significantly improve the performance of the original algorithm. This is achieved by using multiple swarms to optimize different components of the solution vector cooperatively. Application of the new PSO algorithm on several benchmark optimization problems shows a marked improvement in performance over the traditional PSO.

Data clustering is the process of identifying natural groupings or clusters within multidimensional data based on some similarity measure. Clustering is a fundamental process in many different disciplines. Hence, researchers from different fields are

An important factor contributing to the success of particle swarm optimization (PSO) is the balance between exploration and exploitation of the swarm. Exploration is typically preferred at the initial stages of the search but is required to gradually give way to exploitation of promising solutions as the search progresses. The diversity of a particle swarm optimization algorithm can be defined, simply, as the degree of dispersion of the particles in the swarm. This dispersion could be defined around some center-point or not. It could also be defined based on the positions of the particles or on their velocities. This paper takes a look at some of the different definitions of swarm diversity with the intention of determining their usefulness in quantifying swarm exploration/exploitation. This work is intended to lay the foundations for the development of a suitable means to quantify the rate of change from exploration to exploitation of a PSO, i.e. the rate of change of diversity.