一种跟踪光伏系统最大功率的启发式新方法的性能

Aripriharta, Kusmayanto Hadi Wibowo, I. Fadlika, Muladi, N. Mufti, M. Diantoro, G. Horng
{"title":"一种跟踪光伏系统最大功率的启发式新方法的性能","authors":"Aripriharta, Kusmayanto Hadi Wibowo, I. Fadlika, Muladi, N. Mufti, M. Diantoro, G. Horng","doi":"10.1155/2022/1996410","DOIUrl":null,"url":null,"abstract":"This paper presents a new heuristic method for maximum power point tracking (MPPT) in PV systems under normal and shadowing situations. The proposed method is a modification of the original queen honey bee migration (QHBM) to shorten the computation time for the maximum power point (MPP) in PV systems. QHBM initially uses random target locations to search for targets, in this case, MPP. So, we adjusted it to be able to do MPP point quests quickly. We accelerated the mQHBM learning process from the original randomly. We had fairly compared the mQHBM with several heuristics. Simulations were carried out with 2 scenarios to test the mQHBM. Based on the simulation results, it was found that mQHBM was able to exceed the capabilities of other methods such as original QHBM, particle swarm optimization (PSO) and perturb and observe (P&O), ANN, gray wolf (GWO), and cuckoo search (CS) in terms of MPPT speed and overshoot. However, the accuracy of mQHBM cannot exceed QHBM, ANN, and GWO. But still, mQHBM is better than PSO and P&O by about 15% and 18%, respectively. This experiment resulted in a gap of about 2% faster in speed, 0.34 seconds better in convergence time, and 0.2 fewer accuracies.","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"20 1","pages":"1996410:1-1996410:13"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Performance of a New Heuristic Approach for Tracking Maximum Power of PV Systems\",\"authors\":\"Aripriharta, Kusmayanto Hadi Wibowo, I. Fadlika, Muladi, N. Mufti, M. Diantoro, G. Horng\",\"doi\":\"10.1155/2022/1996410\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new heuristic method for maximum power point tracking (MPPT) in PV systems under normal and shadowing situations. The proposed method is a modification of the original queen honey bee migration (QHBM) to shorten the computation time for the maximum power point (MPP) in PV systems. QHBM initially uses random target locations to search for targets, in this case, MPP. So, we adjusted it to be able to do MPP point quests quickly. We accelerated the mQHBM learning process from the original randomly. We had fairly compared the mQHBM with several heuristics. Simulations were carried out with 2 scenarios to test the mQHBM. Based on the simulation results, it was found that mQHBM was able to exceed the capabilities of other methods such as original QHBM, particle swarm optimization (PSO) and perturb and observe (P&O), ANN, gray wolf (GWO), and cuckoo search (CS) in terms of MPPT speed and overshoot. However, the accuracy of mQHBM cannot exceed QHBM, ANN, and GWO. But still, mQHBM is better than PSO and P&O by about 15% and 18%, respectively. This experiment resulted in a gap of about 2% faster in speed, 0.34 seconds better in convergence time, and 0.2 fewer accuracies.\",\"PeriodicalId\":8218,\"journal\":{\"name\":\"Appl. Comput. Intell. Soft Comput.\",\"volume\":\"20 1\",\"pages\":\"1996410:1-1996410:13\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Appl. Comput. Intell. Soft Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2022/1996410\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Appl. Comput. Intell. Soft Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/1996410","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种新的启发式方法,用于光伏系统在正常和阴影情况下的最大功率点跟踪。为了缩短光伏系统中最大功率点(MPP)的计算时间,提出了一种改进蜂王迁移(QHBM)的方法。QHBM最初使用随机目标位置来搜索目标,在本例中为MPP。所以,我们调整了它,以便能够快速完成MPP点任务。我们从原来的随机中加速了mQHBM的学习过程。我们已经将mQHBM与几种启发式方法进行了比较。通过两种场景对mQHBM进行了仿真测试。仿真结果表明,mQHBM在MPPT速度和超调量方面优于原始QHBM、粒子群优化(PSO)和扰动与观察(P&O)、人工神经网络、灰狼(GWO)和布谷鸟搜索(CS)等方法。但是,mQHBM的精度不能超过QHBM、ANN和GWO。但是,mQHBM仍然比PSO和P&O分别好15%和18%。实验结果表明,该算法的速度提高了约2%,收敛时间提高了0.34秒,精度降低了0.2秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Performance of a New Heuristic Approach for Tracking Maximum Power of PV Systems
This paper presents a new heuristic method for maximum power point tracking (MPPT) in PV systems under normal and shadowing situations. The proposed method is a modification of the original queen honey bee migration (QHBM) to shorten the computation time for the maximum power point (MPP) in PV systems. QHBM initially uses random target locations to search for targets, in this case, MPP. So, we adjusted it to be able to do MPP point quests quickly. We accelerated the mQHBM learning process from the original randomly. We had fairly compared the mQHBM with several heuristics. Simulations were carried out with 2 scenarios to test the mQHBM. Based on the simulation results, it was found that mQHBM was able to exceed the capabilities of other methods such as original QHBM, particle swarm optimization (PSO) and perturb and observe (P&O), ANN, gray wolf (GWO), and cuckoo search (CS) in terms of MPPT speed and overshoot. However, the accuracy of mQHBM cannot exceed QHBM, ANN, and GWO. But still, mQHBM is better than PSO and P&O by about 15% and 18%, respectively. This experiment resulted in a gap of about 2% faster in speed, 0.34 seconds better in convergence time, and 0.2 fewer accuracies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信