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

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

A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy

Liu, Yiping, Gong, Dunwei, Sun, Jing, Jin, Yaochu · 2017 · IEEE Transactions on Cybernetics

Abstract

Most existing multiobjective evolutionary algorithms experience difficulties in solving many-objective optimization problems due to their incapability to balance convergence and diversity in the high-dimensional objective space. In this paper, we propose a novel many-objective evolutionary algorithm using a one-by-one selection strategy. The main idea is that in the environmental selection, offspring individuals are selected one by one based on a computationally efficient convergence indicator to increase the selection pressure toward the Pareto optimal front. In the one-by-one selection, once an individual is selected, its neighbors are de-emphasized using a niche technique to guarantee the diversity of the population, in which the similarity between individuals is evaluated by means of a distribution indicator. In addition, different methods for calculating the convergence indicator are examined and an angle-based similarity measure is adopted for effective evaluations of the distribution of solutions in the high-dimensional objective space. Moreover, corner solutions are utilized to enhance the spread of the solutions and to deal with scaled optimization problems. The proposed algorithm is empirically compared with eight state-of-the-art many-objective evolutionary algorithms on 80 instances of 16 benchmark problems. The comparative results demonstrate that the overall performance of the proposed algorithm is superior to the compared algorithms on the optimization problems studied in this paper.

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.2016.2638902

Cites

46 of 46 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 46 references

Cited by

See all 271

Metadata

Authors
Liu, Y., Gong, D., Sun, J., & Jin, Y.
Venue
IEEE Transactions on Cybernetics
Published
2017-09
Volume
47
Issue
9
Pages
2689-2702
ISSN
  • 2168-2267 (ISSN-L)
  • 2168-2275
OpenAlex
W2570235502
Cited by
271
References
46
FWCI
22.34
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: A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy. https://app.cochat.ai/papers/10.1109/tcyb.2016.2638902
The paper
Liu, Y., Gong, D., Sun, J., & Jin, Y. (2017). A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2016.2638902

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.