Evolutionary Constrained Multiobjective Optimization: Scalable High-Dimensional Constraint Benchmarks and Algorithm

被引:34
作者
Qiao, Kangjia [1 ]
Liang, Jing [1 ,2 ]
Yu, Kunjie [1 ]
Yue, Caitong [1 ]
Lin, Hongyu [1 ]
Zhang, Dezheng [1 ]
Qu, Boyang [3 ]
机构
[1] Zhengzhou Univ, Sch Elect & Informat Engn, Zhengzhou 450001, Peoples R China
[2] Henan Inst Technol, Sch Elect Engn & Automat, Xinxiang 453003, Henan, Peoples R China
[3] Zhongyuan Univ Technol, Sch Elect & Informat Engn, Zhengzhou 450007, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Benchmark testing; Heuristic algorithms; Optimization; Linear programming; Search problems; Task analysis; Sociology; Algorithm; benchmark; decision space constraints; evolutionary constrained multiobjective optimization; DIFFERENTIAL EVOLUTION; CONSTRUCTION; MOEA/D;
D O I
10.1109/TEVC.2023.3281666
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary constrained multiobjective optimization has received extensive attention and research in the past two decades, and a lot of benchmarks have been proposed to test the effect of the constrained multiobjective evolutionary algorithms (CMOEAs). Especially, the constraint functions are highly correlated with the objective values, which makes the features of constraints too monotonic and differ from the properties of the real-world problems. Accordingly, previous CMOEAs cannot solve real-world problems well, which generally involve decision space constraints with multimodal/nonlinear features. Therefore, we propose a new benchmark framework and design a suite of new test functions with scalable high-dimensional decision space constraints. To be specific, different high-dimensional constraint functions and mixed linkages in variables are considered to be close to realistic features. In this framework, several parameter interfaces are provided, so that users can easily adjust the parameters to obtain the variant functions and test the generalization performance of the algorithms. Different types of existing CMOEAs are employed to test the use of the proposed test functions, and the results show that they are easy to fall into local feasible regions. Therefore, we improve one evolutionary multitasking-based CMOEA to better handle these problems, in which a new search algorithm is designed to enhance the search abilities of populations. Compared with the existing CMOEAs, the proposed CMOEA presents better performance.
引用
收藏
页码:965 / 979
页数:15
相关论文
共 73 条
[1]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[2]   Constrained multi-objective population extremal optimization based economic-emission dispatch incorporating renewable energy resources [J].
Chen, Min-Rong ;
Zeng, Guo-Qiang ;
Lu, Kang-Di .
RENEWABLE ENERGY, 2019, 143 :277-294
[3]   Test Problems for Large-Scale Multiobjective and Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (12) :4108-4121
[4]   A Multiobjective Evolutionary Algorithm Using Gaussian Process-Based Inverse Modeling [J].
Cheng, Ran ;
Jin, Yaochu ;
Narukawa, Kaname ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (06) :838-856
[5]   A benchmark for equality constrained multi-objective optimization [J].
Cuate, Oliver ;
Uribe, Lourdes ;
Lara, Adriana ;
Schutze, Oliver .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 52
[6]  
Deb K, 2001, LECT NOTES COMPUT SC, V1993, P284
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]   Multi-operator based evolutionary algorithms for solving constrained optimization problems [J].
Elsayed, Saber M. ;
Sarker, Ruhul A. ;
Essam, Daryl L. .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (12) :1877-1896
[9]   An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions [J].
Fan, Zhun ;
Li, Wenji ;
Cai, Xinye ;
Huang, Han ;
Fang, Yi ;
You, Yugen ;
Mo, Jiajie ;
Wei, Caimin ;
Goodman, Erik .
SOFT COMPUTING, 2019, 23 (23) :12491-12510
[10]   Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit [J].
Fan, Zhun ;
Li, Wenji ;
Cai, Xinye ;
Li, Hui ;
Wei, Caimin ;
Zhang, Qingfu ;
Deb, Kalyanmoy ;
Goodman, Erik .
EVOLUTIONARY COMPUTATION, 2020, 28 (03) :339-378