The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An improved particle swarm optimization algorithm
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
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
A 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
Empirical study of particle swarm optimization
Shi, Y., & Eberhart, R. C. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785511 · Cited by 3,945
Effective and efficient global optimization for conceptual rainfall‐runoff models
Duan, Q., Sorooshian, S., & Gupta, V. (1992) · Water Resources Research · doi:10.1029/91wr02985 · Cited by 3,310
The particle swarm optimization algorithm: convergence analysis and parameter selection
Trelea, I. C. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(02)00447-7 · Cited by 2,644
Using selection to improve particle swarm optimization
Angeline, P. J. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699327 · Cited by 864
Particle swarm optimization with Gaussian mutation
Higashi, N., & Iba, H. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202250 · Cited by 544
Hybrid Particle Swarm Optimiser with breeding and subpopulations
Løvbjerg, M., Rasmussen, T., & Krink, T. (2001) · Cited by 429
Hybrid particle swarm optimization with simulated annealing
Wang, X., & Li, J. (2005) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2004.1382205 · Cited by 102
Cited by
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
A competitive mechanism based multi-objective particle swarm optimizer with fast convergence
Zhang, X., Zheng, X., Cheng, R., Qiu, J., & Jin, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2017.10.037 · Cited by 425
Enhanced probabilistic neural network with local decision circles: A robust classifier
Ahmadlou, M., & Adeli, H. (2010) · Integrated Computer-Aided Engineering · doi:10.3233/ica-2010-0345 · Cited by 349
Metadata
- Authors
- Jiang, Y., Hu, T., Huang, C., & Wu, X.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2007-10
- Volume
- 193
- Issue
- 1
- Pages
- 231-239
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2030614909
- Cited by
- 305
- References
- 12
- FWCI
- 20.49
- Type
- journal article
- 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
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 improved particle swarm optimization algorithm. https://app.cochat.ai/papers/10.1016/j.amc.2007.03.047
- The paper
- Jiang, Y., Hu, T., Huang, C., & Wu, X. (2007). An improved particle swarm optimization algorithm. Applied Mathematics and Computation. https://doi.org/10.1016/j.amc.2007.03.047
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.