Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

Ran Cheng, Yaochu Jin · 2015 · IEEE Transactions on Cybernetics

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

Crossref · 10.1109/tcyb.2014.2322602

Cites

72 of 72 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 73 references

Research works printed but not linked: 1

  1. jin, 2002, Fitness approximation in evolutionary computation—A survey, Proc GECCO, 1105

Cited by

See all 1,052

Metadata

Authors
Cheng, R., & Jin, Y.
Affiliations
University of Surrey (GB)
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.