蛾焰发光虫群优化

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS
D. Alboaneen, H. Tianfield, Yan Zhang
{"title":"蛾焰发光虫群优化","authors":"D. Alboaneen, H. Tianfield, Yan Zhang","doi":"10.3233/mgs-190314","DOIUrl":null,"url":null,"abstract":"One of the drawbacks of glowworm swarm optimisation (GSO) is its premature convergence, which leaves it often ineffective for solving complex practical problems. This paper proposes a new hybrid metaheuristic algorithm, that is, moth-flame glowworm swarm optimisation (MFGSO). The main idea of the hybrid algorithm is to combine the exploration ability in moth-flame optimisation (MFO) with the exploitation ability in GSO. Performance evaluations are conducted on benchmarking test functions in comparison with the basic GSO and other metaheuristic algorithms. The results show that MFGSO outperforms the basic GSO and other metaheuristic algorithms on most test functions in terms of local optima avoidance and convergence speed.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2019-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Moth-flame glowworm swarm optimisation\",\"authors\":\"D. Alboaneen, H. Tianfield, Yan Zhang\",\"doi\":\"10.3233/mgs-190314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the drawbacks of glowworm swarm optimisation (GSO) is its premature convergence, which leaves it often ineffective for solving complex practical problems. This paper proposes a new hybrid metaheuristic algorithm, that is, moth-flame glowworm swarm optimisation (MFGSO). The main idea of the hybrid algorithm is to combine the exploration ability in moth-flame optimisation (MFO) with the exploitation ability in GSO. Performance evaluations are conducted on benchmarking test functions in comparison with the basic GSO and other metaheuristic algorithms. The results show that MFGSO outperforms the basic GSO and other metaheuristic algorithms on most test functions in terms of local optima avoidance and convergence speed.\",\"PeriodicalId\":43659,\"journal\":{\"name\":\"Multiagent and Grid Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2019-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Multiagent and Grid Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/mgs-190314\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Multiagent and Grid Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/mgs-190314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 2

摘要

萤火虫群优化(GSO)的缺点之一是它的过早收敛性,这使得它在解决复杂的实际问题时往往无效。本文提出了一种新的混合元启发式算法,即蛾焰发光虫群优化算法。该混合算法的主要思想是将蛾焰优化(MFO)的探索能力与GSO的开发能力相结合。对基准测试函数进行性能评估,并与基本GSO和其他元启发式算法进行比较。结果表明,在大多数测试函数上,MFGSO在局部最优避免和收敛速度方面都优于基本GSO和其他元启发式算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Moth-flame glowworm swarm optimisation
One of the drawbacks of glowworm swarm optimisation (GSO) is its premature convergence, which leaves it often ineffective for solving complex practical problems. This paper proposes a new hybrid metaheuristic algorithm, that is, moth-flame glowworm swarm optimisation (MFGSO). The main idea of the hybrid algorithm is to combine the exploration ability in moth-flame optimisation (MFO) with the exploitation ability in GSO. Performance evaluations are conducted on benchmarking test functions in comparison with the basic GSO and other metaheuristic algorithms. The results show that MFGSO outperforms the basic GSO and other metaheuristic algorithms on most test functions in terms of local optima avoidance and convergence speed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Multiagent and Grid Systems
Multiagent and Grid Systems COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
1.50
自引率
0.00%
发文量
13
×
引用
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学术官方微信