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

The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.

Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer

Tian, Ye, Zheng, Xiutao, Zhang, Xingyi, Jin, Yaochu·2020·IEEE Transactions on Cybernetics

Abstract

There exist many multiobjective optimization problems (MOPs) containing a large number of decision variables in real-world applications, which are known as large-scale MOPs. Due to the ineffectiveness of existing operators in finding optimal solutions in a huge decision space, some decision variable division-based algorithms have been tailored for improving the search efficiency in solving large-scale MOPs. However, these algorithms will encounter difficulties when solving problems with complicated landscapes, as the decision variable division is likely to be inaccurate and time consuming. In this paper, we propose a competitive swarm optimizer (CSO)-based efficient search for solving large-scale MOPs. The proposed algorithm adopts a new particle updating strategy that suggests a two-stage strategy to update position, which can highly improve the search efficiency. The experimental results on large-scale benchmark MOPs and an application example demonstrate the superiority of the proposed algorithm over several state-of-the-art multiobjective evolutionary algorithms, including problem transformation-based algorithm, decision variable clustering-based algorithm, particle swarm optimization algorithm, and estimation of distribution algorithm.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcyb.2019.2906383

Cites

63 of 63 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 63 references

Cited by

See all 480

Metadata

Authors
Tian, Y., Zheng, X., Zhang, X., & Jin, Y.
Venue
IEEE Transactions on Cybernetics
Published
2020-08
Volume
50
Issue
8
Pages
3696-3708
ISSN
  • 2168-2267 (ISSN-L)
  • 2168-2275
OpenAlex
W2932748297
Cited by
480
References
63
FWCI
21.45
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: Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer. https://app.cochat.ai/papers/10.1109/tcyb.2019.2906383
The paper
Tian, Y., Zheng, X., Zhang, X., & Jin, Y. (2020). Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2019.2906383

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.