Improved Chaotic Particle Swarm Optimization Algorithm with More Symmetric Distribution for Numerical Function Optimization

As a global-optimized and naturally inspired algorithm, particle swarm optimization (PSO) is characterized by its high quality and easy application in practical optimization problems. However, PSO has some obvious drawbacks, such as early convergence and slow convergence speed. Therefore, we introduced some appropriate improvements to PSO and proposed a novel chaotic PSO variant with arctangent acceleration coefficient (CPSO-AT). A total of 10 numerical optimization functions were employed to test the performance of the proposed CPSO-AT algorithm. Extensive contrast experiments were conducted to verify the effectiveness of the proposed methodology. The experimental results showed that the proposed CPSO-AT algorithm converges quickly and has better stability in numerical optimization problems compared with other PSO variants and other kinds of well-known optimal algorithms.