深度强化学习辅助代理模型管理的昂贵约束多目标优化

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Shuai Shao, Ye Tian, Yajie Zhang
{"title":"深度强化学习辅助代理模型管理的昂贵约束多目标优化","authors":"Shuai Shao,&nbsp;Ye Tian,&nbsp;Yajie Zhang","doi":"10.1016/j.swevo.2024.101817","DOIUrl":null,"url":null,"abstract":"<div><div>Expensive constrained multi-objective optimization problems (ECMOPs) exist in a wide variety of applications from industrial processes to engineering systems. When solving ECMOPs, with only a limited number of function evaluations available, a common approach is to substitute the real function evaluations with more affordable evaluations provided by computationally efficient surrogate models. However, existing surrogate assisted evolutionary algorithms (SAEAs) exhibit poor versatility in handling various ECMOPs, as they only use a constant surrogate modeling scheme or switch the modeling schemes with expert knowledge. To address the dilemma in surrogate modeling, this paper proposes a deep reinforcement learning assisted evolutionary algorithm, which operates on two key issues. First, multiple surrogate models are employed to learn the approximate function of an ECMOP using previously evaluated solutions during the evolutionary process. Second, a deep reinforcement learning method is employed to learn the optimal surrogate model management strategy based on evolutionary experience, selecting the most suitable surrogate modeling scheme for the current generation. Experimental evaluations on a large number of expensive problems demonstrate that the proposed algorithm has a significant effect compared with state-of-the-art competitors.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"92 ","pages":"Article 101817"},"PeriodicalIF":8.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Deep reinforcement learning assisted surrogate model management for expensive constrained multi-objective optimization\",\"authors\":\"Shuai Shao,&nbsp;Ye Tian,&nbsp;Yajie Zhang\",\"doi\":\"10.1016/j.swevo.2024.101817\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Expensive constrained multi-objective optimization problems (ECMOPs) exist in a wide variety of applications from industrial processes to engineering systems. When solving ECMOPs, with only a limited number of function evaluations available, a common approach is to substitute the real function evaluations with more affordable evaluations provided by computationally efficient surrogate models. However, existing surrogate assisted evolutionary algorithms (SAEAs) exhibit poor versatility in handling various ECMOPs, as they only use a constant surrogate modeling scheme or switch the modeling schemes with expert knowledge. To address the dilemma in surrogate modeling, this paper proposes a deep reinforcement learning assisted evolutionary algorithm, which operates on two key issues. First, multiple surrogate models are employed to learn the approximate function of an ECMOP using previously evaluated solutions during the evolutionary process. Second, a deep reinforcement learning method is employed to learn the optimal surrogate model management strategy based on evolutionary experience, selecting the most suitable surrogate modeling scheme for the current generation. Experimental evaluations on a large number of expensive problems demonstrate that the proposed algorithm has a significant effect compared with state-of-the-art competitors.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"92 \",\"pages\":\"Article 101817\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-02-01\",\"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/S2210650224003559\",\"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/S2210650224003559","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

昂贵约束多目标优化问题(ECMOPs)存在于从工业过程到工程系统的各种应用中。在求解ECMOPs时,只有有限数量的函数评估可用,一种常见的方法是用计算效率高的代理模型提供的更实惠的评估来替代实际的函数评估。然而,现有的代理辅助进化算法(saea)在处理各种ECMOPs方面表现出较差的通用性,因为它们只使用恒定的代理建模方案或使用专家知识切换建模方案。为了解决代理建模中的困境,本文提出了一种深度强化学习辅助进化算法,该算法主要解决两个关键问题。首先,使用多个代理模型来学习ECMOP在进化过程中使用先前评估的解决方案的近似函数。其次,采用深度强化学习方法,学习基于进化经验的最优代理模型管理策略,选择最适合当前代的代理建模方案;对大量昂贵问题的实验评估表明,与最先进的竞争对手相比,该算法具有显著的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Deep reinforcement learning assisted surrogate model management for expensive constrained multi-objective optimization
Expensive constrained multi-objective optimization problems (ECMOPs) exist in a wide variety of applications from industrial processes to engineering systems. When solving ECMOPs, with only a limited number of function evaluations available, a common approach is to substitute the real function evaluations with more affordable evaluations provided by computationally efficient surrogate models. However, existing surrogate assisted evolutionary algorithms (SAEAs) exhibit poor versatility in handling various ECMOPs, as they only use a constant surrogate modeling scheme or switch the modeling schemes with expert knowledge. To address the dilemma in surrogate modeling, this paper proposes a deep reinforcement learning assisted evolutionary algorithm, which operates on two key issues. First, multiple surrogate models are employed to learn the approximate function of an ECMOP using previously evaluated solutions during the evolutionary process. Second, a deep reinforcement learning method is employed to learn the optimal surrogate model management strategy based on evolutionary experience, selecting the most suitable surrogate modeling scheme for the current generation. Experimental evaluations on a large number of expensive problems demonstrate that the proposed algorithm has a significant effect compared with state-of-the-art competitors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信