GPU-based variation of parallel invasive weed optimization algorithm for 1000D functions

Aijia Ouyang, Libin Liu, Kenli Li, Kuan-Ching Li
{"title":"GPU-based variation of parallel invasive weed optimization algorithm for 1000D functions","authors":"Aijia Ouyang, Libin Liu, Kenli Li, Kuan-Ching Li","doi":"10.1109/ICNC.2014.6975875","DOIUrl":null,"url":null,"abstract":"Considering the problems of slow convergence and easily getting into local optimum of intelligent optimization algorithms in finding the optimal solution to complex high-dimensional functions, we have proposed an improved invasive weed optimization (IIWO). Concrete adjustments include setting the newborn seeds per plant to a fixed number, changing the initial step and final step to adaptive one, and re-initializing the solution which exceeds the boundary value. Meanwhile, through applying the algorithm to the GPU platform, a parallel IIWO (PIIWO) based on GPU is obtained. The algorithm not only improves the convergence, but also strikes a balance between the global and local search capabilities. The simulation results of solving on the CEC' 2010 1000-dimensional (1000D) functions, have shown that, compared with other algorithms, our designed IIWO can yield better performance, faster convergence, higher accuracy and stronger robustness; whilst the PIIWO has significant speedup than the IIWO.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 10th International Conference on Natural Computation (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2014.6975875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Considering the problems of slow convergence and easily getting into local optimum of intelligent optimization algorithms in finding the optimal solution to complex high-dimensional functions, we have proposed an improved invasive weed optimization (IIWO). Concrete adjustments include setting the newborn seeds per plant to a fixed number, changing the initial step and final step to adaptive one, and re-initializing the solution which exceeds the boundary value. Meanwhile, through applying the algorithm to the GPU platform, a parallel IIWO (PIIWO) based on GPU is obtained. The algorithm not only improves the convergence, but also strikes a balance between the global and local search capabilities. The simulation results of solving on the CEC' 2010 1000-dimensional (1000D) functions, have shown that, compared with other algorithms, our designed IIWO can yield better performance, faster convergence, higher accuracy and stronger robustness; whilst the PIIWO has significant speedup than the IIWO.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于gpu的1000D函数并行入侵杂草变异优化算法
针对智能优化算法在寻找复杂高维函数最优解时收敛速度慢、容易陷入局部最优的问题,提出了一种改进的入侵杂草优化算法(IIWO)。具体调整包括将每株新种子设置为固定数量,将初始步长和最终步长改为自适应步长,以及对超过边界值的解进行重新初始化。同时,将该算法应用于GPU平台,得到了一个基于GPU的并行IIWO (PIIWO)。该算法不仅提高了收敛性,而且在全局和局部搜索能力之间取得了平衡。在CEC' 2010的1000维(1000D)函数上的仿真结果表明,与其他算法相比,所设计的IIWO算法具有更好的性能、更快的收敛速度、更高的精度和更强的鲁棒性;而PIIWO比IIWO有明显的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Graph based K-nearest neighbor minutiae clustering for fingerprint recognition Applications of artificial intelligence technologies in credit scoring: A survey of literature Construction of linear dynamic gene regulatory network based on feedforward neural network A new dynamic clustering method based on nuclear field A multi-objective ant colony optimization algorithm based on the Physarum-inspired mathematical model
×
引用
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