一种基于引力和球面搜索动力学的优化算法

Zhentao Tang, Kaiyu Wang, Jiarui Shi, Sichen Tao, Yuki Todo, Shangce Gao
{"title":"一种基于引力和球面搜索动力学的优化算法","authors":"Zhentao Tang, Kaiyu Wang, Jiarui Shi, Sichen Tao, Yuki Todo, Shangce Gao","doi":"10.1109/ISCID51228.2020.00027","DOIUrl":null,"url":null,"abstract":"The meta-heuristic is becoming important in the field of modern optimization, and gained more and more attention. In the past thirty years there has been a wide range of meta-heuristic, such as gravitational search algorithm (GSA), has achieved a great success. Spherical search (SS) is the one of newest proposed meta-heuristic algorithms. SS performs search effectively in exploration, but due to the lack of local exploitation ability, it converges slowly and can’t exploit the small region around the current promising solution. This paper proposes a novel optimization algorithm, namely SSGSA, which is inherited from the SS and GSA to combine the effective exploration and exploitation of each algorithm, respectively. To evaluate the effectiveness of SSGSA, we compared it with the original SS, original GSA, particle swarm optimization, and whale optimization algorithm on the IEEE CEC’17 benchmark function suit. Experimental results show that the proposed new method outperforms its competitors in terms of convergence speed and solution accuracy.","PeriodicalId":236797,"journal":{"name":"2020 13th International Symposium on Computational Intelligence and Design (ISCID)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Optimization Algorithm Inherited From Gravitational and Spherical Search Dynamics\",\"authors\":\"Zhentao Tang, Kaiyu Wang, Jiarui Shi, Sichen Tao, Yuki Todo, Shangce Gao\",\"doi\":\"10.1109/ISCID51228.2020.00027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The meta-heuristic is becoming important in the field of modern optimization, and gained more and more attention. In the past thirty years there has been a wide range of meta-heuristic, such as gravitational search algorithm (GSA), has achieved a great success. Spherical search (SS) is the one of newest proposed meta-heuristic algorithms. SS performs search effectively in exploration, but due to the lack of local exploitation ability, it converges slowly and can’t exploit the small region around the current promising solution. This paper proposes a novel optimization algorithm, namely SSGSA, which is inherited from the SS and GSA to combine the effective exploration and exploitation of each algorithm, respectively. To evaluate the effectiveness of SSGSA, we compared it with the original SS, original GSA, particle swarm optimization, and whale optimization algorithm on the IEEE CEC’17 benchmark function suit. Experimental results show that the proposed new method outperforms its competitors in terms of convergence speed and solution accuracy.\",\"PeriodicalId\":236797,\"journal\":{\"name\":\"2020 13th International Symposium on Computational Intelligence and Design (ISCID)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 13th International Symposium on Computational Intelligence and Design (ISCID)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID51228.2020.00027\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 13th International Symposium on Computational Intelligence and Design (ISCID)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID51228.2020.00027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

元启发式算法在现代优化领域中日益重要,受到越来越多的关注。近三十年来出现了各种各样的元启发式算法,如引力搜索算法(GSA)就取得了巨大的成功。球面搜索(SS)是一种最新提出的元启发式算法。SS在勘探过程中进行了有效的搜索,但由于缺乏局部开发能力,收敛速度慢,无法开发当前有希望的解周围的小区域。本文提出了一种新的优化算法,即SSGSA,它继承了SS和GSA,将各自算法的有效探索和利用相结合。为了评估SSGSA算法的有效性,我们在IEEE CEC ' 17基准函数集上将其与原始SS算法、原始GSA算法、粒子群优化算法和鲸鱼优化算法进行了比较。实验结果表明,该方法在收敛速度和求解精度方面优于同类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Optimization Algorithm Inherited From Gravitational and Spherical Search Dynamics
The meta-heuristic is becoming important in the field of modern optimization, and gained more and more attention. In the past thirty years there has been a wide range of meta-heuristic, such as gravitational search algorithm (GSA), has achieved a great success. Spherical search (SS) is the one of newest proposed meta-heuristic algorithms. SS performs search effectively in exploration, but due to the lack of local exploitation ability, it converges slowly and can’t exploit the small region around the current promising solution. This paper proposes a novel optimization algorithm, namely SSGSA, which is inherited from the SS and GSA to combine the effective exploration and exploitation of each algorithm, respectively. To evaluate the effectiveness of SSGSA, we compared it with the original SS, original GSA, particle swarm optimization, and whale optimization algorithm on the IEEE CEC’17 benchmark function suit. Experimental results show that the proposed new method outperforms its competitors in terms of convergence speed and solution accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信