Regularity model based offspring generation in surrogate-assisted evolutionary algorithms for expensive multi-objective optimization

被引:2
作者
Li, Bingdong [1 ,2 ]
Lu, Yongfan [1 ,2 ]
Qian, Hong [1 ,2 ]
Hong, Wenjing [4 ]
Yang, Peng [5 ,6 ]
Zhou, Aimin [1 ,3 ]
机构
[1] East China Normal Univ, Shanghai Inst AI Educ, Shanghai 200062, Peoples R China
[2] East China Normal Univ, Sch Comp Sci & Technol, Shanghai 200062, Peoples R China
[3] Shanghai Frontiers Sci Ctr Mol Intelligent Synth, Shanghai, Peoples R China
[4] Shenzhen Univ, Natl Engn Lab Big Data Syst Comp Technol, Shenzhen 518060, Guangdong, Peoples R China
[5] Southern Univ Sci & Technol, Dept Stat & Data Sci, Shenzhen 518055, Peoples R China
[6] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Guangdong Prov Key Lab Brain Inspired Intelligent, Shenzhen 518055, Peoples R China
基金
中国国家自然科学基金;
关键词
Expensive optimization; Multi-objective optimization; Regularity model; Pareto set learning; Surrogate assisted evolutionary algorithm; RM-MEDA; IMPROVEMENT; DIVERSITY;
D O I
10.1016/j.swevo.2024.101506
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary algorithms face significant challenges when it comes to solving expensive multi -objective optimization problems, which require costly evaluations. One of the most popular approaches to addressing this issue is to use surrogate models, which can replace the expensive real function evaluations with cheaper approximations. However, in many surrogate -assisted evolutionary algorithms (SAEAs), the process of offspring generation has not received sufficient attention. In this paper, we propose a novel framework for expensive multi -objective optimization called RM-SAEA, which utilizes a regularity model (RM) operator to generate offspring more effectively. The regularity model operator is combined with a general genetic algorithm operator to create a heterogeneous offspring generation module that can better approximate the Pareto front. Moreover, to overcome the data deficiency issue in expensive optimization scenarios, we employ a data augmentation strategy while training the regularity model. Finally, we embed three representative SAEAs into the proposed RM-SAEA to demonstrate its efficacy. Experimental results on several benchmark test suites with up to 10 objectives and real -world applications show that RM-SAEA achieves superior overall performance compared to eight state-of-the-art algorithms. By focusing on more effective offspring generation and addressing data deficiencies, our proposed framework is able to generate better approximations of the Pareto front and improve the optimization process in expensive multi -objective optimization scenarios.
引用
收藏
页数:17
相关论文
共 92 条
[1]  
amperle R. G_, 2002, PROC 3 WSEAS INT C N, P293
[2]  
Belakaria S, 2019, ADV NEUR IN, V32
[3]  
Bian C, 2023, PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, P5513
[4]   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
[5]  
Bradford E, 2018, J GLOBAL OPTIM, V71, P407, DOI 10.1007/s10898-018-0609-2
[6]   Multi-objectivizing Software Configuration Tuning [J].
Chen, Tao ;
Li, Miqing .
PROCEEDINGS OF THE 29TH ACM JOINT MEETING ON EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING (ESEC/FSE '21), 2021, :453-465
[7]   A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization [J].
Chugh, Tinkle ;
Jin, Yaochu ;
Miettinen, Kaisa ;
Hakanen, Jussi ;
Sindhya, Karthik .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) :129-142
[8]   Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization [J].
Couckuyt, Ivo ;
Deschrijver, Dirk ;
Dhaene, Tom .
JOURNAL OF GLOBAL OPTIMIZATION, 2014, 60 (03) :575-594
[9]  
Daulton S, 2021, ADV NEUR IN, V34
[10]  
Daulton S, 2022, PR MACH LEARN RES, V180, P507