Bare bones particle swarms
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
The particle swarm algorithm has just enough moving parts to make it hard to understand. The formula is very simple, it is even easy to describe the working of the algorithm verbally, yet it is very difficult to grasp in one's mind how the particles oscillate around centers that are constantly changing; how they influence one another; how the various parameters affect the trajectory of the particle; how the topology of the swarm affects its performance; and so on. This paper strips away some traditional features of the particle swarm in the search for the properties that make it work. The particle swarm algorithm is modified by eliminating the velocity formula. Variations are compared. In the process some of the mysteries of the algorithm are revealed, we discover its similarity to other stochastic population-based problem solving methods, and new avenues of investigation are suggested or implied.
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
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
Blind variation and selective retentions in creative thought as in other knowledge processes
Campbell, D. T. (1960) · Psychological Review · doi:10.1037/h0040373 · Cited by 2,329
The swarm and the queen: towards a deterministic and adaptive particle swarm optimization
Clerc, M. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785513 · Cited by 1,692
Population structure and particle swarm performance
Kennedy, J., & Mendes, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004493 · Cited by 1,586
Self-citationKennedy, J. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040809 · Cited by 318
Self-citationA stochastic nonlinear model for coordinated bird flocks
Heppner, F. L., & Grenander, U. (1990) · Medical Entomology and Zoology · Cited by 285
Cited by
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Self-citationDifferential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
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
Kennedy, J. (2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_630 · Cited by 2,989
Self-citationRecent advances in differential evolution – An updated survey
Das, S., Mullick, S. S., & Suganthan, P. N. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.01.004 · Cited by 1,592
A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
Zhang, Y., Wang, S., & Ji, G. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/931256 · Cited by 1,146
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
A social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
“The earliest model-based PSO was proposed by Kennedy [42], called the Bare Bones PSO (BBPSO), which uses Gaussian distributions instead of the velocity equation to update the particle positions.”
MethodCooperatively Coevolving Particle Swarms for Large Scale Optimization
Li, X., & Yao, X. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2112662 · Cited by 745
A review of particle swarm optimization. Part I: background and development
Banks, A., Vincent, J., & Anyakoha, C. (2007) · Natural Computing · doi:10.1007/s11047-007-9049-5 · Cited by 626
Water wave optimization: A new nature-inspired metaheuristic
Zheng, Y.-J. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.10.008 · Cited by 568
Coelho, L. D. S. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.06.044 · Cited by 544
Lynn, N., & Suganthan, P. N. (2015) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2015.05.002 · Cited by 515
Banks, A., Vincent, J., & Anyakoha, C. (2008) · Natural Computing · doi:10.1007/s11047-007-9050-z · Cited by 472
Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
Houssein, E. H., Gad, A. G., Hussain, K., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100868 · Cited by 466
RetractedKennedy, J. (2006) · Handbook of Nature-Inspired and Innovative Computing · doi:10.1007/0-387-27705-6_6 · Cited by 432
Self-citationDEPSO: hybrid particle swarm with differential evolution operator
Zhang, W.-J., & Xie, X.-F. (2004) · SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483) · doi:10.1109/icsmc.2003.1244483 · Cited by 401
Sun, J., Fang, W., Wu, X., Palade, V., & Xu, W. (2012) · Evolutionary Computation · doi:10.1162/evco_a_00049 · Cited by 396
Swarm Intelligence in Optimization
Blum, C., & Li, X. (2008) · Natural Computing Series · doi:10.1007/978-3-540-74089-6_2 · Cited by 396
Song, X.-F., Zhang, Y., Gong, D.-W., & Gao, X.-Z. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3061152 · Cited by 348
Krohling, R. A., & dos Santos Coelho, L. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.873185 · Cited by 326
Ensemble particle swarm optimizer
Lynn, N., & Suganthan, P. N. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.02.007 · Cited by 298
Zhang, Y., Gong, D.-W., & Ding, Z. (2012) · Information Sciences · doi:10.1016/j.ins.2011.06.004 · Cited by 288
Gaussian Bare-Bones Differential Evolution
Wang, H., Rahnamayan, S., Sun, H., & Omran, M. G. H. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2213808 · Cited by 267
Feature selection using bare-bones particle swarm optimization with mutual information
Song, X.-F., Zhang, Y., Gong, D.-W., & Sun, X.-Y. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2020.107804 · Cited by 266
Evolutionary Algorithms for Wireless Communications — A Review of the State-of-the art
Goudos, S. K. (2014) · Contemporary Issues in Wireless Communications · doi:10.5772/59147 · Cited by 13
Metadata
- Authors
- Kennedy, J.
- Venue
- Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706)
- Publisher
- IEEE
- Published
- 2004-03-22
- Pages
- 80-87
- OpenAlex
- W2127931254
- Cited by
- 690
- References
- 7
- FWCI
- 12.58
- 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.