A Hybrid Particle Swarm Optimization Algorithm Based on Space Transformation Search and a Modified Velocity Model

Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO often easily falls into local optima because the particles would quickly get closer to the best particle. Under these circumstances, the best particle could hardly be improved. This paper proposes a new hybrid PSO (HPSO) to solve this problem by combining space transformation search (STS) with a new modified velocity model. Experimental studies on 8 benchmark functions demonstrate that the HPSO holds good performance in solving both unimodal and multimodal functions optimization problems.

[1]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[2]  Jing Wang,et al.  Space transformation search: a new evolutionary technique , 2009, GEC '09.

[3]  M.M.A. Salama,et al.  Opposition-Based Differential Evolution , 2008, IEEE Transactions on Evolutionary Computation.

[4]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[5]  Wang Zhi-gang,et al.  A modified particle swarm optimization , 2009 .

[6]  Riccardo Poli,et al.  Genetic and Evolutionary Computation , 2006, Intelligenza Artificiale.

[7]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[8]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[9]  Wang Jiaying,et al.  A modified particle swarm optimization algorithm , 2005 .

[10]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..