Large-Scale Multiobjective Optimization via Reformulated Decision Variable Analysis

被引:35
作者
He, Cheng [1 ]
Cheng, Ran [1 ]
Li, Lianghao [2 ]
Tan, Kay Chen [3 ]
Jin, Yaochu [4 ,5 ]
机构
[1] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Guangdong Prov Key Lab Brain Inspired Intelligent, Shenzhen 518055, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Artificial Intelligence & Automat, Key Lab Image Informat Proc & Intelligent Control, Minist China, Wuhan 430074, Peoples R China
[3] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
[4] Bielefeld Univ, Fac Technol, Chair Nat Inspired Comp & Engn, D-33615 Bielefeld, Germany
[5] Univ Surrey, Dept Comp Sci, Guildford GU2 7XH, England
基金
中国国家自然科学基金;
关键词
Optimization; Statistics; Sociology; Convergence; Iron; Maintenance engineering; Visualization; Decision variable analysis (DVA); evolutionary algorithm (EA); large-scale optimization; problem reformulation; MANY-OBJECTIVE OPTIMIZATION; EVOLUTIONARY ALGORITHMS; SELECTION; FASTER;
D O I
10.1109/TEVC.2022.3213006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the rising number of large-scale multiobjective optimization problems (LSMOPs) from academia and industries, some multiobjective evolutionary algorithms (MOEAs) with different decision variable handling strategies have been proposed. Decision variable analysis (DVA) is widely used in large-scale optimization, aiming at identifying the connection between each decision variable and the objectives, and grouping those interacting decision variables to reduce the complexity of LSMOPs. Despite their effectiveness, existing DVA techniques require the unbearable cost of function evaluations for solving LSMOPs. We propose a reformulation-based approach for efficient DVA to address this deficiency. Then a large-scale MOEA is proposed based on reformulated DVA, namely, LERD. Specifically, the DVA process is reformulated into an optimization problem with binary decision variables, aiming to approximate different grouping results. Afterwards, each group of decision variables is used for convergence-related or diversity-related optimization. The effectiveness and efficiency of the reformulation-based DVA are validated by replacing the corresponding DVA techniques in two large-scale MOEAs. Experiments in comparison with six state-of-the-art large-scale MOEAs on LSMOPs with up to 2000 decision variables have shown the promising performance of LERD.
引用
收藏
页码:47 / 61
页数:15
相关论文
共 67 条
[41]  
Antonio LM, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P2758
[42]  
Okabe T, 2004, LECT NOTES COMPUT SC, V3242, P792
[43]   A Review of Population-Based Metaheuristics for Large-Scale Black-Box Global Optimization-Part I [J].
Omidvar, Mohammad Nabi ;
Li, Xiaodong ;
Yao, Xin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2022, 26 (05) :802-822
[44]   DG2: A Faster and More Accurate Differential Grouping for Large-Scale Black-Box Optimization [J].
Omidvar, Mohammad Nabi ;
Yang, Ming ;
Mei, Yi ;
Li, Xiaodong ;
Yao, Xin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (06) :929-942
[45]   A region division based diversity maintaining approach for many-objective optimization [J].
Pan, Linqiang ;
He, Cheng ;
Tian, Ye ;
Su, Yansen ;
Zhang, Xingyi .
INTEGRATED COMPUTER-AIDED ENGINEERING, 2017, 24 (03) :279-296
[46]   Large-Scale Evolutionary Multiobjective Optimization Assisted by Directed Sampling [J].
Qin, Shufen ;
Sun, Chaoli ;
Jin, Yaochu ;
Tan, Ying ;
Fieldsend, Jonathan .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (04) :724-738
[47]  
Srinivas N., 1994, Evolutionary Computation, V2, P221, DOI 10.1162/evco.1994.2.3.221
[48]   Extended Differential Grouping for Large Scale Global Optimization with Direct and Indirect Variable Interactions [J].
Sun, Yuan ;
Kirley, Michael ;
Halgamuge, Saman K. .
GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, :313-320
[49]   Evolutionary Algorithms for Multi-Objective Optimization: Performance Assessments and Comparisons [J].
K.C. Tan ;
T.H. Lee ;
E.F. Khor .
Artificial Intelligence Review, 2002, 17 (4) :251-290
[50]  
Tian Y., 2022, ACM COMPUT SURV, V54, P1