A Novel Particle Swarm Optimization Algorithm for Global Optimization

Abstract EN

Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed.

In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire population in the current iteration is considered.

Meanwhile, to avoid premature, an abandoned mechanism is used.

Furthermore, for improving the global convergence speed of our algorithm, a chaotic search is adopted in the best solution of the current iteration.

To verify the performance of our algorithm, standard test functions have been employed.

The experimental results show that the algorithm is much more robust and efficient than some existing Particle Swarm Optimization algorithms.