The DOI matches its Crossref record; 72 of the 73 references it cites were found in a registry or an index.
A Competitive Swarm Optimizer for Large Scale Optimization
Abstract
In this paper, a novel competitive swarm optimizer (CSO) for large scale optimization is proposed. The algorithm is fundamentally inspired by the particle swarm optimization but is conceptually very different. In the proposed CSO, neither the personal best position of each particle nor the global best position (or neighborhood best positions) is involved in updating the particles. Instead, a pairwise competition mechanism is introduced, where the particle that loses the competition will update its position by learning from the winner. To understand the search behavior of the proposed CSO, a theoretical proof of convergence is provided, together with empirical analysis of its exploration and exploitation abilities showing that the proposed CSO achieves a good balance between exploration and exploitation. Despite its algorithmic simplicity, our empirical results demonstrate that the proposed CSO exhibits a better overall performance than five state-of-the-art metaheuristic algorithms on a set of widely used large scale optimization problems and is able to effectively solve problems of dimensionality up to 5000.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Compared with three existing algorithms (i.e., EPSDE, CSO, and SLPSO), ACODE can achieve the best performances in terms of response time, ground resolution, and fuel consumption, respectively.”
From Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm (2022) · cites this paper as [34]
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569 · cited 1×
“the update ofXl(t), which is an inevitable operation in most swarm or population based evolutionary algorithms [2], [46 ]– [48].”
BackgroundMulti-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
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 · cited 1×
“wheret is the iteration (generation) number, Vi(t) andXi(t) represent the velocity and position of the i-th particle, respectively;ω is termed inertia weight [3], c1 and c2 are the acceleration coefficients [4], R1(t) andR2(t) are two vectors”
BackgroundA 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 · cited 1×
“2322602 where t is the iteration (generation) number, Vi(t) and Xi(t) represent the velocity and position of the i-th particle, respectively; ω is termed inertia weight [3], c1 and c2 are the acceleration coefficients [4], R1(t) and R2(t) are two vectors randomly generated within [0, 1]n; pbesti(t) and gbest(t) are th…”
BackgroundThe 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
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310 · cited 1×
“Due to its conceptual simplicity and high search efficiency, PSO has attracted much research interest over the past decades and has been successfully applied to a number of applications, such as water distribution network design [6], parameter optimization in suspension system [7], resource allocation [8], task assign…”
Background
Research works printed but not linked: 1
- jin, 2002, Fitness approximation in evolutionary computation—A survey, Proc GECCO, 1105
Cited by
Snake Optimizer: A novel meta-heuristic optimization algorithm
Hashim, F. A., & Hussien, A. G. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108320 · Cited by 1,106
INFO: An efficient optimization algorithm based on weighted mean of vectors
Ahmadianfar, I., Heidari, A. A., Noshadian, S., Chen, H., & Gandomi, A. H. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116516 · Cited by 822
“Currently, PSO has taken its place in the fields of large-scale optimisation problems[19], feature selection[20], single-objective optimization problem[21], multiobjective optimisation problems[22], and high-dimensional expensive problem[23].”
BackgroundA 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
“As suggested in [9,58], pairwise comparison in selection can not only reduce memory usage, but also make it easier to adopt a compact encoding.”
BackgroundSelf-citationHippopotamus optimization algorithm: a novel nature-inspired optimization algorithm
Amiri, M. H., Mehrabi Hashjin, N., Montazeri, M., Mirjalili, S., & Khodadadi, N. (2024) · Scientific Reports · doi:10.1038/s41598-024-54910-3 · Cited by 718
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2600642 · Cited by 660
Self-citation
Metadata
- Authors
- Cheng, R., & Jin, Y.
- Affiliations
- University of Surrey (GB)
- ORCID
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2015-02
- Volume
- 45
- Issue
- 2
- Pages
- 191-204
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W1995972800
- Cited by
- 1,052
- References
- 73
- Citations by year
- 2026: 58 · 2025: 123 · 2024: 162 · 2023: 132 · 2022: 154 · 2021: 118 · 2020: 92 · 2019: 63 · 2018: 53 · 2017: 48 · 2016: 35 · 2015: 11
- FWCI
- 31.90
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Cybernetics (publishedVersion)
- PubMed (publishedVersion)
- Surrey Research Insight Open Access (The University of Surrey) (submittedVersion)
- Open Research (University of Surrey) (submittedVersion)
- Funders
- Honda Research Institute Europe
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Antenna Design and Optimization
- Keywords
- competitive swarm optimizer, large-scale optimization, particle swarm optimization, metaheuristic algorithms, convergence proof, exploration-exploitation balance, high-dimensional optimization
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 Competitive Swarm Optimizer for Large Scale Optimization. https://app.cochat.ai/papers/10.1109/tcyb.2014.2322602
- The paper
- Cheng, R., & Jin, Y. (2015). A Competitive Swarm Optimizer for Large Scale Optimization. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2014.2322602
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.