The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
A Level-Based Learning Swarm Optimizer for Large-Scale Optimization
Open accessAbstract
In pedagogy, teachers usually separate mixed-level students into different levels, treat them differently and teach them in accordance with their cognitive and learning abilities. Inspired from this idea, we consider particles in the swarm as mixed-level students and propose a level-based learning swarm optimizer (LLSO) to settle large-scale optimization, which is still considerably challenging in evolutionary computation. At first, a level-based learning strategy is introduced, which separates particles into a number of levels according to their fitness values and treats particles in different levels differently. Then, a new exemplar selection strategy is designed to randomly select two predominant particles from two different higher levels in the current swarm to guide the learning of particles. The cooperation between these two strategies could afford great diversity enhancement for the optimizer. Further, the exploration and exploitation abilities of the optimizer are analyzed both theoretically and empirically in comparison with two popular particle swarm optimizers. Extensive comparisons with several state-of-the-art algorithms on two widely used sets of large-scale benchmark functions confirm the competitive performance of the proposed optimizer in both solution quality and computational efficiency. Finally, comparison experiments on problems with dimensionality increasing from 200 to 2000 further substantiate the good scalability of the developed optimizer.
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
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Comprehensive 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
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Self-citationA Cooperative Approach to Particle Swarm Optimization
vandenBergh, F., & Engelbrecht, A. P. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826069 · Cited by 2,120
Population structure and particle swarm performance
Kennedy, J., & Mendes, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004493 · Cited by 1,586
A novel numerical optimization algorithm inspired from weed colonization
Mehrabian, A. R., & Lucas, C. (2006) · Ecological Informatics · doi:10.1016/j.ecoinf.2006.07.003 · Cited by 1,396
Cited by
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Self-citationCao, Y., Zhang, H., Li, W., Zhou, M., Zhang, Y., & Chaovalitwongse, W. A. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2885075 · Cited by 405
War Strategy Optimization Algorithm: A New Effective Metaheuristic Algorithm for Global Optimization
Ayyarao, T. S. L. V., Ramakrishna, N. S. S., Elavarasan, R. M., Polumahanthi, N., Rambabu, M., Saini, G., Khan, B., & Alatas, B. (2022) · IEEE Access · doi:10.1109/access.2022.3153493 · Cited by 369
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
Surrogate-assisted hierarchical particle swarm optimization
Yu, H., Tan, Y., Zeng, J., Sun, C., & Jin, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2018.04.062 · Cited by 313
Metadata
- Authors
- Yang, Q., Chen, W.-N., Deng, J. D., Li, Y., Gu, T., & Zhang, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2018-08
- Volume
- 22
- Issue
- 4
- Pages
- 578-594
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2753899746
- Cited by
- 326
- References
- 54
- FWCI
- 10.50
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A Level-Based Learning Swarm Optimizer for Large-Scale Optimization. https://app.cochat.ai/papers/10.1109/tevc.2017.2743016
- The paper
- Yang, Q., Chen, W.-N., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018). A Level-Based Learning Swarm Optimizer for Large-Scale Optimization. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2017.2743016
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.