Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference on Neural Network, pp. 1942–1948. IEEE Press, New York (1995)
Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: 6th International Symposium on Micro Machine and Human Science, pp. 39–43. IEEE Press, New York (1995)
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)
Liu, B., Wang, L., Jin, Y.-H.: Improved Particle Swarm Optimization Combined with Chaos. Chaos, Solitons and Fractals 25, 1261–1271 (2005)
Shelokar, P.S., Siarry, P., Jayaraman, V.K.: Particle Swarm and Ant Colony Algorithms Hybridized for Improved Continuous Optimization. Applied Mathematics and Computation 188, 129–142 (2005)
Kennedy, J.: Bare Bones Particle Swarms. In: Swarm Intelligence Symposium, pp. 80–87. IEEE Press, New York (2003)
Lu, Q., Qiu, X., Liu, S.: A Discrete Particle Swarm Optimization Algorithm with Fully Communicated Information. In: ACM/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 393–400. ACM Press, New York (2009)
Lu, Q., Liu, S., Qiu, X.: Design and Realization of Particle Swarm Optimization Based on Pheromone Mechanism. Acta Automatica Sinica 35, 1410–1419 (2009)
Krohiling, R.A.: Gaussian Particle Swarm with Jumps. In: IEEE Congress on Evolutionary Computation, pp. 1226–1231. IEEE Press, New York (2005)
Krohiling, R.A., Mendel, E.: Bare Bones Particle Swarm Optimization with Gaussian or Cauchy jumps. In: IEEE Congress on Evolutionary Computation, pp. 3285–3291. IEEE Press, New York (2009)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, Q., Qiu, X. (2010). An Improved Probability Particle Swarm Optimization Algorithm. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13495-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-13495-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13494-4
Online ISBN: 978-3-642-13495-1
eBook Packages: Computer ScienceComputer Science (R0)