Solving Optimization Problems using Hybrid Metaheuristics: Genetic Algorithm and Black Hole Algorithm

Omar Sabah Mohammed, A. Sewisy, A. Taloba
{"title":"Solving Optimization Problems using Hybrid Metaheuristics: Genetic Algorithm and Black Hole Algorithm","authors":"Omar Sabah Mohammed, A. Sewisy, A. Taloba","doi":"10.1109/ICCIS49240.2020.9257717","DOIUrl":null,"url":null,"abstract":"During the last two decades, many optimization algorithms have been developed for solving optimization problems. These algorithms have inspired from an intelligent behaviour of a living species, or a natural phenomenon. Black Hole (BH) algorithm has been developed recently, it as a metaheuristic that is based on population imitates the black hole event in the universe, whereby circulating solution in the search space represents an individual star. Although the original BH has shown better performance on benchmark datasets, it does not possess exploration capabilities but performs a good local search. In this paper, a new hybrid metaheuristic based on the combination of BH algorithm and Genetic Algorithm (GA) is proposed. The type of the proposed hybrid algorithm is High level hybridization, when GA represent the initialization phase (Global Search), while BH represents the searching Phase (Local Search). The proposed GA-BH is examined based on several optimization problems. The results obtained showed that the proposed algorithm is better than the original BH and GA algorithm.","PeriodicalId":425637,"journal":{"name":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS49240.2020.9257717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

During the last two decades, many optimization algorithms have been developed for solving optimization problems. These algorithms have inspired from an intelligent behaviour of a living species, or a natural phenomenon. Black Hole (BH) algorithm has been developed recently, it as a metaheuristic that is based on population imitates the black hole event in the universe, whereby circulating solution in the search space represents an individual star. Although the original BH has shown better performance on benchmark datasets, it does not possess exploration capabilities but performs a good local search. In this paper, a new hybrid metaheuristic based on the combination of BH algorithm and Genetic Algorithm (GA) is proposed. The type of the proposed hybrid algorithm is High level hybridization, when GA represent the initialization phase (Global Search), while BH represents the searching Phase (Local Search). The proposed GA-BH is examined based on several optimization problems. The results obtained showed that the proposed algorithm is better than the original BH and GA algorithm.
用混合元启发式算法求解优化问题:遗传算法和黑洞算法
在过去的二十年里,许多优化算法被开发出来解决优化问题。这些算法的灵感来自于一个生物物种的智能行为,或者一种自然现象。黑洞算法是近年来发展起来的一种基于种群的元启发式算法,它模拟了宇宙中的黑洞事件,在搜索空间中循环解代表单个恒星。虽然原始BH在基准数据集上表现出更好的性能,但它不具备勘探能力,但具有良好的局部搜索能力。提出了一种基于BH算法和遗传算法相结合的混合元启发式算法。提出的混合算法类型为高阶杂交,其中GA代表初始化阶段(Global Search), BH代表搜索阶段(Local Search)。基于若干优化问题对所提出的GA-BH进行了验证。实验结果表明,该算法优于原有的BH和GA算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信