A dynamic selection strategy for classification based surrogate-assisted multi-objective evolutionary algorithms

D. N. Duc, Long Nguyen, H. N. Thanh
{"title":"A dynamic selection strategy for classification based surrogate-assisted multi-objective evolutionary algorithms","authors":"D. N. Duc, Long Nguyen, H. N. Thanh","doi":"10.1109/ICICT52872.2021.00016","DOIUrl":null,"url":null,"abstract":"Multi-objective problems (MOPs) consist of at least two objectives and they conflict with each other. A class of expensive problems is one of multi-objective problem class, that requires high costs for large calculations, large space, and large number of objectives. The useful and popular method for expensive problems is the use of surrogate models. There are many techniques used in surrogate models, such as RBF, PRS, Kriging, SVM, ANN…, that are used and achieve relatively good results. One problem, however, is the choice of time to update the model, the selection of reference data… Those actions are very important in an evolutionary process. The parameters for control those action usually predefined, so it might reduces the adaptability of algorithms. In this paper, we analyze a dynamic selection method of reference solutions based on information from the population, the evolution process to produce better results, with each different problem.","PeriodicalId":359456,"journal":{"name":"2021 4th International Conference on Information and Computer Technologies (ICICT)","volume":"86 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 4th International Conference on Information and Computer Technologies (ICICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT52872.2021.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-objective problems (MOPs) consist of at least two objectives and they conflict with each other. A class of expensive problems is one of multi-objective problem class, that requires high costs for large calculations, large space, and large number of objectives. The useful and popular method for expensive problems is the use of surrogate models. There are many techniques used in surrogate models, such as RBF, PRS, Kriging, SVM, ANN…, that are used and achieve relatively good results. One problem, however, is the choice of time to update the model, the selection of reference data… Those actions are very important in an evolutionary process. The parameters for control those action usually predefined, so it might reduces the adaptability of algorithms. In this paper, we analyze a dynamic selection method of reference solutions based on information from the population, the evolution process to produce better results, with each different problem.
基于分类的代理辅助多目标进化算法的动态选择策略
多目标问题由至少两个相互冲突的目标组成。一类昂贵问题是多目标问题的一种,由于计算量大、空间大、目标数多,对成本要求很高。对于昂贵的问题,有用且流行的方法是使用代理模型。在代理模型中使用了许多技术,如RBF、PRS、Kriging、SVM、ANN等,并取得了相对较好的效果。然而,一个问题是更新模型的时间选择,参考数据的选择……这些动作在进化过程中非常重要。控制这些动作的参数通常是预定义的,这可能会降低算法的适应性。在本文中,我们分析了一种基于种群信息的参考解的动态选择方法,在进化过程中产生更好的结果,与每个不同的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信