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

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

Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers

Open access
Yuan, Yuan, Xu, Hua, Wang, Bo, Zhang, Bo, Yao, Xin·2016·IEEE Transactions on Evolutionary Computation

Abstract

The decomposition-based multiobjective evolutionary algorithms (MOEAs) generally make use of aggregation functions to decompose a multiobjective optimization problem into multiple single-objective optimization problems. However, due to the nature of contour lines for the adopted aggregation functions, they usually fail to preserve the diversity in high-dimensional objective space even by using diverse weight vectors. To address this problem, we propose to maintain the desired diversity of solutions in their evolutionary process explicitly by exploiting the perpendicular distance from the solution to the weight vector in the objective space, which achieves better balance between convergence and diversity in many-objective optimization. The idea is implemented to enhance two well-performing decomposition-based algorithms, i.e., MOEA, based on decomposition and ensemble fitness ranking. The two enhanced algorithms are compared to several state-of-the-art algorithms and a series of comparative experiments are conducted on a number of test problems from two well-known test suites. The experimental results show that the two proposed algorithms are generally more effective than their predecessors in balancing convergence and diversity, and they are also very competitive against other existing algorithms for solving many-objective optimization problems.

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

Cites

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

Cited by

See all 400

Metadata

Authors
Yuan, Y., Xu, H., Wang, B., Zhang, B., & Yao, X.
Venue
IEEE Transactions on Evolutionary Computation
Published
2016-04
Volume
20
Issue
2
Pages
180-198
ISSN
  • 1089-778X (ISSN-L)
  • 1941-0026
OpenAlex
W2326149522
Cited by
400
References
55
FWCI
32.94
Type
journal article
Language
en
Open access
green

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: Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers. https://app.cochat.ai/papers/10.1109/tevc.2015.2443001
The paper
Yuan, Y., Xu, H., Wang, B., Zhang, B., & Yao, X. (2016). Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2015.2443001

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.