Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front

Wenjie Wang, Pengyu Wang, Jiawei Yang, Fei Xiao, Weihua Zhang, Zeping Wu
{"title":"Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front","authors":"Wenjie Wang, Pengyu Wang, Jiawei Yang, Fei Xiao, Weihua Zhang, Zeping Wu","doi":"10.1080/10556788.2022.2091560","DOIUrl":null,"url":null,"abstract":"Sequential Approximate Optimization (SAO) has been widely used in engineering optimization design problems to improve efficiency. The infilling strategy is one of the critical techniques of the SAO, which is of paramount importance to the surrogate model accuracy and optimization efficiency. In this paper, an adaptive parallel infill strategy for surrogate-based single-objective optimization is proposed within a multi-objective optimization framework to balance exploration and exploitation during the optimization process. Within this method, an inaccurate Pareto Front is adopted to assist the infilling of the sampling points. The proposed SAO method with its adaptive parallel sampling strategy is tested on several numerical test cases and an engineering test case with the optimization results compared to state-of-the-art optimization algorithms. The results show that the proposed SAO with the adaptive parallel sampling strategy possesses excellent performance and better stability.","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"194 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods and Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10556788.2022.2091560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Sequential Approximate Optimization (SAO) has been widely used in engineering optimization design problems to improve efficiency. The infilling strategy is one of the critical techniques of the SAO, which is of paramount importance to the surrogate model accuracy and optimization efficiency. In this paper, an adaptive parallel infill strategy for surrogate-based single-objective optimization is proposed within a multi-objective optimization framework to balance exploration and exploitation during the optimization process. Within this method, an inaccurate Pareto Front is adopted to assist the infilling of the sampling points. The proposed SAO method with its adaptive parallel sampling strategy is tested on several numerical test cases and an engineering test case with the optimization results compared to state-of-the-art optimization algorithms. The results show that the proposed SAO with the adaptive parallel sampling strategy possesses excellent performance and better stability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于不准确Pareto前沿的自适应并行填充策略序列逼近优化
序贯近似优化(SAO)方法已广泛应用于工程优化设计问题中,以提高效率。填充策略是SAO的关键技术之一,对代理模型的精度和优化效率至关重要。本文在多目标优化框架下,提出了一种基于代理的单目标优化自适应并行填充策略,以平衡优化过程中的勘探与开采。该方法利用不准确的Pareto Front辅助采样点的填充。基于自适应并行采样策略的SAO方法在多个数值测试例和工程测试例上进行了测试,并将优化结果与现有优化算法进行了比较。结果表明,采用自适应并行采样策略的SAO具有优异的性能和良好的稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Maximizing the number of rides served for time-limited Dial-a-Ride* A family of limited memory three term conjugate gradient methods A semismooth conjugate gradients method – theoretical analysis A mixed-integer programming formulation for optimizing the double row layout problem Robust reverse 1-center problems on trees with interval costs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1