The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
Open accessAbstract
This paper proposes an improved epsilon constraint-handling mechanism and combines it with a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). The proposed constrained multi-objective evolutionary algorithm (CMOEA) is named MOEA/D-IEpsilon. It adjusts the epsilon level dynamically according to the ratio of feasible to total solutions in the current population. In order to evaluate the performance of MOEA/D-IEpsilon, a new set of CMOPs with two and three objectives is designed, having large infeasible regions (relative to the feasible regions), and they are called LIR-CMOPs. Then, the 14 benchmarks, including LIR-CMOP1-14, are used to test MOEA/D-IEpsilon and four other decomposition-based CMOEAs, including MOEA/D-Epsilon, MOEA/D-SR, MOEA/D-CDP and CMOEA/D. The experimental results indicate that MOEA/D-IEpsilon is significantly better than the other four CMOEAs on all of the test instances, which shows that MOEA/D-IEpsilon is more suitable for solving CMOPs with large infeasible regions. Furthermore, a real-world problem, namely the robot gripper optimization problem, is used to test the five CMOEAs. The experimental results demonstrate that MOEA/D-IEpsilon also outperforms the other four CMOEAs on this problem.
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
A Simple Sequentially Rejective Multiple Test Procedure
(1979) · Scandinavian Journal of Statistics · doi:10.2307/4615733 · Cited by 21,526 · cited 1×
“To control the family-wise error rate (FWER), a set of post hoc procedures, including the Bonferroni–Dunn procedure (Dunn 1961), the Holm procedure (Holm 1979), the Holland procedure (Holland and Copenhaver 1987), the Finner procedure (Finner 1993), theHochberg procedure (Hochberg 1988), theHommel procedure (Hommel 19…”
MethodMulti-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,326
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 3×
“In terms of decomposition methods, there are three commonly used approaches, including weighted sum (Miettinen (1999)), Tchebycheff (Miet-tinen (1999)) and boundary intersection approaches (Zhang and Li (2007)).”
BackgroundMethodInfluentialMultiobjective 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
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Multiple comparisons among means
Dunn, O. J. (1961) · Journal of the American Statistical Association · doi:10.1080/01621459.1961.10482090 · Cited by 5,006
A sharper Bonferroni procedure for multiple tests of significance
HOCHBERG, Y. (1988) · Biometrika · doi:10.1093/biomet/75.4.800 · Cited by 4,829
Nonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
Nonlinear Multiobjective Optimization
Mardle, S., & Miettinen, K. M. (2000) · The Journal of the Operational Research Society · doi:10.2307/254267 · Cited by 3,049
Multiobjective 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
Coello 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
A 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
Stochastic 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
A stagewise rejective multiple test procedure based on a modified Bonferroni test
HOMMEL, G. (1988) · Biometrika · doi:10.1093/biomet/75.2.383 · Cited by 1,367
Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition
Zhang, Q., Zhou, A., Zhao, S.-Z., Suganthan, P. N., Liu, W., & Tiwari, S. K. (2009) · Cited by 1,312
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
PESA-II: region-based selection in evolutionary multiobjective optimization
Corne, D., Jerram, N. R., Knowles, J. D., & Oates, M. J. (2001) · Genetic and Evolutionary Computation Conference (GECCO) · Cited by 1,249
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
Constraint-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
Liu, H.-L., Gu, F., & Zhang, Q. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281533 · Cited by 813
2006 IEEE International Conference on Evolutionary Computation
(2006) · doi:10.1109/cec11288.2006 · Cited by 711
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
A sequentially rejective test procedure based on a modified Bonferroni inequality
ROM, D. M. (1990) · Biometrika · doi:10.1093/biomet/77.3.663 · Cited by 421
Markov Chain Analysis of Cumulative Step-size Adaptation on a Linear Constrained Problem
Chotard, A., Auger, A., & Nikolaus Hansen, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.04409 · Cited by 389
An Improved Sequentially Rejective Bonferroni Test Procedure
Holland, B. S., & Copenhaver, M. D. (1987) · Biometrics · doi:10.2307/2531823 · Cited by 372
On a Monotonicity Problem in Step-Down Multiple Test Procedures
Finner, H. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10476358 · Cited by 301
A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm
Jiang, S., Zhang, J., Ong, Y.-S., Zhang, A. N., & Tan, P. S. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2367526 · Cited by 259
Cai, X., Li, Y., Fan, Z., & Zhang, Q. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2350995 · Cited by 200
Self-citationA study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D
Jan, M. A., & Khanum, R. A. (2013) · Applied Soft Computing · doi:10.1016/j.asoc.2012.07.027 · Cited by 199
Cai, X., Yang, Z., Fan, Z., & Zhang, Q. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2586191 · Cited by 136
Self-citationAn adaptive constraint handling approach embedded MOEA/D
Asafuddoula, M., Ray, T., Sarker, R. A., & Alam, K. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6252868 · Cited by 107
A two-step rejection procedure for testing multiple hypotheses
Li, J. (. (2007) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2007.04.032 · Cited by 83
Cited by
A Coevolutionary Framework for Constrained Multiobjective Optimization Problems
Tian, Y., Zhang, T., Xiao, J., Zhang, X., & Jin, Y. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.3004012 · Cited by 735
Ma, Z., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2896967 · Cited by 458
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 survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
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
Metadata
- Authors
- Fan, Z., Li, W., Cai, X., Huang, H., Fang, Y., You, Y., Mo, J., Wei, C., & Goodman, E.
- Venue
- Soft Computing
- Published
- 2019-02-04
- Volume
- 23
- Issue
- 23
- Pages
- 12491-12510
- ISSN
- 1432-7643 (ISSN-L)
- 1433-7479
- OpenAlex
- W2963371534
- Cited by
- 450
- References
- 38
- FWCI
- 20.14
- 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.