The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
An Overview of Variants and Advancements of PSO Algorithm
Open accessAbstract
Particle swarm optimization (PSO) is one of the most famous swarm-based optimization techniques inspired by nature. Due to its properties of flexibility and easy implementation, there is an enormous increase in the popularity of this nature-inspired technique. Particle swarm optimization (PSO) has gained prompt attention from every field of researchers. Since its origin in 1995 till now, researchers have improved the original Particle swarm optimization (PSO) in varying ways. They have derived new versions of it, such as the published theoretical studies on various parameters of PSO, proposed many variants of the algorithm and numerous other advances. In the present paper, an overview of the PSO algorithm is presented. On the one hand, the basic concepts and parameters of PSO are explained, on the other hand, various advances in relation to PSO, including its modifications, extensions, hybridization, theoretical analysis, are included.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
1 retracted
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
RetractedNo free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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
Harris hawks optimization: Algorithm and applications
Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.02.028 · Cited by 6,324
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310
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
MOPSO: a proposal for multiple objective particle swarm optimization
Coello Coello, C. A., & Lechuga, M. S. (2002) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004388 · Cited by 2,437
The Fully Informed Particle Swarm: Simpler, Maybe Better
Mendes, R., Kennedy, J., & Neves, J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826074 · Cited by 1,745
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
Computational Intelligence: An Introduction
Engelbrecht, A. P. (2007) · Wiley eBooks · doi:10.1002/9780470512517 · Cited by 1,462
Cited by
Path planning techniques for mobile robots: Review and prospect
Liu, L., Wang, X., Yang, X., Liu, H., Li, J., & Wang, P. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120254 · Cited by 707
Metadata
- Authors
- Jain, M., Saihjpal, V., Singh, N., & Singh, S. B.
- Venue
- Applied Sciences
- Publisher
- MDPI AG
- Published
- 2022-08-23
- Volume
- 12
- Issue
- 17
- Pages
- 8392
- ISSN
- 2076-3417 (ISSN-L)
- OpenAlex
- W4293027896
- Cited by
- 717
- References
- 34
- FWCI
- 46.45
- Type
- journal article
- Language
- en
- Open access
- gold
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: An Overview of Variants and Advancements of PSO Algorithm. https://app.cochat.ai/papers/10.3390/app12178392
- The paper
- Jain, M., Saihjpal, V., Singh, N., & Singh, S. B. (2022). An Overview of Variants and Advancements of PSO Algorithm. Applied Sciences. https://doi.org/10.3390/app12178392
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.
