Abstract
Several techniques have been employed to adapt particle swarm optimization to find multiple optimal solutions in a problem domain. Niching algorithms have to identify good candidate solutions among a population of particles in order to split the space into regions where an optimal solution may be found. Subsequently the swarm must be optimized so that particles contained inside the niches will converge on multiple optimal solutions.
This paper presents an improved vector-based particle swarm optimizer where subswarms contained in niches are optimized in parallel.
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. (1995) Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks IV: 1942–1948.
Brits, R. (2002) Niching strategies for particle swarm optimization. Master’s thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa.
Schoeman, I.L., Engelbrecht, A.P. (2004) Using vector operations to identify niches for particle swarm optimization. Proceedings of the conference on cybernetics and intelligent systems.
Reynolds, C.W. (1987) Flocks, herds and schools: a distributed behavioural mode, Computer Graphics 21(4):25–34.
Shi, Y., Eberhart, R.C. (1998) A modified particle swarm optimizer. Proceedings of the IEEE Congress on Evolutionary Computation: 69–73.
Kennedy, J. (1999) Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. Proceedings of the IEEE Congress on Evolutionary Computation:1931–1938.
Parsopoulos, K.E., Vrahatis, M.N. (2001) Modification of the particle swarm optimimizer for locating all the global minima. In Kurkova, V., Steele, N.C., Neruda, R., Karny, N. (eds), Artificial Neural Networks and Genetic Algorithms, Springer, pp. 324–327
Parsopoulos, K.E., Plagianakos V.P., Magoulas G.D., Vrahatis, M.N. (2001) Stretching technique for obtaining global minimizers through particle swarm optimization. Proceedings of the Particle Swarm Optimization Workshop: 22–29.
Brits, R., Engelbrecht, A.P., Van den Bergh, F. (2002) A niching particle swarm optimizer. Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning: 692–696.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag/Wien
About this paper
Cite this paper
Schoeman, I.L., Engelbrecht, A.P. (2005). A Parallel Vector-Based Particle Swarm Optimizer. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds) Adaptive and Natural Computing Algorithms. Springer, Vienna. https://doi.org/10.1007/3-211-27389-1_64
Download citation
DOI: https://doi.org/10.1007/3-211-27389-1_64
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-24934-5
Online ISBN: 978-3-211-27389-0
eBook Packages: Computer ScienceComputer Science (R0)