基于档案辅助的全信息进化算法的昂贵多目标优化

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jie Lin , Sheng Xin Zhang , Shao Yong Zheng , Kwai Man Luk
{"title":"基于档案辅助的全信息进化算法的昂贵多目标优化","authors":"Jie Lin ,&nbsp;Sheng Xin Zhang ,&nbsp;Shao Yong Zheng ,&nbsp;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 ,&nbsp;Sheng Xin Zhang ,&nbsp;Shao Yong Zheng ,&nbsp;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}
引用次数: 0

摘要

在许多现实世界的工程和科学优化场景中,从业者经常面临昂贵的多目标优化问题,其中评估候选解决方案会产生令人望而却步的计算成本。真实计算数据的固有稀缺性往往导致使用有限的数据集构建具有高不确定性的模型。这种不确定性会对代理辅助多目标进化算法(samaoea)产生不利影响。为了解决这一问题并提高性能,本文引入了一种档案辅助的完全知情进化算法(AFIEA)。在AFIEA中,从档案数据构建两种模型,同时预测客观值和不确定性趋势(预测是高估还是低估)。在此基础上,优化过程和充填判据过程都充分以预测的目标值和不确定性趋势为指导。在优化阶段,采用一种新的基于不确定性趋势分类(UTC)的上置信度作为获取函数。在填充准则阶段,使用UTC对种群进行预处理,提高了低估解的选择概率,而基于档案的度量则在档案的收敛性和多样性的指导下选择更精确的解。将AFIEA的性能与六个最先进的samaoea在人工基准问题和一个有限预算的昂贵的现实优化问题上进行了比较。在基准测试中,AFIEA在大多数测试功能上都优于六个高级samaoea,这表明所提出的机制具有很强的通用性和增强的搜索性能。此外,在电磁器件的优化方面,AFIEA在有限的模拟次数下,在较短的时间内实现了优越的种群质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信