Data Stream driven evolutionary algorithm for cost sensitive robust optimization over time

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2025-02-17 DOI:10.1016/j.swevo.2025.101880
Zhening Liu , Handing Wang , Jinliang Ding , Cuie Yang , Yaochu Jin
{"title":"Data Stream driven evolutionary algorithm for cost sensitive robust optimization over time","authors":"Zhening Liu ,&nbsp;Handing Wang ,&nbsp;Jinliang Ding ,&nbsp;Cuie Yang ,&nbsp;Yaochu Jin","doi":"10.1016/j.swevo.2025.101880","DOIUrl":null,"url":null,"abstract":"<div><div>Many dynamic optimization problems in real-world domains like engineering and management science require considerations of robustness, where a balance between tracking optimal solutions in changing environments and managing costs of switching solutions is needed. However, in some cases, the objective functions are not analytically available and must be approximated based on data collected from numerical simulations or experiments. These dynamic problems are formulated as data stream driven robust optimization over time (DDROOT<span><math><msub><mrow></mrow><mrow><mi>G</mi></mrow></msub></math></span>) problems, which cannot be satisfactorily addressed by existing dynamic optimization algorithms. Therefore, we propose a data stream driven multi-form evolutionary algorithm (DDMFEA), employing two separate Kriging models to approximate the unavailable objective function and the computationally expensive robustness estimation, respectively. In the proposed algorithm, DDROOT<span><math><msub><mrow></mrow><mrow><mi>G</mi></mrow></msub></math></span> problems are addressed with two distinct formulations with single- and multi-objectives. These formulations are utilized as a multi-form optimization process to mitigate the impact of approximation errors from both Kriging models. In addition, a novel solution selection mechanism is designed to consider both robustness and predicted objective values, facilitating the deployment of the optimal robust solution. Throughout the experiment, four robust comparison algorithms are employed to assess the performance of the proposed DDMFEA across various problems in different decision dimensions. The experimental results validate the significance of each proposed contribution and demonstrate the exceptional performance of DDMFEA.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"94 ","pages":"Article 101880"},"PeriodicalIF":8.2000,"publicationDate":"2025-02-17","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/S2210650225000380","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Many dynamic optimization problems in real-world domains like engineering and management science require considerations of robustness, where a balance between tracking optimal solutions in changing environments and managing costs of switching solutions is needed. However, in some cases, the objective functions are not analytically available and must be approximated based on data collected from numerical simulations or experiments. These dynamic problems are formulated as data stream driven robust optimization over time (DDROOTG) problems, which cannot be satisfactorily addressed by existing dynamic optimization algorithms. Therefore, we propose a data stream driven multi-form evolutionary algorithm (DDMFEA), employing two separate Kriging models to approximate the unavailable objective function and the computationally expensive robustness estimation, respectively. In the proposed algorithm, DDROOTG problems are addressed with two distinct formulations with single- and multi-objectives. These formulations are utilized as a multi-form optimization process to mitigate the impact of approximation errors from both Kriging models. In addition, a novel solution selection mechanism is designed to consider both robustness and predicted objective values, facilitating the deployment of the optimal robust solution. Throughout the experiment, four robust comparison algorithms are employed to assess the performance of the proposed DDMFEA across various problems in different decision dimensions. The experimental results validate the significance of each proposed contribution and demonstrate the exceptional performance of DDMFEA.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Constrained multi-objective particle swarm optimization for bistatic RFID network planning with distributed antennas Novel MINLP model and Lamarckian learning-enhanced multi-objective optimization algorithm for smart household appliance scheduling Solving sparse multi-objective optimization problems via dynamic adaptive grouping and reward-penalty sparse strategies Strengthened grey wolf optimization algorithms for numerical optimization tasks and AutoML Data Stream driven evolutionary algorithm for cost sensitive robust optimization over time
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1