The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D
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
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
Cited by
Push and pull search for solving constrained multi-objective optimization problems
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.08.017 · Cited by 594
Liu, Z.-Z., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2894743 · Cited by 486
Ma, Z., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2896967 · Cited by 458
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
Fan, Z., Li, W., Cai, X., Huang, H., Fang, Y., You, Y., Mo, J., Wei, C., & Goodman, E. (2019) · Soft Computing · doi:10.1007/s00500-019-03794-x · Cited by 450
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
A Dual-Population-Based Evolutionary Algorithm for Constrained Multiobjective Optimization
Ming, M., Trivedi, A., Wang, R., Srinivasan, D., & Zhang, T. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3066301 · Cited by 258
Handling Constrained Multiobjective Optimization Problems via Bidirectional Coevolution
Liu, Z.-Z., Wang, B.-C., & Tang, K. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3056176 · Cited by 254
Metadata
- Authors
- Jan, M. A., & Khanum, R. A.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2013-01
- Volume
- 13
- Issue
- 1
- Pages
- 128-148
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2085364807
- Cited by
- 199
- References
- 2
- FWCI
- 3.05
- 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
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.