Improved Particle Swarm Optimization Based on the Geometric Analysis of Single Particle

Abstract:

To enhance the ability of the standard Particle Swarm Optimization (PSO) on solving the complex nonlinear problems, an improved algorithm with independent inertia weight for each particle was proposed in this paper. Firstly, a single particle of the particle swarm was studied. The law of the instantaneous movement of single particle at each iteration was analyzed in a novel geometric view. Two importance conclusions were drawn: 1) The introduction of the two random numbers makes the particle search in a broad parallelogram area, while the product of the inertia weight and the particles present speed is the parallel shift of the aforementioned parallelogram area; 2) The search ability will be greatly reduced as soon as a particle becomes the Global Optimal Particle (GOP). Then, on the ground of the significant conclusions, the improvement plan of the standard PSO was put forward. Experiments show that the proposed algorithm has obvious superiority on the convergence ratio, the convergence speed and the convergence stability.

• Periodical: Applied Mechanics and Materials (Volumes 543-547)
• Pages: 1832-1839
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.543-547.1832
• Online since: March 2014
• Authors: Yong Cai Ao*, Yi Bing Shi, Wei Zhang, Yan Jun Li
• Keywords: Geometric Analysis, Global Optimal Particle, Independent Inertia Weight, Normal Particle, PSO

References

[1] Kennedy, J., Eberhart R. Particle swarm optimization[C]. Proceedings of IEEE International Conference on Neural Networks, 1995: 1942-(1948).

[2] Shi, Y., Eberhart R. A modified particle swarm optimizer[C]. Proceedings of IEEE Congress on Evolutionary Computation(CEC 1998). Piscataway, 1998: 69-73.

DOI: 10.1109/icec.1998.699146

[3] Shi, Y., Eberhart R. Parameter selection in particle swarm optimization[J]. Evolutionary Programming VII. Springer Berlin Heidelberg, 1998: 591-600.

DOI: 10.1007/bfb0040810

[4] Liu, Y., Zheng Q., Zhewen S., Jiang L., Center particle swarm optimization[J]. Neurocomputing, 2007. 70(4): 672-679.

[5] Tsai, Hsing-Chih, Yaw-Yauan T., et al. Gravitational particle swarm[J]. Applied Mathematics and Computation, 2013. 219(17): 9106-9117.

DOI: 10.1016/j.amc.2013.03.098

[6] Clerc, M., Kennedy J., The particle swarm-explosion, stability, and convergence in a multidimensional complex space[J]. IEEE Transactions on Evolutionary Computation, 2002. 6(1): 58-73.

DOI: 10.1109/4235.985692

[7] Zhou L., Shi Y., Li Y., et al. Parameter selection, analysis and evaluation of an improved particle swarm optimizer with leadership. Artificial Intelligence Review[J], 2010. 34(4): 343-367.

DOI: 10.1007/s10462-010-9178-6

[8] Liao W., Wang J., Wang J., Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization[J], Advances in Swarm Intelligence , Springer, 2011: 80-85.

DOI: 10.1007/978-3-642-21515-5_10

[9] Shi Y., Eberhart R.C. Fuzzy adaptive particle swarm optimization[C]. IEEE Proceedings of the 2001 Congress on Evolutionary Computation, 2001: 101-106.

DOI: 10.1109/cec.2001.934377

[10] Zhan Z. -H., Zhang J., Li Y., et al. Adaptive particle swarm optimization[J]. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, 2009. 39(6): 1362-1381.

DOI: 10.1109/tsmcb.2009.2015956