针对多层次任务提出的超神经优化算法 Nesting Grey Wolf Optimizer 和 COOT 算法

Afrah U. Mosaa, W. Al-Jawher
{"title":"针对多层次任务提出的超神经优化算法 Nesting Grey Wolf Optimizer 和 COOT 算法","authors":"Afrah U. Mosaa, W. Al-Jawher","doi":"10.36371/port.2023.4.1","DOIUrl":null,"url":null,"abstract":"It can be extremely difficult to find the optimal solution in many complex optimization problems. The goal of optimization algorithms in such cases is to locate a feasible solution that is as close as possible to the optimal one. These algorithms are called metaheuristic optimization algorithms and the majority of them take their inspiration from nature and work to solve challenging problems in a variety of fields. In this paper, a combination between GWO and Coot algorithm was proposed. The effectiveness of the GWO algorithm has been demonstrated in many fields, including engineering and medicine. However, GWO has a disadvantage: the potential to enter the local minima due to a lack of diversity. GWO and the Coot algorithm were merged to fix this flaw. Ten benchmark functions were used to evaluate the performance of this hybrid technique, and its results were compared to those of other common optimization algorithms, including GWO, Cuckoo Search (CS), and the Shuffled Frog Leaping algorithm (SFLA). The results show that the suggested algorithm can provide results that are both competitive and more consistent than the other algorithms in most test functions.","PeriodicalId":502904,"journal":{"name":"Journal Port Science Research","volume":"29 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A proposed Hyper-Heuristic optimizer Nesting Grey Wolf Optimizer and COOT Algorithm for Multilevel Task\",\"authors\":\"Afrah U. Mosaa, W. Al-Jawher\",\"doi\":\"10.36371/port.2023.4.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It can be extremely difficult to find the optimal solution in many complex optimization problems. The goal of optimization algorithms in such cases is to locate a feasible solution that is as close as possible to the optimal one. These algorithms are called metaheuristic optimization algorithms and the majority of them take their inspiration from nature and work to solve challenging problems in a variety of fields. In this paper, a combination between GWO and Coot algorithm was proposed. The effectiveness of the GWO algorithm has been demonstrated in many fields, including engineering and medicine. However, GWO has a disadvantage: the potential to enter the local minima due to a lack of diversity. GWO and the Coot algorithm were merged to fix this flaw. Ten benchmark functions were used to evaluate the performance of this hybrid technique, and its results were compared to those of other common optimization algorithms, including GWO, Cuckoo Search (CS), and the Shuffled Frog Leaping algorithm (SFLA). The results show that the suggested algorithm can provide results that are both competitive and more consistent than the other algorithms in most test functions.\",\"PeriodicalId\":502904,\"journal\":{\"name\":\"Journal Port Science Research\",\"volume\":\"29 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal Port Science Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36371/port.2023.4.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal Port Science Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36371/port.2023.4.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在许多复杂的优化问题中,找到最优解可能极其困难。在这种情况下,优化算法的目标就是找到一个尽可能接近最优解的可行解。这些算法被称为元启发式优化算法,它们大多从大自然中汲取灵感,致力于解决各种领域中的挑战性问题。本文提出了 GWO 算法和 Coot 算法的组合。GWO 算法的有效性已在工程和医学等多个领域得到证实。然而,GWO 也有缺点:由于缺乏多样性,可能会进入局部最小值。为了弥补这一缺陷,GWO 和 Coot 算法进行了合并。我们使用了十个基准函数来评估这种混合技术的性能,并将其结果与其他常见优化算法(包括 GWO、布谷鸟搜索(CS)和洗牌蛙跳算法(SFLA))的结果进行了比较。结果表明,在大多数测试功能中,建议的算法都能提供比其他算法更有竞争力和更一致的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A proposed Hyper-Heuristic optimizer Nesting Grey Wolf Optimizer and COOT Algorithm for Multilevel Task
It can be extremely difficult to find the optimal solution in many complex optimization problems. The goal of optimization algorithms in such cases is to locate a feasible solution that is as close as possible to the optimal one. These algorithms are called metaheuristic optimization algorithms and the majority of them take their inspiration from nature and work to solve challenging problems in a variety of fields. In this paper, a combination between GWO and Coot algorithm was proposed. The effectiveness of the GWO algorithm has been demonstrated in many fields, including engineering and medicine. However, GWO has a disadvantage: the potential to enter the local minima due to a lack of diversity. GWO and the Coot algorithm were merged to fix this flaw. Ten benchmark functions were used to evaluate the performance of this hybrid technique, and its results were compared to those of other common optimization algorithms, including GWO, Cuckoo Search (CS), and the Shuffled Frog Leaping algorithm (SFLA). The results show that the suggested algorithm can provide results that are both competitive and more consistent than the other algorithms in most test functions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信