The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On Tchebycheff Decomposition Approaches for Multiobjective Evolutionary Optimization
Abstract
Tchebycheff decomposition represents one of the most widely used decomposition approaches that can convert a multiobjective optimization problem into a set of scalar optimization subproblems. Nevertheless, the geometric properties of the subproblem objective functions in Tchebycheff decomposition have not been explicitly studied. This paper proposes a Tchebycheff decomposition with lp-norm constraint on direction vectors in which the subproblem objective functions are endowed with clear geometric property. Especially, the Tchebycheff decomposition with l2-norm constraint on direction vectors is taken as an example to illustrate its advantage. A new unary R2indicator is also introduced to approximate the hyper-volume metric and justify the efficiency of the proposed Tchebycheff decomposition. A resultant Tchebycheff decomposition-based multiobjective evolutionary algorithm (MOEA) with l2-norm constraint and a new population update strategy is proposed to solve multiobjective optimization problems. The experimental results on both benchmark and real-world multiobjective optimization problems show that the proposed algorithm is capable of obtaining high quality solutions compared with other state-of-the-art MOEAs.
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.
Integrity signals
Registry
Cites
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.
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
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Self-citation
Cited by
A Comprehensive Review on Multi-objective Optimization Techniques: Past, Present and Future
Sharma, S., & Kumar, V. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09778-9 · Cited by 455
Evolutionary Multitasking via Explicit Autoencoding
Feng, L., Zhou, L., Zhong, J., Gupta, A., Ong, Y.-S., Tan, K.-C., & Qin, A. K. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2845361 · Cited by 438
Binary differential evolution with self-learning for multi-objective feature selection
Zhang, Y., Gong, D.-W., Gao, X.-Z., Tian, T., & Sun, X.-Y. (2020) · Information Sciences · doi:10.1016/j.ins.2019.08.040 · Cited by 429
A Survey on the Hypervolume Indicator in Evolutionary Multiobjective Optimization
Shang, K., Ishibuchi, H., He, L., & Pang, L. M. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.3013290 · Cited by 380
Multiobjective Particle Swarm Optimization for Feature Selection With Fuzzy Cost
Hu, Y., Zhang, Y., & Gong, D. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3015756 · Cited by 277
Metadata
- Authors
- Ma, X., Zhang, Q., Tian, G., Yang, J., & Zhu, Z.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2018-04
- Volume
- 22
- Issue
- 2
- Pages
- 226-244
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2616650140
- Cited by
- 199
- References
- 1
- FWCI
- 16.55
- 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: On Tchebycheff Decomposition Approaches for Multiobjective Evolutionary Optimization. https://app.cochat.ai/papers/10.1109/tevc.2017.2704118
- The paper
- Ma, X., Zhang, Q., Tian, G., Yang, J., & Zhu, Z. (2018). On Tchebycheff Decomposition Approaches for Multiobjective Evolutionary Optimization. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2017.2704118
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.