Journal
SWARM AND EVOLUTIONARY COMPUTATION
Volume 55, Issue -, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.swevo.2020.100676
Keywords
Multi-objective; Evolutionary algorithm; MOEA/D-M2M; Unbalanced constraints; Constraint-handling technique
Funding
- Natural Science Foundation of Guangdong Province [2020A1515011500]
- Projects of Science and Technology of Guangzhou [201804010352]
- China Scholarship Council
Ask authors/readers for more resources
Despite the successful application of an extension of the Multi-Objective Evolution Algorithm based on Decomposition (MOEA/D-M2M) to solve unbalanced multi-objective optimization problems (UMOPs), its use in eonstrained unbalanced multi-objective optimization problems has not been fully explored. In an earlier paper, a definition of UMOPs was suggested that had two necessary conditions: 1) finding a favored subset of the Pareto set is easier than finding an unfavored subset, and 2) the favored subset of the Pareto set dominates a large part of the feasible space. The second condition strongly reduces the fraction of MOPs that are considered UMOPs. In this paper, we eliminate that second condition and consider a broader class of UMOPs. We design an unbalanced constrained multi-objective test suite with three different types of biased constraints, yielding three different types of constrained test problems in which the degree of imbalance is scalable via a set of parameters introduced for each problem. We analyse the characteristics of three types of constraints and the difficulties they present for potential solution algorithms-i.e., NSGA-II, MOEA/D and MOEA/D-M2M, with four constraint-handling techniques. MOEA/D-M2M is shown to significantly outperform the other algorithms on these problems due to its decomposition strategy.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available