Jie Lin , Sheng Xin Zhang , Shao Yong Zheng , Kwai Man Luk
{"title":"基于档案辅助的全信息进化算法的昂贵多目标优化","authors":"Jie Lin , Sheng Xin Zhang , Shao Yong Zheng , Kwai Man Luk","doi":"10.1016/j.swevo.2025.101988","DOIUrl":null,"url":null,"abstract":"<div><div>In many real-world engineering and scientific optimization scenarios, practitioners often face expensive many-objective optimization problems where evaluating candidate solutions incurs prohibitive computational costs. The inherent scarcity of truly calculated data often leads to the construction of models with high uncertainty using limited datasets. This uncertainty can adversely affect the Surrogate-assisted Many-Objective Evolutionary Algorithms (SAMaOEAs). To address this issue and enhance performance, this paper introduces an Archive-assisted Fully Informed Evolutionary Algorithm (AFIEA). In AFIEA, two kinds of models are constructed from archive data to simultaneously predict objective values and uncertainty trends (whether the predictions are overestimated or underestimated). With this foundation, both the optimizer and infill criterion processes are fully guided by the predicted objective values and uncertainty trends. In the optimization phase, a novel Uncertainty Trend Classification (UTC)-based Upper Confidence Bound is employed as the acquisition function. During the infill criterion phase, UTC is used to preprocess the population, enhancing the selection probability of under-estimated solutions, while an archive-based metric selects more precise solutions, guided by the archive in terms of convergence and diversity. The performance of AFIEA is compared with six state-of-the-art SAMaOEAs on artificial benchmark problems and one real-world expensive optimization problem within a limited budget. In the benchmark tests, AFIEA outperforms the six advanced SAMaOEAs across most of the test functions, demonstrating that the proposed mechanism offers strong generality and enhanced search performance. Additionally, in the optimization of electromagnetic devices, AFIEA achieves superior population quality in a shorter time with a limited number of simulations.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101988"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Archive assisted fully informed evolutionary algorithm for expensive many-objective optimization\",\"authors\":\"Jie Lin , Sheng Xin Zhang , Shao Yong Zheng , Kwai Man Luk\",\"doi\":\"10.1016/j.swevo.2025.101988\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In many real-world engineering and scientific optimization scenarios, practitioners often face expensive many-objective optimization problems where evaluating candidate solutions incurs prohibitive computational costs. The inherent scarcity of truly calculated data often leads to the construction of models with high uncertainty using limited datasets. This uncertainty can adversely affect the Surrogate-assisted Many-Objective Evolutionary Algorithms (SAMaOEAs). To address this issue and enhance performance, this paper introduces an Archive-assisted Fully Informed Evolutionary Algorithm (AFIEA). In AFIEA, two kinds of models are constructed from archive data to simultaneously predict objective values and uncertainty trends (whether the predictions are overestimated or underestimated). With this foundation, both the optimizer and infill criterion processes are fully guided by the predicted objective values and uncertainty trends. In the optimization phase, a novel Uncertainty Trend Classification (UTC)-based Upper Confidence Bound is employed as the acquisition function. During the infill criterion phase, UTC is used to preprocess the population, enhancing the selection probability of under-estimated solutions, while an archive-based metric selects more precise solutions, guided by the archive in terms of convergence and diversity. The performance of AFIEA is compared with six state-of-the-art SAMaOEAs on artificial benchmark problems and one real-world expensive optimization problem within a limited budget. In the benchmark tests, AFIEA outperforms the six advanced SAMaOEAs across most of the test functions, demonstrating that the proposed mechanism offers strong generality and enhanced search performance. Additionally, in the optimization of electromagnetic devices, AFIEA achieves superior population quality in a shorter time with a limited number of simulations.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"96 \",\"pages\":\"Article 101988\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-05-30\",\"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/S2210650225001464\",\"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/S2210650225001464","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Archive assisted fully informed evolutionary algorithm for expensive many-objective optimization
In many real-world engineering and scientific optimization scenarios, practitioners often face expensive many-objective optimization problems where evaluating candidate solutions incurs prohibitive computational costs. The inherent scarcity of truly calculated data often leads to the construction of models with high uncertainty using limited datasets. This uncertainty can adversely affect the Surrogate-assisted Many-Objective Evolutionary Algorithms (SAMaOEAs). To address this issue and enhance performance, this paper introduces an Archive-assisted Fully Informed Evolutionary Algorithm (AFIEA). In AFIEA, two kinds of models are constructed from archive data to simultaneously predict objective values and uncertainty trends (whether the predictions are overestimated or underestimated). With this foundation, both the optimizer and infill criterion processes are fully guided by the predicted objective values and uncertainty trends. In the optimization phase, a novel Uncertainty Trend Classification (UTC)-based Upper Confidence Bound is employed as the acquisition function. During the infill criterion phase, UTC is used to preprocess the population, enhancing the selection probability of under-estimated solutions, while an archive-based metric selects more precise solutions, guided by the archive in terms of convergence and diversity. The performance of AFIEA is compared with six state-of-the-art SAMaOEAs on artificial benchmark problems and one real-world expensive optimization problem within a limited budget. In the benchmark tests, AFIEA outperforms the six advanced SAMaOEAs across most of the test functions, demonstrating that the proposed mechanism offers strong generality and enhanced search performance. Additionally, in the optimization of electromagnetic devices, AFIEA achieves superior population quality in a shorter time with a limited number of simulations.
期刊介绍:
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.