An efficient hybrid algorithm based on harmony search and invasive weed optimization

Aijia Ouyang, Zhiguo Yang
{"title":"An efficient hybrid algorithm based on harmony search and invasive weed optimization","authors":"Aijia Ouyang, Zhiguo Yang","doi":"10.1109/FSKD.2016.7603169","DOIUrl":null,"url":null,"abstract":"Considering that invasive weed optimization (IWO) algorithm and the harmony search (HS) algorithm easily plunge into local optimal solution with low computing precision when they are applied to solve complex function problems, this paper improves the IWO algorithm and the HS algorithm. We introduce some strategies such as fixing the number of seeds, reinitializing boundary solutions, multi-individual global HS, and parameter optimization, etc. In order to make full use of the advantages of two algorithms, they are mixed in this paper, whereby the IWO algorithm based on HS is put forward, which is called HS-IWO for short. Through tests on 10 complex functions, the experimental results verify the accuracy, efficiency and stabilization of the HS-IWO algorithm.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2016.7603169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Considering that invasive weed optimization (IWO) algorithm and the harmony search (HS) algorithm easily plunge into local optimal solution with low computing precision when they are applied to solve complex function problems, this paper improves the IWO algorithm and the HS algorithm. We introduce some strategies such as fixing the number of seeds, reinitializing boundary solutions, multi-individual global HS, and parameter optimization, etc. In order to make full use of the advantages of two algorithms, they are mixed in this paper, whereby the IWO algorithm based on HS is put forward, which is called HS-IWO for short. Through tests on 10 complex functions, the experimental results verify the accuracy, efficiency and stabilization of the HS-IWO algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于和谐搜索和入侵杂草优化的高效混合算法
针对入侵杂草优化(IWO)算法和和谐搜索(HS)算法在求解复杂函数问题时容易陷入局部最优解且计算精度低的问题,本文对入侵杂草优化(IWO)算法和和谐搜索(HS)算法进行了改进。介绍了固定种子数、重新初始化边界解、多个体全局HS和参数优化等策略。为了充分利用两种算法的优点,本文将它们混合在一起,提出了基于HS的IWO算法,简称HS-IWO算法。通过对10个复杂函数的测试,实验结果验证了HS-IWO算法的准确性、高效性和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel electrons drifting algorithm for non-linear optimization problems Performance assessment of fault classifier of chemical plant based on support vector machine A theoretical line losses calculation method of distribution system based on boosting algorithm Building vietnamese dependency treebank based on Chinese-Vietnamese bilingual word alignment Optimizing self-adaptive gender ratio of elephant search algorithm by min-max strategy
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1