Shuwei Zhu , Yimo Zhang , Wei Fang , Meiji Cui , Kalyanmoy Deb
{"title":"高维昂贵多目标优化的回归与关系辅助进化算法","authors":"Shuwei Zhu , Yimo Zhang , Wei Fang , Meiji Cui , Kalyanmoy Deb","doi":"10.1016/j.swevo.2025.101978","DOIUrl":null,"url":null,"abstract":"<div><div>Surrogate-assisted evolutionary algorithms (SAEAs) have gained a lot of attention to handle expensive multi-objective optimization problems (EMOPs). However, when it comes to high-dimensional EMOPs (HEMOPs), the performance of existing SAEAs degrades dramatically because of the dimensionality sensitivity issue, in which effective surrogate models are difficult to build. To this end, we propose a regression- and relation-assisted evolutionary algorithm (<span><math><mrow><msup><mrow><mtext>R</mtext></mrow><mrow><mn>2</mn></mrow></msup><mtext>AEA</mtext></mrow></math></span>) to deal with HEMOPs, which involves a regression-assisted weight optimization (RWO) stage and a relation-assisted multi-objective optimization (RMO) stage. To be specific, the RWO is facilitated by the problem transformation strategy and regression models. It reformulates the high-dimensional problem into a relative low-dimensional one and intends to converge to the Pareto-optimal front (PF) efficiently. Thereafter, the RMO concentrates on maintaining the population diversity with a new infill sampling criterion, which considers the optimization performance as well as the uncertainty estimated by the predicted entropy. To validate its effectiveness, we compare <span><math><mrow><msup><mrow><mtext>R</mtext></mrow><mrow><mn>2</mn></mrow></msup><mtext>AEA</mtext></mrow></math></span> with five state-of-the-art algorithms on various benchmark test suites with dimensions varying from 50 to 200, and six real-world HEMOPs. Experimental results show the superiority of <span><math><mrow><msup><mrow><mtext>R</mtext></mrow><mrow><mn>2</mn></mrow></msup><mtext>AEA</mtext></mrow></math></span> in terms of convergence speed and diversity maintenance with limited computational resources.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 101978"},"PeriodicalIF":8.5000,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Regression and relation-assisted evolutionary algorithm for high-dimensional expensive multi-objective optimization\",\"authors\":\"Shuwei Zhu , Yimo Zhang , Wei Fang , Meiji Cui , Kalyanmoy Deb\",\"doi\":\"10.1016/j.swevo.2025.101978\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Surrogate-assisted evolutionary algorithms (SAEAs) have gained a lot of attention to handle expensive multi-objective optimization problems (EMOPs). However, when it comes to high-dimensional EMOPs (HEMOPs), the performance of existing SAEAs degrades dramatically because of the dimensionality sensitivity issue, in which effective surrogate models are difficult to build. To this end, we propose a regression- and relation-assisted evolutionary algorithm (<span><math><mrow><msup><mrow><mtext>R</mtext></mrow><mrow><mn>2</mn></mrow></msup><mtext>AEA</mtext></mrow></math></span>) to deal with HEMOPs, which involves a regression-assisted weight optimization (RWO) stage and a relation-assisted multi-objective optimization (RMO) stage. To be specific, the RWO is facilitated by the problem transformation strategy and regression models. It reformulates the high-dimensional problem into a relative low-dimensional one and intends to converge to the Pareto-optimal front (PF) efficiently. Thereafter, the RMO concentrates on maintaining the population diversity with a new infill sampling criterion, which considers the optimization performance as well as the uncertainty estimated by the predicted entropy. To validate its effectiveness, we compare <span><math><mrow><msup><mrow><mtext>R</mtext></mrow><mrow><mn>2</mn></mrow></msup><mtext>AEA</mtext></mrow></math></span> with five state-of-the-art algorithms on various benchmark test suites with dimensions varying from 50 to 200, and six real-world HEMOPs. Experimental results show the superiority of <span><math><mrow><msup><mrow><mtext>R</mtext></mrow><mrow><mn>2</mn></mrow></msup><mtext>AEA</mtext></mrow></math></span> in terms of convergence speed and diversity maintenance with limited computational resources.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 101978\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650225001361\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001361","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Regression and relation-assisted evolutionary algorithm for high-dimensional expensive multi-objective optimization
Surrogate-assisted evolutionary algorithms (SAEAs) have gained a lot of attention to handle expensive multi-objective optimization problems (EMOPs). However, when it comes to high-dimensional EMOPs (HEMOPs), the performance of existing SAEAs degrades dramatically because of the dimensionality sensitivity issue, in which effective surrogate models are difficult to build. To this end, we propose a regression- and relation-assisted evolutionary algorithm () to deal with HEMOPs, which involves a regression-assisted weight optimization (RWO) stage and a relation-assisted multi-objective optimization (RMO) stage. To be specific, the RWO is facilitated by the problem transformation strategy and regression models. It reformulates the high-dimensional problem into a relative low-dimensional one and intends to converge to the Pareto-optimal front (PF) efficiently. Thereafter, the RMO concentrates on maintaining the population diversity with a new infill sampling criterion, which considers the optimization performance as well as the uncertainty estimated by the predicted entropy. To validate its effectiveness, we compare with five state-of-the-art algorithms on various benchmark test suites with dimensions varying from 50 to 200, and six real-world HEMOPs. Experimental results show the superiority of in terms of convergence speed and diversity maintenance with limited computational resources.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.