The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Particle swarm optimization: Velocity initialization
Open accessAbstract
Since its birth in 1995, particle swarm optimization (PSO) has been well studied and successfully applied. While a better understanding of PSO and particle behaviors have been obtained through theoretical and empirical analysis, some issues about the beavior of particles remain unanswered. One such issue is how velocities should be initialized. Though zero initial velocities have been advocated, a popular initialization strategy is to set initial weights to random values within the domain of the optimization problem. This article first illustrates that particles tend to leave the boundaries of the search space irrespective of the initialization approach, resulting in wasted search effort. It is also shown that random initialization increases the number of roaming particles, and that this has a negative impact on convergence time. It is also shown that enforcing a boundary constraint on personal best positions does not help much to address this problem. The main objective of the article is to show that the best approach is to initialize particles to zero, or random values close to zero, without imposing a personal best bound.
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
A 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 1×
“Numerous empirical [1], [2], [3], [4], [5] and theoretical [6], [2], [7], [8] analyses of particle swarm optimization (PSO) [9], [10] have been done.”
Background
Cited by
Particle swarm optimization (PSO). A tutorial
Marini, F., & Walczak, B. (2015) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2015.08.020 · Cited by 1,828
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
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
RetractedMarini, F., & Walczak, B. (2020) · Comprehensive Chemometrics · doi:10.1016/b978-0-12-409547-2.14581-0 · Cited by 277
Metadata
- Authors
- Engelbrecht, A.
- Venue
- 2012 IEEE Congress on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2012-06
- Pages
- 1-8
- OpenAlex
- W2018465333
- Cited by
- 164
- References
- 1
- FWCI
- 9.11
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Particle swarm optimization: Velocity initialization. https://app.cochat.ai/papers/10.1109/cec.2012.6256112
- The paper
- Engelbrecht, A. (2012). Particle swarm optimization: Velocity initialization. 2012 IEEE Congress on Evolutionary Computation. https://doi.org/10.1109/cec.2012.6256112
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.