Abstract
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.
Funder
National Natural Science Foundation of China
Key Program of Scientific and Technological Innovation of Shandong Province
Key Research and Development Program of Shandong Province
Independent Innovation Foundation of Shandong University
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献