Toward an Ideal Particle Swarm Optimizer for Multidimensional Functions

The Particle Swarm Optimization (PSO) method is a global optimization technique based on the gradual evolution of a population of solutions called particles. The method evolves the particles based on both the best position of each of them in the past and the best position of the whole. Due to its simplicity, the method has found application in many scientific areas, and for this reason, during the last few years, many modifications have been presented. This paper introduces three modifications to the method that aim to reduce the required number of function calls while maintaining the accuracy of the method in locating the global minimum. These modifications affect important components of the method, such as how fast the particles change or even how the method is terminated. The above modifications were tested on a number of known universal optimization problems from the relevant literature, and the results were compared with similar techniques.

Automated summary

This paper introduces three modifications to the Particle Swarm Optimization (PSO) method, aiming to reduce the required number of function calls while maintaining the accuracy in finding the global minimum. These modifications affect important components of the method, such as the speed of particle changes and the termination criteria.