An improved CPSO algorithm

摘要

This paper presents an improved particle swarm optimization algorithm (CPSO) in which corrective procedure was introduced. The aim of this corrective procedure is to set new, better velocities for some particles when their present velocities are inefficient. New velocities are the functions of previous and current velocities. The presented algorithm was tested with a set of benchmark functions and analyzed both in terms of their efficiency, premature convergence and the ability to avoid local optima. The results of the tests were compared with those obtained through the standard PSO and IPSO to demonstrate the superiority of CPSO.