Particle swarm optimization with adaptive elite opposition-based learning for large-scale problems

Hua-Hui Xu, Ruoli Tang
{"title":"Particle swarm optimization with adaptive elite opposition-based learning for large-scale problems","authors":"Hua-Hui Xu, Ruoli Tang","doi":"10.1109/ICCIA49625.2020.00016","DOIUrl":null,"url":null,"abstract":"A novel particle swarm optimization with elite opposition-based learning algorithm is proposed in an attempt to improve the performance on solving large-scale optimization problems (LSOP) in maximum power point tracking (MPPT) of photovoltaic system. The standard particle swarm optimization (PSO) algorithm shows its weakness on LSOP, such as easily falling into local optimum, slow convergence and low accuracy at later evolution process. Therefore, this paper develops a modified PSO algorithm based on elite opposition-based learning mechanism and adaptive multi-context cooperatively coevolving (AM-CC) framework. In every iteration, the current high-priority individuals execute dynamic generalized opposition-based learning to generate their opposite solutions which enhance the ability of local exploration and help the particles escape from local optimum. The simulation experiments are conducted on a comprehensive set of benchmarks (up to 2000 real-valued variables), as well as on a large-scale MPPT application. Compared with some state-of-the-art variants of PSO and differential evolution (DE), the results show that the improved algorithm has higher convergence speed and accuracy. Besides, it can avoid premature phenomenon effectively and is suitable to solve the large-scale optimization problem.","PeriodicalId":237536,"journal":{"name":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIA49625.2020.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A novel particle swarm optimization with elite opposition-based learning algorithm is proposed in an attempt to improve the performance on solving large-scale optimization problems (LSOP) in maximum power point tracking (MPPT) of photovoltaic system. The standard particle swarm optimization (PSO) algorithm shows its weakness on LSOP, such as easily falling into local optimum, slow convergence and low accuracy at later evolution process. Therefore, this paper develops a modified PSO algorithm based on elite opposition-based learning mechanism and adaptive multi-context cooperatively coevolving (AM-CC) framework. In every iteration, the current high-priority individuals execute dynamic generalized opposition-based learning to generate their opposite solutions which enhance the ability of local exploration and help the particles escape from local optimum. The simulation experiments are conducted on a comprehensive set of benchmarks (up to 2000 real-valued variables), as well as on a large-scale MPPT application. Compared with some state-of-the-art variants of PSO and differential evolution (DE), the results show that the improved algorithm has higher convergence speed and accuracy. Besides, it can avoid premature phenomenon effectively and is suitable to solve the large-scale optimization problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大规模问题的自适应精英对立学习粒子群优化
为了提高光伏系统最大功率点跟踪(MPPT)中大规模优化问题(LSOP)的求解性能,提出了一种基于精英对立学习算法的粒子群优化算法。标准粒子群优化算法(PSO)在LSOP上表现出易陷入局部最优、后期进化过程收敛速度慢、精度低等缺点。为此,本文提出了一种基于精英对立学习机制和自适应多上下文协同进化(AM-CC)框架的改进粒子群算法。在每次迭代中,当前高优先级个体执行动态广义对立学习,生成它们的对立解,增强了粒子的局部探索能力,帮助粒子脱离局部最优。仿真实验是在一组全面的基准测试(多达2000个实值变量)以及大规模的MPPT应用程序上进行的。与现有的粒子群算法和差分进化算法相比,改进算法具有更高的收敛速度和精度。此外,它还能有效地避免过早现象,适用于解决大规模优化问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Does ensemble really work when facing the twitter semantic classification? A Short-Term Hybrid Forecasting Approach for Regional Electricity Consumption Based on Grey Theory and Random Forest A negative selection algorithm based on adaptive immunoregulation ICCIA 2020 Breaker Page Video Prediction and Anomaly Detection Algorithm Based On Dual Discriminator
×
引用
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