The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Chaos-enhanced accelerated particle swarm optimization
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
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
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
Nature-Inspired Metaheuristic Algorithms
Yang, X. (2008) · Medical Entomology and Zoology · Cited by 4,556
Self-citationOtt, E., & Wiesenfeld, K. (1994) · Physics Today · doi:10.1063/1.2808369 · Cited by 3,448
Metaheuristics : from desing to implementation
Talbi, E. (2009) · HAL · Cited by 2,494
An Introduction to Chaotic Dynamical Systems
Devaney, R. L., & Eckmann, J.-P. (1987) · Physics Today · doi:10.1063/1.2820117 · Cited by 2,344
Ott, E. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511803260 · Cited by 2,298
Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems
Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2013) · Engineering with Computers · doi:10.1007/s00366-011-0241-y · Cited by 2,257
Self-citation
Cited by
Butterfly optimization algorithm: a novel approach for global optimization
Arora, S., & Singh, S. (2019) · Soft Computing · doi:10.1007/s00500-018-3102-4 · Cited by 1,719
Bat algorithm: literature review and applications
Yang, X. S., & He, X. (2013) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2013.055093 · Cited by 1,052
Self-citationNature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
Bio inspired computing – A review of algorithms and scope of applications
Kar, A. K. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.04.018 · Cited by 578
Wang, G.-G., Guo, L., Gandomi, A. H., Hao, G.-S., & Wang, H. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.123 · Cited by 564
Self-citation
Metadata
- Authors
- Gandomi, A. H., Yun, G. J., Yang, X.-S., & Talatahari, S.
- Venue
- Communications in Nonlinear Science and Numerical Simulation
- Publisher
- Elsevier BV
- Published
- 2013-02
- Volume
- 18
- Issue
- 2
- Pages
- 327-340
- ISSN
- 1007-5704 (ISSN-L)
- OpenAlex
- W1990318222
- Cited by
- 396
- References
- 41
- FWCI
- 32.93
- 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: Chaos-enhanced accelerated particle swarm optimization. https://app.cochat.ai/papers/10.1016/j.cnsns.2012.07.017
- The paper
- Gandomi, A. H., Yun, G. J., Yang, X.-S., & Talatahari, S. (2013). Chaos-enhanced accelerated particle swarm optimization. Communications in Nonlinear Science and Numerical Simulation. https://doi.org/10.1016/j.cnsns.2012.07.017
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.