The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Adaptively Allocating Search Effort in Challenging Many-Objective Optimization Problems
Abstract
An effective allocation of search effort is important in multiobjective optimization, particularly in many-objective optimization problems (MaOPs). This paper presents a new adaptive search effort allocation strategy for multiobjective evolutionary algorithm based on decomposition MOEA/D-M2M, a recent MOEA/D algorithm for challenging MaOPs. This proposed method adaptively adjusts the subregions of its subproblems by detecting the importance of different objectives in an adaptive manner. More specifically, it periodically resets the subregion setting based on the distribution of the current solutions in the objective space such that the search effort is not wasted on unpromising regions. The basic idea is that the current population can be regarded as an approximation to the Pareto front (PF) and thus one can implicitly estimate the shape of the PF and such estimation can be used for adjusting the search focus. The performance of proposed algorithm has been verified by comparing it with eight representative and competitive algorithms on a set of degenerated MaOPs with disconnected and connected PFs. Performances of the proposed algorithm on a number of nondegenerated test instances with connected and disconnected PFs 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.
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
Evolutionary Generative Adversarial Networks
Wang, C., Xu, C., Yao, X., & Tao, D. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2895748 · Cited by 378
Hua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Metadata
- Authors
- Liu, H.-L., Chen, L., Zhang, Q., & Deb, K.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2018-06
- Volume
- 22
- Issue
- 3
- Pages
- 433-448
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2735649024
- Cited by
- 162
- References
- 1
- FWCI
- 13.96
- 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: Adaptively Allocating Search Effort in Challenging Many-Objective Optimization Problems. https://app.cochat.ai/papers/10.1109/tevc.2017.2725902
- The paper
- Liu, H.-L., Chen, L., Zhang, Q., & Deb, K. (2018). Adaptively Allocating Search Effort in Challenging Many-Objective Optimization Problems. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2017.2725902
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.