The DOI matches its Crossref record; 41 of the 41 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.
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
Self-citationThe 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
Pleiotropy, natural selection, and the evolution of senescence.
Williams, G. C. (1957) · Evolution · doi:10.1111/j.1558-5646.1957.tb02911.x · Cited by 4,279
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
Self-citationComprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
Parameter selection in particle swarm optimization
Shi, Y., & Eberhart, R. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040810 · Cited by 3,538
Self-citationSelf-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients
Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826071 · Cited by 3,034
(2005) · Cited by 2,565
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
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
RetractedA social spider algorithm for global optimization
Yu, J. J. Q., & Li, V. O. K. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.02.014 · Cited by 416
Feature selection for high-dimensional classification using a competitive swarm optimizer
Gu, S., Cheng, R., & Jin, Y. (2018) · Soft Computing · doi:10.1007/s00500-016-2385-6 · Cited by 360
Population size in Particle Swarm Optimization
Piotrowski, A. P., Napiorkowski, J. J., & Piotrowska, A. E. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100718 · Cited by 357
Zhan, Z.-H., Li, J., Cao, J., Zhang, J., Chung, H. S.-H., & Shi, Y.-H. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2209115 · Cited by 346
Self-citationA Novel Sigmoid-Function-Based Adaptive Weighted Particle Swarm Optimizer
Liu, W., Wang, Z., Yuan, Y., Zeng, N., Hone, K., & Liu, X. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2925015 · Cited by 346
A new meta-heuristic optimizer: Pathfinder algorithm
Yapici, H., & Cetinkaya, N. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.03.012 · Cited by 339
A Level-Based Learning Swarm Optimizer for Large-Scale Optimization
Yang, Q., Chen, W.-N., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2743016 · Cited by 326
Self-citationAdaptive Multimodal Continuous Ant Colony Optimization
Yang, Q., Chen, W.-N., Yu, Z., Gu, T., Li, Y., Zhang, H., & Zhang, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2591064 · Cited by 325
Self-citationChen, H., Heidari, A. A., Chen, H., Wang, M., Pan, Z., & Gandomi, A. H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.04.008 · Cited by 322
A balanced whale optimization algorithm for constrained engineering design problems
Chen, H., Xu, Y., Wang, M., & Zhao, X. (2019) · Applied Mathematical Modelling · doi:10.1016/j.apm.2019.02.004 · Cited by 320
Chen, H., Jiao, S., Heidari, A. A., Wang, M., Chen, X., & Zhao, X. (2019) · Energy Conversion and Management · doi:10.1016/j.enconman.2019.05.057 · Cited by 287
Phasor particle swarm optimization: a simple and efficient variant of PSO
Ghasemi, M., Akbari, E., Rahimnejad, A., Razavi, S. E., Ghavidel, S., & Li, L. (2019) · Soft Computing · doi:10.1007/s00500-018-3536-8 · Cited by 278
A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm
Zeng, N., Wang, Z., Liu, W., Zhang, H., Hone, K., & Liu, X. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3029748 · Cited by 269
Position-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis
Luo, X., Yuan, Y., Chen, S., Zeng, N., & Wang, Z. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3033324 · Cited by 264
Chen, H., Zhang, Q., Luo, J., Xu, Y., & Zhang, X. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105884 · Cited by 257
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
- 41
- 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
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.