The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Defining a Standard for Particle Swarm Optimization
Abstract
Particle swarm optimization has become a common heuristic technique in the optimization community, with many researchers exploring the concepts, issues, and applications of the algorithm. In spite of this attention, there has as yet been no standard definition representing exactly what is involved in modern implementations of the technique. A standard is defined here which is designed to be a straightforward extension of the original algorithm while taking into account more recent developments that can be expected to improve performance on standard measures. This standard algorithm is intended for use both as a baseline for performance testing of improvements to the technique, as well as to represent PSO to the wider optimization community
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Self-citationA new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 2×
“The vmax parameter prevented the system from entering this state by limiting the velocity of all particles to that value. constitutes perhaps the most significant variation to the original PSO algorithm, and was in fact proposed in one of the very first PSO publications [2].”
BackgroundSelf-citationA modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
Self-citationFlocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37406 · Cited by 7,714
Comparing inertia weights and constriction factors in particle swarm optimization
Eberhart, R. C., & Shi, Y. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870279 · Cited by 2,966
Comparison between genetic algorithms and particle swarm optimization
Eberhart, R. C., & Shi, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040812 · Cited by 1,610
Vesterstrom, J., & Thomsen, R. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331139 · Cited by 1,205
LISREL Approaches to Interaction Effects in Multiple Regression
Alexander, W. P. (1998) · Technometrics · doi:10.1080/00401706.1998.10485533 · Cited by 1,149
LISREL Approaches to Interaction Effects in Multiple Regression
Jaccard, J., & Wan, C. (1996) · Sage eBooks · doi:10.4135/9781412984782 · Cited by 884
Neighborhood topologies in fully informed and best-of-neighborhood particle swarms
Kennedy, J., & Mendes, R. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2006.875410 · Cited by 344
Self-citationA stochastic nonlinear model for coordinated bird flocks
Heppner, F. L., & Grenander, U. (1990) · Medical Entomology and Zoology · Cited by 285
Tuning Evolutionary Programming for Conformationally Flexible Molecular Docking.
Gehlhaar, D. K., & Fogel, D. B. (1996) · Evolutionary Programming · Cited by 76
Cited by
Particle swarm optimization algorithm: An overview
Wang, D., Tan, D., & Liu, L. (2018) · Soft Computing · doi:10.1007/s00500-016-2474-6 · Cited by 3,343
A comparative study of Artificial Bee Colony algorithm
Karaboga, D., & Akay, B. (2009) · Applied Mathematics and Computation · doi:10.1016/j.amc.2009.03.090 · Cited by 3,206
Backtracking Search Optimization Algorithm for numerical optimization problems
Civicioglu, P. (2013) · Applied Mathematics and Computation · doi:10.1016/j.amc.2013.02.017 · Cited by 1,018
Fireworks Algorithm for Optimization
Tan, Y., & Zhu, Y. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13495-1_44 · Cited by 980
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review
Bonyadi, M. R., & Michalewicz, Z. (2017) · Evolutionary Computation · doi:10.1162/evco_r_00180 · Cited by 841
Metadata
- Authors
- Bratton, D., & Kennedy, J.
- Venue
- 2007 IEEE Swarm Intelligence Symposium
- Publisher
- IEEE
- Published
- 2007-04
- Pages
- 120-127
- OpenAlex
- W2139386984
- Cited by
- 1,348
- References
- 13
- FWCI
- 30.36
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.