利用极乐点增强基于方向的多目标算法

Minh Tran Binh, Long Nguyen, D. N. Duc
{"title":"利用极乐点增强基于方向的多目标算法","authors":"Minh Tran Binh, Long Nguyen, D. N. Duc","doi":"10.1109/KSE56063.2022.9953747","DOIUrl":null,"url":null,"abstract":"Using improvement direction to control the evolution of multi-objective optimization algorithms is an interesting and effective method. Improvement direction techniques often evaluate the geometric properties of the solution set in the objective space and based on that to adjusting the evolutionary process to ensure it is capable of exploration and exploitation. The direction of improvement is usually determined based on the convergent and diverse nature of the solution population, in fact, the distribution of the solution population can suggest an online adjustment of the evolutionary process to overcome the problem of keeping the balance between convergence and diversity. In this study, we identify empty regions in the solution population and use the centers of those areas, which we call bliss points, to direct and adjust the algorithms which use improvement direction to enhance the quality of the algorithms. Experimental results have shown competitive results, promising to apply to multi-objective evolutionary algorithms using other geometric techniques.","PeriodicalId":330865,"journal":{"name":"2022 14th International Conference on Knowledge and Systems Engineering (KSE)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using bliss points to enhance direction based multi-objective algorithms\",\"authors\":\"Minh Tran Binh, Long Nguyen, D. N. Duc\",\"doi\":\"10.1109/KSE56063.2022.9953747\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Using improvement direction to control the evolution of multi-objective optimization algorithms is an interesting and effective method. Improvement direction techniques often evaluate the geometric properties of the solution set in the objective space and based on that to adjusting the evolutionary process to ensure it is capable of exploration and exploitation. The direction of improvement is usually determined based on the convergent and diverse nature of the solution population, in fact, the distribution of the solution population can suggest an online adjustment of the evolutionary process to overcome the problem of keeping the balance between convergence and diversity. In this study, we identify empty regions in the solution population and use the centers of those areas, which we call bliss points, to direct and adjust the algorithms which use improvement direction to enhance the quality of the algorithms. Experimental results have shown competitive results, promising to apply to multi-objective evolutionary algorithms using other geometric techniques.\",\"PeriodicalId\":330865,\"journal\":{\"name\":\"2022 14th International Conference on Knowledge and Systems Engineering (KSE)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 14th International Conference on Knowledge and Systems Engineering (KSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KSE56063.2022.9953747\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 14th International Conference on Knowledge and Systems Engineering (KSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE56063.2022.9953747","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

利用改进方向来控制多目标优化算法的演化是一种有趣而有效的方法。改进方向技术通常评估解集在目标空间中的几何性质,并以此为基础调整演化过程,以确保其能够被探索和利用。改进的方向通常是根据解群的收敛性和多样性来确定的,实际上,解群的分布可以提示进化过程的在线调整,以克服保持收敛性和多样性之间的平衡的问题。在本研究中,我们识别解群中的空白区域,并使用这些区域的中心,我们称之为极乐点,来指导和调整使用改进方向的算法,以提高算法的质量。实验结果显示了具有竞争力的结果,有望应用于使用其他几何技术的多目标进化算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Using bliss points to enhance direction based multi-objective algorithms
Using improvement direction to control the evolution of multi-objective optimization algorithms is an interesting and effective method. Improvement direction techniques often evaluate the geometric properties of the solution set in the objective space and based on that to adjusting the evolutionary process to ensure it is capable of exploration and exploitation. The direction of improvement is usually determined based on the convergent and diverse nature of the solution population, in fact, the distribution of the solution population can suggest an online adjustment of the evolutionary process to overcome the problem of keeping the balance between convergence and diversity. In this study, we identify empty regions in the solution population and use the centers of those areas, which we call bliss points, to direct and adjust the algorithms which use improvement direction to enhance the quality of the algorithms. Experimental results have shown competitive results, promising to apply to multi-objective evolutionary algorithms using other geometric techniques.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
DWEN: A novel method for accurate estimation of cell type compositions from bulk data samples Polygenic risk scores adaptation for Height in a Vietnamese population Sentiment Classification for Beauty-fashion Reviews An Automated Stub Method for Unit Testing C/C++ Projects Knowledge-based Problem Solving and Reasoning methods
×
引用
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