An ensemble learning-based multi-population evolutionary framework for multi-scenario multi-objective optimization problems

被引:6
作者
Zhao, Chunliang [1 ]
Hao, Yuanyuan [2 ,3 ]
Gong, Dunwei [1 ]
Du, Junwei [1 ]
Zhang, Shujun [1 ]
Li, Zhong [3 ]
机构
[1] Qingdao Univ Sci & Technol, Sch Informat Sci & Technol, 99 Songling Rd, Qingdao 266061, Peoples R China
[2] Beijing Jiaotong Univ, Sch Traff & Transportat, 3 Shangyuan Village, Beijing 100028, Peoples R China
[3] Fern Univ Hagen, Fac Math & Comp Sci, D-58097 Hagen, Germany
基金
中国国家自然科学基金;
关键词
Multi -scenario optimization problem; Evolutionary algorithm; Bi-compromise task; Ensemble learning; Bi-layer selection; MANY-OBJECTIVE OPTIMIZATION; ALGORITHM; DESIGN;
D O I
10.1016/j.knosys.2023.110708
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-scenario multi-objective optimization problems (MSMOPs) are a topic of considerable interest in the field of optimization. The MSMOP contains a set of multi-objective optimization problems arising from varying operating conditions, with the goal of determining a set of communal compromise solutions. However, there are few universal methods available for MSMOPs. This paper presents a general method incorporating transfer learning for MSMOPs. First, a multi-scenario ensemble framework that transfers knowledge between scenarios is developed to combine arbitrary multi-objective evolutionary algorithms, where a scenario-based comprehensive evaluation indicator is developed for combination with base learners. Then, an adaptive decomposition-based multi-objective evolutionary algorithm with a bi-layer selection (EADaBS) is proposed and embedded within the framework as a base learner. EADaBS incorporates an adaptive fitness assignment in its first layer to facilitate exploration, and density measurement in its second layer to ensure exploitation. A rebalancing operator is also designed to aid the population towards the Pareto front. Finally, a multitude of experiments is conducted to verify the effectiveness and efficiency of the proposed algorithms. Two three-scenario multiobjective optimization problems are designed and utilized as test problems. The experimental results clearly demonstrate that the proposed framework outperforms existing state-of-the-art algorithms. In conclusion, this research provides new insights into the solution of MSMOPs.& COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:18
相关论文
共 54 条
[1]  
Archer RobertR., 2012, An introduction to mechanics of solids
[2]  
BenTal A, 2009, PRINC SER APPL MATH, P1
[3]   The scenario approach for systems and control design [J].
Campi, Marco C. ;
Garatti, Simone ;
Prandini, Maria .
ANNUAL REVIEWS IN CONTROL, 2009, 33 (02) :149-157
[4]   Evolutionary Many-Objective Algorithm Using Decomposition-Based Dominance Relationship [J].
Chen, Lei ;
Liu, Hai-Lin ;
Tan, Kay Chen ;
Cheung, Yiu-Ming ;
Wang, Yuping .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (12) :4129-4139
[5]  
Cheng-Shan Wang, 2011, 2011 4th International Conference on Electric Utility Deregulation and Restructuring and Power Technologies (DRPT 2011), P1638, DOI 10.1109/DRPT.2011.5994160
[6]   Aircraft directional stability and vertical tail design: A review of semi-empirical methods [J].
Ciliberti, Danilo ;
Della Vecchia, Pierluigi ;
Nicolosi, Fabrizio ;
De Marco, Agostino .
PROGRESS IN AEROSPACE SCIENCES, 2017, 95 :140-172
[7]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[8]   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
[9]   Handling Multiple Scenarios in Evolutionary Multiobjective Numerical Optimization [J].
Deb, Kalyanmoy ;
Zhu, Ling ;
Kulkarni, Sandeep .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (06) :920-933
[10]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601