Skip Neighborhood Hybrid Particle Swarm Optimization Algorithm

Abstract:

Traditional Particle Swarm Optimization (PSO) uses single search strategy and is difficult to balance the global search with local search, and easy to fall into local optimization, a new algorithm which integrates global search with local neighborhood search is presented. The algorithm performs the global search in parallel with the local search by the feedback of the global optimal particle and the information interaction of local neighborhood. Meanwhile, with a new neighborhood topology to control the search space, the algorithm can avoid the local optimization successfully. Tested by four classical functions, the new algorithm performs well on optimization speed, accuracy and success rate.

• Periodical: Advanced Materials Research (Volumes 311-313)
• Pages: 1863-1868
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.311-313.1863
• Online since: August 2011
• Authors: Jian Jun Li, Bin Yu, Wu Ping Chen
• Keywords: Algorithm Convergence, Neighborhood Topology, Particle Swarm Optimization Algorithm (PSO), Uniform Design

References

[1] Kennedy J, Eberhart RC: Particle swarm optimization. Proc. of the Int'l Conf. on Neural Networks. Perth: IEEE Press(1995).P.1942.

[2] Tang Xian-lun. The Theory and Application of Particle Swarm Optimization Algorithm Based on Chaos. Doctor thesis, Chongqing University (2007).

[3] Marco Mussetta, Stefano Selleri, Paola Pirinoli: Improved Particle Swarm Optimization algorithms for electromagnetic optimization. Journal of Intelligent and Fuzzy Systems (2008), P.75.

[4] M. Ayvaz, K. Tamer, H. Ali, H. Ceylan, G. Gurarslan: Hybridizing the harmony search algorithm with a preadsheet 'Solver' for solving continuous engineering optimization problems. Engineering Optimization (2009), P.1119.

DOI: 10.1080/03052150902926835

[5] Alec Banks, Jonathan Vincent, Chukwudi Anyakoha: A review of particle swarm optimization, Part I: background and development. Natural Computation: An International Journal (2008), P.467.

DOI: 10.1007/s11047-007-9049-5

[6] Lv Zhen-su, Hou Zhi-rong: Particle Swarm Optimization with Adaptive Mutation. Chinese Journal of Electronics (2004), P.416. (In Chinese)

[7] Ni Qing-Jian,Zhang Zhi-Zheng: Dynamic Probabilistic Particle Swarm Optimization Based On Varying Multi-Cluster Structure. Journal of Software (2009), P.339. (In Chinese)

DOI: 10.3724/sp.j.1001.2009.00339

[8] Yang Xue-rong, Liang Jia-hong: Multi-neighborhood improved particle swarm optimization algorithm. Systems Engineering and Electronics (2010), P.2453. (In Chinese)

[9] Shi Y, Eberhart R C: Empirical study of particle swarm optimization. Proceedings of the IEEE Congress on Evolutionary Computation Piscataway, NJ: IEEE Press (1999), P.1945.

[10] Fang Kai-tai, Ma Chang-xing: Orthogonal and Uniform Experimental Design. Science Press (2001). (In Chinese)

[11] J. Kennedy, R. Mendes: Neighborhood topologies in fully informed and best-of-neighborhood particle swarms. IEEE SMC Workshop on Soft Computing in Industrial Applications (2003), P.45.

DOI: 10.1109/smcia.2003.1231342