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

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

Comparison between MOEA/D and NSGA-III on a set of novel many and multi-objective benchmark problems with challenging difficulties

Li, Hui, Deb, Kalyanmoy, Zhang, Qingfu, Suganthan, P.N., Chen, Lei · 2019 · Swarm and Evolutionary Computation

Abstract

Abstract Currently, evolutionary multiobjective optimization (EMO) algorithms have been successfully used to find a good approximation of many-objective optimization problems (MaOPs). To measure the performance of EMO algorithms, many benchmark multiobjective test problems have been constructed. Among them, DTLZ and WFG are two representative test suites with the scalability to the number of variables and objectives. It should be pointed out that MaOPs can be more challenging if they are involved with difficult problem features, such as objective scalability, complicated Pareto set, bias, disconnection, or degeneracy. In this paper, a set of ten new test problems with above-mentioned difficulties are constructed. Some experimental results on these test problems found by two popular EMO algorithms, i.e., MOEA/D and NSGA-III, are reported and analyzed. Moreover, the performance of these two EMO algorithms with different population sizes on these test problems are also studied.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1016/j.swevo.2019.02.003

Cites

1 of 1 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 1 references

Cited by

See all 164

Metadata

Authors
Li, H., Deb, K., Zhang, Q., Suganthan, P. N., & Chen, L.
Venue
Swarm and Evolutionary Computation
Publisher
Elsevier BV
Published
2019-05
Volume
46
Pages
104-117
ISSN
2210-6502 (ISSN-L)
OpenAlex
W2911539482
Cited by
164
References
1
FWCI
18.66
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: Comparison between MOEA/D and NSGA-III on a set of novel many and multi-objective benchmark problems with challenging difficulties. https://app.cochat.ai/papers/10.1016/j.swevo.2019.02.003
The paper
Li, H., Deb, K., Zhang, Q., Suganthan, P. N., & Chen, L. (2019). Comparison between MOEA/D and NSGA-III on a set of novel many and multi-objective benchmark problems with challenging difficulties. Swarm and Evolutionary Computation. https://doi.org/10.1016/j.swevo.2019.02.003

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.