An Improved Probability Particle Swarm Optimization Algorithm
This paper deals with the problem of unconstrained optimization. An improved probability particle swarm optimization algorithm is proposed. Firstly, two normal distributions are used to describe the distributions of particle positions, respectively. One is the normal distribution with the global best position as mean value and the difference between the current fitness and the global best fitness as standard deviation while another is the distribution with the previous best position as mean value and the difference between the current fitness and the previous best fitness as standard deviation. Secondly, a disturbance on the mean values is introduced into the proposed algorithm. Thirdly, the final position of particles is determined by employing a linear weighted method to cope with the sampled information from the two normal distributions. Finally, benchmark functions are used to illustrate the effectiveness of the proposed algorithm.
KeywordsNormal distribution probability particle swarm optimization evolutionary computation
Unable to display preview. Download preview PDF.
- 1.Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference on Neural Network, pp. 1942–1948. IEEE Press, New York (1995)Google Scholar
- 3.Lu, Q., Chen, R.-Q., Yu, J.-S.: Quantum Continuous Particle Swarm Optimization Algorithm and Its Application. System Engineering-Theory and Practice 28, 122–130 (2008)Google Scholar
- 6.Kennedy, J.: Bare Bones Particle Swarms. In: Swarm Intelligence Symposium, pp. 80–87. IEEE Press, New York (2003)Google Scholar
- 11.Secrest, B.R., Lamont, G.B.: Visualizing Particle Swarm Optimization-Gaussian Particle Swarm Optimization. In: Swarm Intelligence Symposium, pp. 198–204. IEEE Press, New York (2003)Google Scholar