Reference Points Generated on Unit Hypersurfaces for MaOEAs

Haruto Takeuchi, Md. Kawsar Khan, M. Ohki
{"title":"Reference Points Generated on Unit Hypersurfaces for MaOEAs","authors":"Haruto Takeuchi, Md. Kawsar Khan, M. Ohki","doi":"10.1109/3ICT53449.2021.9581958","DOIUrl":null,"url":null,"abstract":"This paper proposes a method to uniformly generate reference points on a hypersurface for many-objective optimization evolutionary algorithms (MaOEAs). Recently, MaOEAs have been proposed to obtain selection pressure in a multidimensional objective space by using a reference point set, but there is no method for generating a reference point set that is supposed to incorporate user orientation. This paper proposes a method for generating uniform reference points on unit hyperspheres and unit hyperplanes in a multidimensional objective space. The proposed method is applied to the multi-objective genetic programming (GP) problem by non-dominated sorting genetic algorithm-III (NSGA-III) and to the multi-objective combinatorial optimization problem by multiobjective evolutionary algorithm based on decomposition (MOEA/D). As a result, we confirm that the proposed method gives non-inferior results compared to conventional methods. Since the proposed method can easily incorporate user orientation, this shows the effectiveness of the proposed method.","PeriodicalId":133021,"journal":{"name":"2021 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3ICT53449.2021.9581958","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a method to uniformly generate reference points on a hypersurface for many-objective optimization evolutionary algorithms (MaOEAs). Recently, MaOEAs have been proposed to obtain selection pressure in a multidimensional objective space by using a reference point set, but there is no method for generating a reference point set that is supposed to incorporate user orientation. This paper proposes a method for generating uniform reference points on unit hyperspheres and unit hyperplanes in a multidimensional objective space. The proposed method is applied to the multi-objective genetic programming (GP) problem by non-dominated sorting genetic algorithm-III (NSGA-III) and to the multi-objective combinatorial optimization problem by multiobjective evolutionary algorithm based on decomposition (MOEA/D). As a result, we confirm that the proposed method gives non-inferior results compared to conventional methods. Since the proposed method can easily incorporate user orientation, this shows the effectiveness of the proposed method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
单元超曲面上生成的参考点
提出了一种多目标优化进化算法在超曲面上统一生成参考点的方法。最近,人们提出了利用参考点集来获得多维目标空间中的选择压力的maoea方法,但是没有一种方法可以生成包含用户取向的参考点集。提出了一种多维目标空间中单位超球和单位超平面上均匀参考点的生成方法。采用非支配排序遗传算法(NSGA-III)求解多目标遗传规划(GP)问题,采用基于分解的多目标进化算法(MOEA/D)求解多目标组合优化问题。结果表明,与传统方法相比,该方法的结果不差。由于所提出的方法可以很容易地结合用户导向,这表明了所提出方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Securing SCADA Systems against Cyber-Attacks using Artificial Intelligence Quality of Life Integrated Framework: Perspective of Cloud Computing Usage Reference Points Generated on Unit Hypersurfaces for MaOEAs Eye-Tracking Analysis with Deep Learning Method An Implementation and Evaluation of Basic Data Storage Topic for Content Provider Stage in Android Programming Learning Assistance System
×
引用
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