Author(s)

Mengshan Li, Liang Liu, Genqin Sun, Keming Su, Huaijin Zhang, Bingsheng Chen, Yan Wu

Gannan Normal University, Ganzhou, China.

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Particle Swarm, Algorithm, Chaotic Sequences, Self-Adaptive Strategy, Multi-Objective Optimization

Li, M. , Liu, L. , Sun, G. , Su, K. , Zhang, H. , Chen, B. and Wu, Y. (2017) Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy. Journal of Computer and Communications, 5, 13-23. doi: 10.4236/jcc.2017.512002.