skip to main content
10.1145/1389095.1389106acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Convergence behavior of the fully informed particle swarm optimization algorithm

Published: 12 July 2008 Publication History

Abstract

The fully informed particle swarm optimization algorithm (FIPS) is very sensitive to changes in the population topology. The velocity update rule used in FIPS considers all the neighbors of a particle to update its velocity instead of just the best one as it is done in most variants. It has been argued that this rule induces a random behavior of the particle swarm when a fully connected topology is used. This argument could explain the often observed poor performance of the algorithm under that circumstance.
In this paper we study experimentally the convergence behavior of the particles in FIPS when using topologies with different levels of connectivity. We show that the particles tend to search a region whose size decreases as the connectivity of the population topology increases. We therefore put forward the idea that spatial convergence, and not a random behavior, is the cause of the poor performance of FIPS with a fully connected topology. The practical implications of this result are explored.

References

[1]
M. Clerc and J. Kennedy. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1):58--73, 2002.
[2]
A. P. Engelbrecht. Fundamentals of Computational Swarm Intelligence. John Wiley & Sons, Chichester, West Sussex, England, 2005.
[3]
B. Gaboune, G. Laporte, and F. Soumis. Expected distances between two uniformly distributed random points in renctangles and rectangluar parallelpipeds. The Journal of the Operational Research Society, 44(5):513--519, 1993.
[4]
H. H. Hoos and T. St¨utzle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco, CA, USA, 2004.
[5]
J. Kennedy and R. Eberhart. Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks, pages 1942--1948, Piscataway, NJ, USA, 1995. IEEE Press.
[6]
J. Kennedy and R. Mendes. Neighborhood topologies in fully informed and best-of-neighborhood particle swarms. IEEE Transactions on Systems, Man, and Cybernetics, Part C, 36(4):515--519, 2006.
[7]
R. Mendes. Population Topologies and Their Influence in Particle Swarm Performance. PhD thesis, Escola de Engenharia, Universidade do Minho, 2004.
[8]
R. Mendes, J. Kennedy, and J. Neves. The fully informed particle swarm: Simpler, maybe better. IEEE Transactions on Evolutionary Computation, 8(3):204--210, 2004.
[9]
R. Poli. On the moments of the sampling distribution of particle swarm optimisers. In Proceedings of the workshop on particle swarm optimization: the second decade. Genetic and Evolutionary Computation Conference (GECCO), pages 2907--2914, New York, NY, USA, 2007. ACM Press.
[10]
R. Poli, J. Kennedy, and T. Blackwell. Particle swarm optimization. An overview. Swarm Intelligence, 1(1):33--57, 2007.
[11]
A. M. Sutton, D. Whitley, M. Lunacek, and A. Howe. PSO and Multi-Funnel Landscapes: How cooperation might limit exploration. In M. Cattolico, editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 75--82, New York, NY, USA, 2006. ACM Press.

Cited By

View all
  • (2023)Adaptive Filtering: Issues, Challenges, and Best-Fit Solutions Using Particle Swarm Optimization VariantsSensors10.3390/s2318771023:18(7710)Online publication date: 6-Sep-2023
  • (2021)Bifurcated particle swarm optimizer with topology learning particlesApplied Soft Computing10.1016/j.asoc.2021.108039114:COnline publication date: 30-Dec-2021
  • (2019)Optimization of Sensor Deployment for Industrial Internet of Things Using a Multiswarm AlgorithmIEEE Internet of Things Journal10.1109/JIOT.2019.29384866:6(10344-10362)Online publication date: Dec-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation
July 2008
1814 pages
ISBN:9781605581309
DOI:10.1145/1389095
  • Conference Chair:
  • Conor Ryan,
  • Editor:
  • Maarten Keijzer
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. experiments
  2. particle swarm optimization
  3. swarm intelligence

Qualifiers

  • Research-article

Conference

GECCO08
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Adaptive Filtering: Issues, Challenges, and Best-Fit Solutions Using Particle Swarm Optimization VariantsSensors10.3390/s2318771023:18(7710)Online publication date: 6-Sep-2023
  • (2021)Bifurcated particle swarm optimizer with topology learning particlesApplied Soft Computing10.1016/j.asoc.2021.108039114:COnline publication date: 30-Dec-2021
  • (2019)Optimization of Sensor Deployment for Industrial Internet of Things Using a Multiswarm AlgorithmIEEE Internet of Things Journal10.1109/JIOT.2019.29384866:6(10344-10362)Online publication date: Dec-2019
  • (2017)Optimizing Multipath Routing With Guaranteed Fault Tolerance in Internet of ThingsIEEE Sensors Journal10.1109/JSEN.2017.273918817:19(6463-6473)Online publication date: 1-Oct-2017
  • (2015)Fully informed particle swarm optimizer: Convergence analysis2015 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2015.7256888(164-170)Online publication date: May-2015
  • (2015)Particle swarm variants: standardized convergence analysisSwarm Intelligence10.1007/s11721-015-0109-79:2-3(177-203)Online publication date: 2-Jun-2015
  • (2014)A new dynamic probabilistic Particle Swarm Optimization with dynamic random population topology2014 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2014.6900381(1321-1327)Online publication date: Jul-2014
  • (2014)A locally convergent rotationally invariant particle swarm optimization algorithmSwarm Intelligence10.1007/s11721-014-0095-18:3(159-198)Online publication date: 1-Aug-2014
  • (2013)Analysis of leader selection strategies in a multi-objective Particle Swarm Optimizer2013 IEEE Congress on Evolutionary Computation10.1109/CEC.2013.6557955(3153-3160)Online publication date: Jun-2013
  • (2012)Why six informants is optimal in PSOProceedings of the 14th annual conference on Genetic and evolutionary computation10.1145/2330163.2330168(25-32)Online publication date: 7-Jul-2012
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media