The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Balancing Objective Optimization and Constraint Satisfaction in Constrained Evolutionary Multiobjective Optimization
Abstract
Both objective optimization and constraint satisfaction are crucial for solving constrained multiobjective optimization problems, but the existing evolutionary algorithms encounter difficulties in striking a good balance between them when tackling complex feasible regions. To address this issue, this article proposes a two-stage evolutionary algorithm, which adjusts the fitness evaluation strategies during the evolutionary process to adaptively balance objective optimization and constraint satisfaction. The proposed algorithm can switch between the two stages according to the status of the current population, enabling the population to cross the infeasible region and reach the feasible regions in one stage, and to spread along the feasible boundaries in the other stage. Experimental studies on four benchmark suites and three real-world applications demonstrate the superiority of the proposed algorithm over the state-of-the-art algorithms, especially on problems with complex feasible regions.
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.
Integrity signals
Registry
Cites
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.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
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
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]
Tian, Y., Cheng, R., Zhang, X., & Jin, Y. (2017) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2017.2742868 · Cited by 2,777
Self-citationJain, H., & Deb, K. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281534 · Cited by 2,172
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Bader, J., & Zitzler, E. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00009 · Cited by 2,081
A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & Sendhoff, B. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2519378 · Cited by 1,760
Self-citationA combined genetic adaptive search (GeneAS) for engineering design
Deb, K., & Goyal, M. K. (1996) · Cited by 1,229
An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition
Li, K., Deb, K., Zhang, Q., & Kwong, S. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2373386 · Cited by 1,208
The balance between proximity and diversity in multiobjective evolutionary algorithms
Bosman, P. A. N., & Thierens, D. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810761 · Cited by 1,154
Cited by
A Survey on Evolutionary Constrained Multiobjective Optimization
Liang, J., Ban, X., Yu, K., Qu, B., Qiao, K., Yue, C., Chen, K., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3155533 · Cited by 438
Self-citationDynamic Auxiliary Task-Based Evolutionary Multitasking for Constrained Multiobjective Optimization
Qiao, K., Yu, K., Qu, B., Liang, J., Song, H., Yue, C., Lin, H., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3175065 · Cited by 253
Self-citation
Metadata
- Authors
- Tian, Y., Zhang, Y., Su, Y., Zhang, X., Tan, K. C., & Jin, Y.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2022-09
- Volume
- 52
- Issue
- 9
- Pages
- 9559-9572
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W3134125492
- Cited by
- 383
- References
- 33
- FWCI
- 27.24
- 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: Balancing Objective Optimization and Constraint Satisfaction in Constrained Evolutionary Multiobjective Optimization. https://app.cochat.ai/papers/10.1109/tcyb.2020.3021138
- The paper
- Tian, Y., Zhang, Y., Su, Y., Zhang, X., Tan, K. C., & Jin, Y. (2022). Balancing Objective Optimization and Constraint Satisfaction in Constrained Evolutionary Multiobjective Optimization. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2020.3021138
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.