基于变分模态分解的Snake优化器的车辆充电负荷短期预测

IF 3.3 Q3 ENERGY & FUELS
Quanxue Guan;Qinhe Liu;Shaocong Tao;Yunjian Xu;Di Zhou;Haoyong Chen;Xiaojun Tan
{"title":"基于变分模态分解的Snake优化器的车辆充电负荷短期预测","authors":"Quanxue Guan;Qinhe Liu;Shaocong Tao;Yunjian Xu;Di Zhou;Haoyong Chen;Xiaojun Tan","doi":"10.1109/OAJPE.2025.3529944","DOIUrl":null,"url":null,"abstract":"The rapid proliferation of electric vehicles (EVs) significantly impacts the power grid, necessitating effective forecasting of charging loads. For ultra short-term load prediction, this paper proposes a Snake Optimization (SO)-Variational Mode Decomposition (VMD)-Long Short-Term Memory (LSTM) algorithm trained by only the historical charging data. Before the prediction starts, the VMD method is utilized to minimize the data complexity, yielding several multiple Intrinsic Mode Functions (IMFs) that correspond to the charging load features at different time scales. The VMD parameters are automatically adjusted using the SO method, instead of the trial-and-error method, to trade off the prediction accuracy against computational overhead. Once the parameters of the VMD are determined, the same number of LSTM networks are employed to forecast the corresponding charging loads from these IMFs, with one LSTM for each IMF. Due to the VMD, IMFs with spanned center frequencies containing few irregularities make the prediction simple. These LSTM outcomes are then summed to obtain the overall load prediction. Experiments are carried out to show that the proposed parallel structure of multiple LSTM networks can achieve high prediction accuracy without requiring complex model structures. Our proposed algorithm outperforms the traditional prediction methods including Gate Recurrent Unit, Extreme Learning Machine, LSTM, and their combination with VMD, significantly reducing the Root Mean Square Error and the Mean Absolute Error by 30.1% and 32.9% in comparison with the optimal VMD-LSTM approach, and by 59.3% and 62.6% with respect to the baseline LSTM method.","PeriodicalId":56187,"journal":{"name":"IEEE Open Access Journal of Power and Energy","volume":"12 ","pages":"76-87"},"PeriodicalIF":3.3000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10846941","citationCount":"0","resultStr":"{\"title\":\"Snake Optimizer Improved Variational Mode Decomposition for Short-Term Prediction of Vehicle Charging Loads\",\"authors\":\"Quanxue Guan;Qinhe Liu;Shaocong Tao;Yunjian Xu;Di Zhou;Haoyong Chen;Xiaojun Tan\",\"doi\":\"10.1109/OAJPE.2025.3529944\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid proliferation of electric vehicles (EVs) significantly impacts the power grid, necessitating effective forecasting of charging loads. For ultra short-term load prediction, this paper proposes a Snake Optimization (SO)-Variational Mode Decomposition (VMD)-Long Short-Term Memory (LSTM) algorithm trained by only the historical charging data. Before the prediction starts, the VMD method is utilized to minimize the data complexity, yielding several multiple Intrinsic Mode Functions (IMFs) that correspond to the charging load features at different time scales. The VMD parameters are automatically adjusted using the SO method, instead of the trial-and-error method, to trade off the prediction accuracy against computational overhead. Once the parameters of the VMD are determined, the same number of LSTM networks are employed to forecast the corresponding charging loads from these IMFs, with one LSTM for each IMF. Due to the VMD, IMFs with spanned center frequencies containing few irregularities make the prediction simple. These LSTM outcomes are then summed to obtain the overall load prediction. Experiments are carried out to show that the proposed parallel structure of multiple LSTM networks can achieve high prediction accuracy without requiring complex model structures. Our proposed algorithm outperforms the traditional prediction methods including Gate Recurrent Unit, Extreme Learning Machine, LSTM, and their combination with VMD, significantly reducing the Root Mean Square Error and the Mean Absolute Error by 30.1% and 32.9% in comparison with the optimal VMD-LSTM approach, and by 59.3% and 62.6% with respect to the baseline LSTM method.\",\"PeriodicalId\":56187,\"journal\":{\"name\":\"IEEE Open Access Journal of Power and Energy\",\"volume\":\"12 \",\"pages\":\"76-87\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2025-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10846941\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Open Access Journal of Power and Energy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10846941/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENERGY & FUELS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Access Journal of Power and Energy","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10846941/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
引用次数: 0

摘要

电动汽车的快速发展对电网产生了重大影响,因此需要对充电负荷进行有效的预测。针对超短期负荷预测问题,提出了一种基于历史负荷数据训练的Snake优化(SO)-变分模态分解(VMD)-长短期记忆(LSTM)算法。在开始预测之前,利用VMD方法最小化数据复杂度,得到多个对应于不同时间尺度充电负荷特征的本征模态函数(IMFs)。VMD参数使用SO方法自动调整,而不是试错法,以权衡预测精度和计算开销。一旦VMD的参数确定,使用相同数量的LSTM网络来预测这些IMF的相应收费负荷,每个IMF使用一个LSTM。由于VMD,具有跨中心频率的imf包含很少的不规则性,使得预测变得简单。然后将这些LSTM结果相加以获得总体负载预测。实验表明,在不需要复杂模型结构的情况下,多个LSTM网络的并行结构可以达到较高的预测精度。该算法优于门递归单元(Gate Recurrent Unit)、极限学习机(Extreme Learning Machine)、LSTM及其与VMD相结合的传统预测方法,与最优的VMD-LSTM方法相比,均方根误差(Root Mean Square Error)和平均绝对误差(Mean Absolute Error)分别降低了30.1%和32.9%,与基线LSTM方法相比,分别降低了59.3%和62.6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Snake Optimizer Improved Variational Mode Decomposition for Short-Term Prediction of Vehicle Charging Loads
The rapid proliferation of electric vehicles (EVs) significantly impacts the power grid, necessitating effective forecasting of charging loads. For ultra short-term load prediction, this paper proposes a Snake Optimization (SO)-Variational Mode Decomposition (VMD)-Long Short-Term Memory (LSTM) algorithm trained by only the historical charging data. Before the prediction starts, the VMD method is utilized to minimize the data complexity, yielding several multiple Intrinsic Mode Functions (IMFs) that correspond to the charging load features at different time scales. The VMD parameters are automatically adjusted using the SO method, instead of the trial-and-error method, to trade off the prediction accuracy against computational overhead. Once the parameters of the VMD are determined, the same number of LSTM networks are employed to forecast the corresponding charging loads from these IMFs, with one LSTM for each IMF. Due to the VMD, IMFs with spanned center frequencies containing few irregularities make the prediction simple. These LSTM outcomes are then summed to obtain the overall load prediction. Experiments are carried out to show that the proposed parallel structure of multiple LSTM networks can achieve high prediction accuracy without requiring complex model structures. Our proposed algorithm outperforms the traditional prediction methods including Gate Recurrent Unit, Extreme Learning Machine, LSTM, and their combination with VMD, significantly reducing the Root Mean Square Error and the Mean Absolute Error by 30.1% and 32.9% in comparison with the optimal VMD-LSTM approach, and by 59.3% and 62.6% with respect to the baseline LSTM method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.80
自引率
5.30%
发文量
45
审稿时长
10 weeks
×
引用
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学术官方微信