An order based hybrid metaheuristic algorithm for solving optimization problems

O. Gokalp, Aybars Uğur
{"title":"An order based hybrid metaheuristic algorithm for solving optimization problems","authors":"O. Gokalp, Aybars Uğur","doi":"10.1109/UBMK.2017.8093477","DOIUrl":null,"url":null,"abstract":"In this work, a hybrid method that includes metaheuristic algorithms has been proposed for solving optimization problems. The proposed method was implemented as employing three metaheuristic algorithms which are Artificial Bee Colony, Differential Evolution and Particle Swarm Optimization in an order. The success of the developed method is presented by testing on 12 continuous optimization test functions which are widely used in the literature. The experimental results show that the proposed hybrid method gives better results than the individual algorithms that make up it.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer Science and Engineering (UBMK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UBMK.2017.8093477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this work, a hybrid method that includes metaheuristic algorithms has been proposed for solving optimization problems. The proposed method was implemented as employing three metaheuristic algorithms which are Artificial Bee Colony, Differential Evolution and Particle Swarm Optimization in an order. The success of the developed method is presented by testing on 12 continuous optimization test functions which are widely used in the literature. The experimental results show that the proposed hybrid method gives better results than the individual algorithms that make up it.
一种基于顺序的混合元启发式算法求解优化问题
在这项工作中,提出了一种包含元启发式算法的混合方法来解决优化问题。该方法按顺序采用人工蜂群、差分进化和粒子群优化三种元启发式算法来实现。通过对文献中广泛使用的12个连续优化测试函数的测试,证明了该方法的成功。实验结果表明,所提出的混合算法比单独的算法具有更好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信