Study on the Local Search Ability of Particle Swarm Optimization
Particle swarm optimization (PSO) has been shown to perform well on many optimization problems. However, the PSO algorithm often can not find the global optimum, even for unimodal functions. It is necessary to study the local search ability of PSO. The interval compression method and the probabilistic characteristic of the searching interval of particles are used to analyze the local search ability of PSO in this paper. The conclusion can be obtained that the local search ability of a particle is poor when the component of the global best position lies in between the component of the individual best position and the component of the current position of the particle. In order to improve the local search ability of PSO, a new learning strategy is presented to enhance the probability of exploitation of the global best position. The experimental results show that the modified PSO with the new learning strategy can improve solution accuracy.
KeywordsParticle swarm optimization local search interval compression
Unable to display preview. Download preview PDF.
- 1.Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceeding of International Conference on Neural Networks, pp. 1942–1948. IEEE Press, Perth (1995)Google Scholar
- 2.Shi, Y.H., Eberhart, R.C.: A Modified Particle Swarm Optimizer. In: Proceeding of IEEE Congress on evolutionary Computation, pp. 69–73. IEEE Press, Piscataway (1998)Google Scholar
- 4.Kennedy, J.: Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceeding of IEEE Congress on evolutionary Computation, pp. 1931–1938. IEEE Press, Washington (1999)Google Scholar