The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Particle Swarm Optimization With an Aging Leader and Challengers
Abstract
In nature, almost every organism ages and has a limited lifespan. Aging has been explored by biologists to be an important mechanism for maintaining diversity. In a social animal colony, aging makes the old leader of the colony become weak, providing opportunities for the other individuals to challenge the leadership position. Inspired by this natural phenomenon, this paper transplants the aging mechanism to particle swarm optimization (PSO) and proposes a PSO with an aging leader and challengers (ALC-PSO). ALC-PSO is designed to overcome the problem of premature convergence without significantly impairing the fast-converging feature of PSO. It is characterized by assigning the leader of the swarm with a growing age and a lifespan, and allowing the other individuals to challenge the leadership when the leader becomes aged. The lifespan of the leader is adaptively tuned according to the leader's leading power. If a leader shows strong leading power, it lives longer to attract the swarm toward better positions. Otherwise, if a leader fails to improve the swarm and gets old, new particles emerge to challenge and claim the leadership, which brings in diversity. In this way, the concept “aging” in ALC-PSO actually serves as a challenging mechanism for promoting a suitable leader to lead the swarm. The algorithm is experimentally validated on 17 benchmark functions. Its high performance is confirmed by comparing with eight popular PSO variants.
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
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
Pleiotropy, natural selection, and the evolution of senescence
Williams, G. C. (1957) · Evolution · doi:10.2307/2406060 · Cited by 1,912
Cited by
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
Particle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
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 Colony Predation Algorithm
Tu, J., Chen, H., Wang, M., & Gandomi, A. H. (2021) · Journal of Bionic Engineering · doi:10.1007/s42235-021-0050-y · Cited by 571
Metadata
- Authors
- Chen, W.-N., Zhang, J., Lin, Y., Chen, N., Zhan, Z.-H., Chung, H. S.-H., Li, Y., & Shi, Y.-H.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2013-04
- Volume
- 17
- Issue
- 2
- Pages
- 241-258
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W1987234899
- Cited by
- 635
- References
- 2
- FWCI
- 34.20
- 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: Particle Swarm Optimization With an Aging Leader and Challengers. https://app.cochat.ai/papers/10.1109/tevc.2011.2173577
- The paper
- Chen, W.-N., Zhang, J., Lin, Y., Chen, N., Zhan, Z.-H., Chung, H. S.-H., Li, Y., & Shi, Y.-H. (2013). Particle Swarm Optimization With an Aging Leader and Challengers. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2011.2173577
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.