Abstract
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. In the new algorithm, each particle is attracted towards the best previous positions visited by its neighbors, in addition to the other aspects of particle dynamics in PSO. This is accomplished by using the ratio of the relative fitness and the distance of other particles to determine the direction in which each component of the particle position needs to be changed. The resulting algorithm, known as Fitness-Distance-Ratio based PSO (FDR-PSO), is shown to perform significantly better than the original PSO algorithm and several of its variants, on many different benchmark optimization problems. Avoiding premature convergence allows FDR-PSO to continue search for global optima in difficult multimodal optimization problems, reaching better solutions than PSO and several of its variants.
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
Kennedy, J. and Eberhart, R., “Particle Swarm Optimization”, IEEE International Conference on Neural Networks, 1995, Perth, Australia.
Eberhart, R. and Kennedy, J., “A New Optimizer Using Particles Swarm Theory”, Sixth International Symposium on Micro Machine and Human Science, 1995, Nayoga, Japan.
Eberhart, R. and Shi, Y., “Comparison between Genetic Algorithms and Particle Swarm Optimization”, The 7th Annual Conference on Evolutionary Programming, 1998, San Diego, USA.
Shi, Y. H., Eberhart, R. C., “A Modified Particle Swarm Optimizer”, IEEE International Conference on Evolutionary Computation, 1998, Anchorage, Alaska.
Kennedy J., “Small Worlds and MegaMinds: Effects of Neighbourhood Topology on Particle Swarm Performance”, Proceedings of the 1999 Congress of Evolutionary Computation, vol. 3, 1931–1938. IEEE Press.
Lovbjerg, M., Rasmussen, T. K., Krink, T., “ Hybrid Particle Swarm Optimiser with Breeding and Subpopulations”, Proceedings of Third Genetic Evolutionary Computation, (GECCO 2001).
Carlisle, A. and Dozier, G.. “Adapting Particle Swarm Optimization to Dynamic Environments”, Proceedings of International Conference on Artificial Intelligence, Las Vegas, Nevada, USA, pp. 429–434, 2000.
Kennedy, J., Eberhart, R. C., and Shi, Y. H.,_Swarm Intelligence, Morgan Kaufmann Publishers, 2001.
GEATbx: Genetic and Evolutionary Algorithm Toolbox for MATLAB, Hartmut Pohlheim, http://www.systemtechnik.tu-ilmenau.de/~pohlheim/GA_Toolbox/index.html.
E. Ozcan and C. K. Mohan, “Particle Swarm Optimzation: Surfing the Waves”, Proceedings of Congress on Evolutionary Computation (CEC’99), Washington D. C., July 1999, pp 1939–1944.
Particle Swarm Optimization Code, Yuhui Shi, www.engr.iupui.edu/~shi
van den Bergh, F., Engelbrecht, A. P., “Cooperative Learning in Neural Networks using Particle Swarm Optimization”, South African Computer Journal, pp. 84–90, Nov. 2000.
van den Bergh, F., Engelbrecht, A. P., “Effects of Swarm Size on Cooperative Particle Swarm Optimisers”, Genetic and Evolutionary Computation Conference, San Francisco, USA, 2001.
Lovbjerg, M., Krink, T., “Extending Particle Swarm Optimisers with Self-Organized Criticality”, Proceedings of Fourth Congress on Evolutionary Computation, 2002, vol. 2, pp. 1588–1593.
Xiao-Feng Xie, Wen-Jun Zhang, Zhi-Lian Yang, “Hybrid Particle Swarm Optimizer with Mass Extinction”, International Conf. on Communication, Circuits and Systems (ICCCAS), Chengdu, China, 2002.
Xiao-Feng Xie, Wen-Jun Zhang, Zhi-Lian Yang, “A Dissipative Particle Swarm Optimization”, IEEE Congress on Evolutionary Computation, Honolulu, Hawaii, USA, 2002.
Jacques Riget, Jakob S. Vesterstorm, “A Diversity-Guided Particle Swarm Optimizer-The ARPSO”, EVALife Technical Report no. 2002-02.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Veeramachaneni, K., Peram, T., Mohan, C., Osadciw, L.A. (2003). Optimization Using Particle Swarms with Near Neighbor Interactions. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40602-0
Online ISBN: 978-3-540-45105-1
eBook Packages: Springer Book Archive