Abstract
Each particle in a swarm maintains its current position and its personal best position. It is useful to think of these personal best positions as a population of attractors – updates to current positions are based on attractions to these personal best positions. If the population of attractors has high diversity, it will encourage a broad exploration of the search space with particles being drawn in many different directions. However, the population of attractors can converge quickly – attractors can draw other particles towards them, and these particles can update their own personal bests to be near the first attractor. This convergence of attractors can be reduced by having a particle update the attractor it has approached rather than its own attractor/personal best. This simple change to the update procedure in particle swarm optimization incurs minimal computational cost, and it can lead to large performance improvements in multi-modal search spaces.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bratton, D., Kennedy, J.: Defining a Standard for Particle Swarm Optimization. In: Proceedings of the 2007 IEEE Swarm Intelligence Symposium, pp. 120–127. IEEE Press, Los Alamitos (2007)
Brits, R., Engelbrecht, A.P., Van den Bergh, F.: A Niching Particle Swarm Optimizer. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, pp. 692–696. IEEE Press, Los Alamitos (2002)
Chen, S.: Locust Swarms – A New Multi-Optima Search Technique. In: Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pp. 1745–1752. IEEE Press, Los Alamitos (2009)
Chen, S., Montgomery, J.: Selection Strategies for Initial Positions and Initial Velocities in Multi-optima Particle Swarms. In: Proceedings of the 2011 Genetic and Evolutionary Computation Conference, pp. 53–60. ACM, New York (2011)
Chen, S., Noa Vargas, Y.: Improving the Performance of Particle Swarms through Dimension Reductions – A Case Study with Locust Swarms. In: Proceedings of the 2010 IEEE Congress on Evolutionary Computation, pp. 2950–2957. IEEE Press, Los Alamitos (2010)
De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems, PhD thesis. Dept. of Computer and Communication Sciences, University of Michigan (1975)
El-Abd, M., Kamel, M.S.: Black-Box Optimization Benchmarking for Noiseless Function Testbed using Particle Swarm Optimization. In: Proceedings of the 2009 Genetic and Evolutionary Computation Conference, pp. 2269–2273. ACM, New York (2009)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)
Hansen, N., Finck, S., Ros, R., Auger, A.: Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions. INRIA Technical Report RR-6829 (2009)
Hendtlass, T.: WoSP: A Multi-Optima Particle Swarm Algorithm. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pp. 727–734. IEEE Press, Los Alamitos (2005)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE Press, Los Alamitos (1995)
Liang, J.J., Suganthan, P.N.: Dynamic Multi-Swarm Particle Swarm Optimizer. In: Proceedings of the 2005 IEEE Swarm Intelligence Symposium, pp. 124–129. IEEE Press, Los Alamitos (2005)
Thomsen, R.: Multimodal Optimization using Crowding-based Differential Evolution. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, pp. 1382–1389. IEEE Press, Los Alamitos (2004)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, S., Montgomery, J. (2011). A Simple Strategy to Maintain Diversity and Reduce Crowding in Particle Swarm Optimization. In: Wang, D., Reynolds, M. (eds) AI 2011: Advances in Artificial Intelligence. AI 2011. Lecture Notes in Computer Science(), vol 7106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25832-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-25832-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25831-2
Online ISBN: 978-3-642-25832-9
eBook Packages: Computer ScienceComputer Science (R0)