Stable Relay Learning Optimization Approach for Fast Power System Production Cost Minimization Simulation

IF 7.2 1区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Power Systems Pub Date : 2024-09-25 DOI:10.1109/TPWRS.2024.3465839
Zishan Guo;Qinran Hu;Chong Qu;Tao Qian;Xin Fang;Renjie Hu;Zaijun Wu
{"title":"Stable Relay Learning Optimization Approach for Fast Power System Production Cost Minimization Simulation","authors":"Zishan Guo;Qinran Hu;Chong Qu;Tao Qian;Xin Fang;Renjie Hu;Zaijun Wu","doi":"10.1109/TPWRS.2024.3465839","DOIUrl":null,"url":null,"abstract":"Production cost minimization (PCM) simulation is commonly employed for assessing the operational efficiency, economic viability, and reliability, providing valuable insights for power system planning and operations. However, solving a PCM problem is time-consuming, consisting of numerous binary variables for simulation horizon extending over months and years. This hinders rapid assessment of modern energy systems with diverse planning requirements. Existing methods for accelerating PCM tend to sacrifice accuracy for speed. In this paper, we propose a <italic>stable relay learning optimization</i> (<italic>s-RLO</i>) approach within the Branch and Bound (B&B) algorithm. The proposed approach offers rapid and stable performance, and ensures optimal solutions. The two-stage <italic>s-RLO</i> involves an <italic>imitation learning</i> (<italic>IL</i>) phase for accurate policy initialization and a <italic>reinforcement learning</i> (<italic>RL</i>) phase for time-efficient fine-tuning. When implemented on the popular SCIP solver, <italic>s-RLO</i> returns the optimal solution up to 2× faster than the default <italic>relpscost</i> rule and 1.4× faster than <italic>IL</i>, or exhibits a smaller gap at the predefined time limit. The proposed approach shows stable performance, reducing fluctuations by approximately 50% compared with <italic>IL</i>. The efficacy of the proposed <italic>s-RLO</i> approach is supported by numerical results.","PeriodicalId":13373,"journal":{"name":"IEEE Transactions on Power Systems","volume":"40 3","pages":"2286-2296"},"PeriodicalIF":7.2000,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Power Systems","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10694772/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Production cost minimization (PCM) simulation is commonly employed for assessing the operational efficiency, economic viability, and reliability, providing valuable insights for power system planning and operations. However, solving a PCM problem is time-consuming, consisting of numerous binary variables for simulation horizon extending over months and years. This hinders rapid assessment of modern energy systems with diverse planning requirements. Existing methods for accelerating PCM tend to sacrifice accuracy for speed. In this paper, we propose a stable relay learning optimization (s-RLO) approach within the Branch and Bound (B&B) algorithm. The proposed approach offers rapid and stable performance, and ensures optimal solutions. The two-stage s-RLO involves an imitation learning (IL) phase for accurate policy initialization and a reinforcement learning (RL) phase for time-efficient fine-tuning. When implemented on the popular SCIP solver, s-RLO returns the optimal solution up to 2× faster than the default relpscost rule and 1.4× faster than IL, or exhibits a smaller gap at the predefined time limit. The proposed approach shows stable performance, reducing fluctuations by approximately 50% compared with IL. The efficacy of the proposed s-RLO approach is supported by numerical results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于快速电力系统生产成本最小化仿真的稳定继电器学习优化方法
生产成本最小化(PCM)仿真通常用于评估运行效率、经济可行性和可靠性,为电力系统规划和运行提供有价值的见解。然而,解决一个PCM问题是非常耗时的,因为它包含了大量的二进制变量,模拟的时间跨度长达数月甚至数年。这阻碍了对具有不同规划要求的现代能源系统的快速评估。现有的加速PCM的方法往往为了速度而牺牲精度。在本文中,我们提出了一种稳定中继学习优化(s-RLO)方法,该方法适用于分支定界(B&B)算法。该方法具有快速稳定的性能,并能保证最优解。两阶段s-RLO包括用于精确策略初始化的模仿学习(IL)阶段和用于时间高效微调的强化学习(RL)阶段。当在流行的SCIP求解器上实现时,s-RLO返回最优解的速度比默认的relpscost规则快2倍,比IL快1.4倍,或者在预定义的时间限制内显示更小的差距。该方法表现出稳定的性能,与IL相比减少了约50%的波动。数值结果支持了s-RLO方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Power Systems
IEEE Transactions on Power Systems 工程技术-工程:电子与电气
CiteScore
15.80
自引率
7.60%
发文量
696
审稿时长
3 months
期刊介绍: The scope of IEEE Transactions on Power Systems covers the education, analysis, operation, planning, and economics of electric generation, transmission, and distribution systems for general industrial, commercial, public, and domestic consumption, including the interaction with multi-energy carriers. The focus of this transactions is the power system from a systems viewpoint instead of components of the system. It has five (5) key areas within its scope with several technical topics within each area. These areas are: (1) Power Engineering Education, (2) Power System Analysis, Computing, and Economics, (3) Power System Dynamic Performance, (4) Power System Operations, and (5) Power System Planning and Implementation.
期刊最新文献
Toward Efficient Robust Dynamic Dispatch: A Two- Stage Model with Tight Upper Bound Guarantees Volt-VAr-Watt Optimization in Four-Wire Low-Voltage Networks: Exact Nonlinear Models and Smooth Approximations Analyzing of Stable Operating Regions and Adaptive Suppression Strategy for Low-Frequency Oscillations in PMSG-Based Wind Power Systems Dominant Transient Stability of the Co-Located PLL-Based Grid-Following Renewable Plant and Synchronous Condenser Systems A Planning Framework for Power-to-Gas in Multi-Energy Distribution Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1