一种高效的历史导向代理模型辅助小生境进化算法用于昂贵的多模态优化

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Ting Huang , Bing-Bing Niu , Yue-Jiao Gong , Jing Liu
{"title":"一种高效的历史导向代理模型辅助小生境进化算法用于昂贵的多模态优化","authors":"Ting Huang ,&nbsp;Bing-Bing Niu ,&nbsp;Yue-Jiao Gong ,&nbsp;Jing Liu","doi":"10.1016/j.swevo.2025.101906","DOIUrl":null,"url":null,"abstract":"<div><div>This work addresses the challenge of multimodal optimization, aiming to identify multiple optimal solutions in costly and time-consuming evaluation scenarios, known as expensive multimodal optimization problems (EMMOPs). Existing methods that adopt surrogate models to approximate costly evaluations with challenges, such as high costs of constructing training sets, inaccurate optima detection, and difficulties balancing exploration and exploitation in multimodal landscapes. To address these issues, we propose an efficient Binary Space Partitioning (BSP)-based surrogate models (SMs)-assisted niching evolutionary algorithm (NEA), termed BSP-SMs-NEA. The BSP tree provides a structured method for storing and retrieving historical information, enabling efficient construction of training sets for SMs. The SMs are then adaptively constructed and updated across niches to maintain high accuracy. Furthermore, BSP-SMs assist the NEA in selective evolution, optimizing resource utilization while balancing exploration and exploitation. Compared with 11 existing methods on EMMOP benchmark, BSP-SMs-NEA demonstrates superior performance, achieving the best precision on 80% of test functions, along with the top success rate and statistical results of the best fitness value across all test functions.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"95 ","pages":"Article 101906"},"PeriodicalIF":8.2000,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient history-guided surrogate models-assisted niching evolutionary algorithm for expensive multimodal optimization\",\"authors\":\"Ting Huang ,&nbsp;Bing-Bing Niu ,&nbsp;Yue-Jiao Gong ,&nbsp;Jing Liu\",\"doi\":\"10.1016/j.swevo.2025.101906\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This work addresses the challenge of multimodal optimization, aiming to identify multiple optimal solutions in costly and time-consuming evaluation scenarios, known as expensive multimodal optimization problems (EMMOPs). Existing methods that adopt surrogate models to approximate costly evaluations with challenges, such as high costs of constructing training sets, inaccurate optima detection, and difficulties balancing exploration and exploitation in multimodal landscapes. To address these issues, we propose an efficient Binary Space Partitioning (BSP)-based surrogate models (SMs)-assisted niching evolutionary algorithm (NEA), termed BSP-SMs-NEA. The BSP tree provides a structured method for storing and retrieving historical information, enabling efficient construction of training sets for SMs. The SMs are then adaptively constructed and updated across niches to maintain high accuracy. Furthermore, BSP-SMs assist the NEA in selective evolution, optimizing resource utilization while balancing exploration and exploitation. Compared with 11 existing methods on EMMOP benchmark, BSP-SMs-NEA demonstrates superior performance, achieving the best precision on 80% of test functions, along with the top success rate and statistical results of the best fitness value across all test functions.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"95 \",\"pages\":\"Article 101906\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-03-18\",\"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/S2210650225000641\",\"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/S2210650225000641","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

这项工作解决了多模态优化的挑战,旨在识别成本高且耗时的评估场景中的多个最优解决方案,称为昂贵的多模态优化问题(EMMOPs)。现有的方法采用替代模型来近似昂贵的评估,但存在一些挑战,如构建训练集的成本高,最优检测不准确,以及在多模式景观中难以平衡勘探和开发。为了解决这些问题,我们提出了一种高效的基于二进制空间划分(BSP)的代理模型(SMs)辅助小生境进化算法(NEA),称为BSP-SMs-NEA。BSP树提供了一种结构化的方法来存储和检索历史信息,从而实现了SMs训练集的高效构建。然后自适应地构建和更新SMs,以保持高准确性。此外,BSP-SMs有助于NEA的选择性进化,在平衡勘探和开发的同时优化资源利用。与现有的11种EMMOP基准方法相比,BSP-SMs-NEA在80%的测试函数上达到了最佳精度,并且在所有测试函数上获得了最佳适应度值的最高成功率和统计结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient history-guided surrogate models-assisted niching evolutionary algorithm for expensive multimodal optimization
This work addresses the challenge of multimodal optimization, aiming to identify multiple optimal solutions in costly and time-consuming evaluation scenarios, known as expensive multimodal optimization problems (EMMOPs). Existing methods that adopt surrogate models to approximate costly evaluations with challenges, such as high costs of constructing training sets, inaccurate optima detection, and difficulties balancing exploration and exploitation in multimodal landscapes. To address these issues, we propose an efficient Binary Space Partitioning (BSP)-based surrogate models (SMs)-assisted niching evolutionary algorithm (NEA), termed BSP-SMs-NEA. The BSP tree provides a structured method for storing and retrieving historical information, enabling efficient construction of training sets for SMs. The SMs are then adaptively constructed and updated across niches to maintain high accuracy. Furthermore, BSP-SMs assist the NEA in selective evolution, optimizing resource utilization while balancing exploration and exploitation. Compared with 11 existing methods on EMMOP benchmark, BSP-SMs-NEA demonstrates superior performance, achieving the best precision on 80% of test functions, along with the top success rate and statistical results of the best fitness value across all test functions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信