The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit
Open accessAbstract
Multiobjective evolutionary algorithms (MOEAs) have progressed significantly in recent decades, but most of them are designed to solve unconstrained multiobjective optimization problems. In fact, many real-world multiobjective problems contain a number of constraints. To promote research on constrained multiobjective optimization, we first propose a problem classification scheme with three primary types of difficulty, which reflect various types of challenges presented by real-world optimization problems, in order to characterize the constraint functions in constrained multiobjective optimization problems (CMOPs). These are feasibility-hardness, convergence-hardness, and diversity-hardness. We then develop a general toolkit to construct difficulty adjustable and scalable CMOPs (DAS-CMOPs, or DAS-CMaOPs when the number of objectives is greater than three) with three types of parameterized constraint functions developed to capture the three proposed types of difficulty. In fact, the combination of the three primary constraint functions with different parameters allows the construction of a large variety of CMOPs, with difficulty that can be defined by a triplet, with each of its parameters specifying the level of one of the types of primary difficulty. Furthermore, the number of objectives in this toolkit can be scaled beyond three. Based on this toolkit, we suggest nine difficulty adjustable and scalable CMOPs and nine CMaOPs, to be called DAS-CMOP1-9 and DAS-CMaOP1-9, respectively. To evaluate the proposed test problems, two popular CMOEAs—MOEA/D-CDP (MOEA/D with constraint dominance principle) and NSGA-II-CDP (NSGA-II with constraint dominance principle) and two popular constrained many-objective evolutionary algorithms (CMaOEAs)—C-MOEA/DD and C-NSGA-III—are used to compare performance on DAS-CMOP1-9 and DAS-CMaOP1-9 with a variety of difficulty triplets, respectively. The experimental results reveal that mechanisms in MOEA/D-CDP may be more effective in solving convergence-hard DAS-CMOPs, while mechanisms of NSGA-II-CDP may be more effective in solving DAS-CMOPs with simultaneous diversity-, feasibility-, and convergence-hardness. Mechanisms in C-NSGA-III may be more effective in solving feasibility-hard CMaOPs, while mechanisms of C-MOEA/DD may be more effective in solving CMaOPs with convergence-hardness. In addition, none of them can solve these problems efficiently, which stimulates us to continue to develop new CMOEAs and CMaOEAs to solve the suggested DAS-CMOPs and DAS-CMaOPs.
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
Self-citationNo free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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-citationMultiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Self-citationMuiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Self-citationPerformance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
An efficient constraint handling method for genetic algorithms
Deb, K. (2000) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(99)00389-8 · Cited by 3,892
Self-citationMultiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543
Self-citationCoello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Indicator-Based Selection in Multiobjective Search
Zitzler, E., & Künzli, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_84 · Cited by 2,259
Jain, H., & Deb, K. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281534 · Cited by 2,172
Self-citationA review of multiobjective test problems and a scalable test problem toolkit
Huband, S., Hingston, P., Barone, L., & While, L. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.861417 · Cited by 2,090
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
SMS-EMOA: Multiobjective selection based on dominated hypervolume
Beume, N., Naujoks, B., & Emmerich, M. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.008 · Cited by 2,048
Scalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
Self-citationStochastic ranking for constrained evolutionary optimization
Runarsson, T. P., & Yao, X. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.873238 · Cited by 1,807
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
Deb, K. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.3.205 · Cited by 1,451
Self-citationAn 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
Self-citationConstraint-handling in nature-inspired numerical optimization: Past, present and future
Mezura-Montes, E., & Coello Coello, C. A. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.10.001 · Cited by 1,127
Solving Multiobjective Optimization Problems Using an Artificial Immune System
Coello, C. A. C., & Cort�s, N. C. (2005) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-005-6164-x · Cited by 1,062
Liu, H.-L., Gu, F., & Zhang, Q. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281533 · Cited by 813
Self-citationEvolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization
Koziel, S., & Michalewicz, Z. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.1.19 · Cited by 758
Joines, J. A., & Houck, C. R. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.349995 · Cited by 749
An effective co-evolutionary differential evolution for constrained optimization
Huang, F.-Z., Wang, L., & He, Q. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.07.105 · Cited by 544
Search Biases in Constrained Evolutionary Optimization
Runarsson, T. P., & Yao, X. (2005) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2004.841906 · Cited by 468
Ensemble of Constraint Handling Techniques
Mallipeddi, R., & Suganthan, P. N. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033582 · Cited by 467
Test Problems for Large-Scale Multiobjective and Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & sendhoff, B. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2600577 · Cited by 427
Constraint Handling in Multiobjective Evolutionary Optimization
Woldesenbet, Y. G., Yen, G. G., & Tessema, B. G. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009032 · Cited by 420
A Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization
Cai, Z., & Wang, Y. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.872344 · Cited by 400
Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers
Yuan, Y., Xu, H., Wang, B., Zhang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2443001 · Cited by 400
Osyczka, A., & Kundu, S. (1995) · Structural and Multidisciplinary Optimization · doi:10.1007/bf01743536 · Cited by 356
An Adaptive Tradeoff Model for Constrained Evolutionary Optimization
Wang, Y., Cai, Z., Zhou, Y., & Zeng, W. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.902851 · Cited by 302
Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems
Ishibuchi, H., Akedo, N., & Nojima, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2315442 · Cited by 288
GA-based decision support system for multicriteria optimization
Tanaka, M., Watanabe, H., Furukawa, Y., & Tanino, T. (2002) · 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century · doi:10.1109/icsmc.1995.537993 · Cited by 248
Infeasibility Driven Evolutionary Algorithm for Constrained Optimization
Ray, T., Singh, H. K., Isaacs, A., & Smith, W. (2009) · Studies in Computational Intelligence · doi:10.1007/978-3-642-00619-7_7 · Cited by 202
Cai, X., Li, Y., Fan, Z., & Zhang, Q. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2350995 · Cited by 200
Self-citationConstrained multi-objective optimization algorithm with an ensemble of constraint handling methods
Qu, B. Y., & Suganthan, P. N. (2011) · Engineering Optimization · doi:10.1080/0305215x.2010.493937 · Cited by 190
Takahama, T., & Sakai, S. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.850256 · Cited by 160
A survey of repair methods used as constraint handling techniques in evolutionary algorithms
Salcedo‐Sanz, S. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.07.001 · Cited by 152
R2-IBEA: R2 indicator based evolutionary algorithm for multiobjective optimization
Phan, D. H., & Suzuki, J. (2013) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2013.6557783 · Cited by 127
Handling equality constraints in evolutionary optimization
Ullah, A. B., Sarker, R. A., & Lokan, C. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.01.047 · Cited by 29
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
Tian, Y., Zhang, Y., Su, Y., Zhang, X., Tan, K. C., & Jin, Y. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3021138 · Cited by 383
Dynamic 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
Metadata
- Authors
- Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2020-09
- Volume
- 28
- Issue
- 3
- Pages
- 339-378
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2582113504
- Cited by
- 308
- References
- 42
- FWCI
- 8.68
- 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
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.