A time varying constrict factor PSO algorithm research

• Published in: Journal of computational methods in sciences and engineering Vol. 18; no. 3; p. 725
• Main Authors: Huang, Gewen, Cai, Yanguang, Cai, Hao
• Format: Journal Article
• Language: English
• Published: London Sage Publications Ltd 01.01.2018
• Subjects: Acceleration; Algorithms; Constrictions; Particle swarm optimization; Searching; Swarm intelligence
• ISSN: 1472-7978; 1875-8983
• DOI: 10.3233/JCM-180824

For the disadvantage of particle swarm optimizer is not skillful at balancing the global and local search, a new algorithm is proposed in this paper, combining the time-varying acceleration coefficients. The new algorithm, based on particle swarm optimizer with constrict factor, employs the double constrict factors. The first constrict factor aims at adjusting the model of global and local search, and the second constrict factor concentrates on further balancing the global and local optima which influence the updates of the entire swarm. By comparing with particle swarm optimizer, particle swarm optimizer with constrict factor and chaos particle swarm optimizer, which evaluated on 8 Benchmark functions, with 3 kinds of tests, the results indicate the new algorithm owns a higher accurate level, and faster convergence velocity. The time varying acceleration coefficients are used, the new algorithm can balance the global and local search better.