{"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}
引用次数: 2
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.