Improved Harris's Hawk Multi-objective Optimizer Using Two-steps Initial Population Generation Method

S. Yasear, K. Ku-Mahamud
{"title":"Improved Harris's Hawk Multi-objective Optimizer Using Two-steps Initial Population Generation Method","authors":"S. Yasear, K. Ku-Mahamud","doi":"10.1109/AICT47866.2019.8981748","DOIUrl":null,"url":null,"abstract":"The population of hawks in the Harris's hawk multi-objective optimizer (HHMO) algorithm is generated using uniform distribution random number. This method does not guarantee that the solutions can be evenly distributed in the search space of the problem, which may affect the efficiency of the algorithm. Therefore, to improve the performance of HHMO algorithm, two-steps initial population generation method is proposed. This method is developed based on R-sequence and partial opposition-based learning, which is employed to generate an initial population of hawks, with the aim to achieve better initial population. Thus better convergence toward Pareto front will be obtained. The performance of the proposed improved HHMO algorithm is evaluated using a set of well-known multi-objective optimization problems. The results of numerical simulation experiment demonstrate the effectiveness of the proposed two-step initial population generation method and showed superiority of the improved HHMO algorithm compares to the HHMO. The improved HHMO can be used to improve the convergence towards the true Pareto frontier.","PeriodicalId":329473,"journal":{"name":"2019 IEEE 13th International Conference on Application of Information and Communication Technologies (AICT)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 13th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT47866.2019.8981748","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The population of hawks in the Harris's hawk multi-objective optimizer (HHMO) algorithm is generated using uniform distribution random number. This method does not guarantee that the solutions can be evenly distributed in the search space of the problem, which may affect the efficiency of the algorithm. Therefore, to improve the performance of HHMO algorithm, two-steps initial population generation method is proposed. This method is developed based on R-sequence and partial opposition-based learning, which is employed to generate an initial population of hawks, with the aim to achieve better initial population. Thus better convergence toward Pareto front will be obtained. The performance of the proposed improved HHMO algorithm is evaluated using a set of well-known multi-objective optimization problems. The results of numerical simulation experiment demonstrate the effectiveness of the proposed two-step initial population generation method and showed superiority of the improved HHMO algorithm compares to the HHMO. The improved HHMO can be used to improve the convergence towards the true Pareto frontier.
用两步初始种群生成法改进Harris Hawk多目标优化器
Harris鹰多目标优化算法采用均匀分布随机数生成鹰种群。该方法不能保证解在问题的搜索空间中均匀分布,可能会影响算法的效率。因此,为了提高HHMO算法的性能,提出了两步初始种群生成方法。该方法是基于r序列和部分对立学习的方法,用于生成鹰的初始种群,以获得更好的初始种群。从而获得较好的向帕累托前沿收敛。利用一组著名的多目标优化问题对改进的HHMO算法的性能进行了评价。数值模拟实验结果证明了所提出的两步初始种群生成方法的有效性,并显示了改进的HHMO算法相对于HHMO算法的优越性。改进的HHMO可用于改进向真帕累托边界的收敛性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信