An Enhanced Particle Swarm Optimization Method Integrated With Evolutionary Game Theory

This paper describes a novel particle swarm optimizer algorithm. The focus of this study is how to improve the performance of the classical particle swarm optimization approach, i.e., how to enhance its convergence speed and capacity to solve complex problems while reducing the computational load. The proposed approach is based on an improvement of particle swarm optimization using evolutionary game theory. This method maintains the capability of the particle swarm optimizer to diversify the particles' exploration in the solution space. Moreover, the proposed approach provides an important ability to the optimization algorithm, that is, adaptation of the search direction, which improves the quality of the particles based on their experience. The proposed algorithm is tested on a representative set of continuous benchmark optimization problems and compared with some other classical optimization approaches. Based on the test results of each benchmark problem, its performance is analyzed and discussed.