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

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

A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems

Gong, Dunwei, Sun, Jing, Miao, Zhuang·2018·IEEE Transactions on Evolutionary Computation

Abstract

Interval many-objective optimization problems (IMaOPs), involving more than three objectives and at least one subjected to interval uncertainty, are ubiquitous in real-world applications. However, there have been very few effective methods for solving these problems. In this paper, we proposed a set-based genetic algorithm to effectively solve them. The original optimization problem was first transformed into a deterministic bi-objective problem, where new objectives are hyper-volume and imprecision. A set-based Pareto dominance relation was then defined to modify the fast nondominated sorting approach in NSGA-II. Additionally, set-based evolutionary schemes were suggested. Finally, our method was empirically evaluated on 39 benchmark IMaOPs as well as a car cab design problem and compared with two typical methods. The numerical results demonstrated the superiority of our method and indicated that a tradeoff approximate front between convergence and uncertainty can be produced.

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/tevc.2016.2634625

Cites

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

Cited by

See all 261

Metadata

Authors
Gong, D., Sun, J., & Miao, Z.
Venue
IEEE Transactions on Evolutionary Computation
Published
2018-02
Volume
22
Issue
1
Pages
47-60
ISSN
  • 1089-778X (ISSN-L)
  • 1941-0026
OpenAlex
W2558150887
Cited by
261
References
25
FWCI
24.71
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 Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems. https://app.cochat.ai/papers/10.1109/tevc.2016.2634625
The paper
Gong, D., Sun, J., & Miao, Z. (2018). A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2016.2634625

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.