具有不确定性的提前电压稳定约束网络拓扑优化

IF 5.7 1区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Dingli Guo;Lei Wang;Ticao Jiao;Ke Wu;Wenjing Yang
{"title":"具有不确定性的提前电压稳定约束网络拓扑优化","authors":"Dingli Guo;Lei Wang;Ticao Jiao;Ke Wu;Wenjing Yang","doi":"10.35833/MPCE.2023.000673","DOIUrl":null,"url":null,"abstract":"A day-ahead voltage-stability-constrained network topology optimization (DVNTO) problem is proposed to find the day-ahead topology schemes with the minimum number of operations (including line switching and bus-bar splitting) while ensuring the sufficient hourly voltage stability margin and the engineering operation requirement of power systems. The AC continuation power flow and the uncertainty from both renewable energy sources and loads are incorporated into the formulation. The proposed DVNTO problem is a stochastic, large-scale, nonlinear integer programming problem. To solve it tractably, a tailored three-stage solution methodology, including a scenario generation and reduction stage, a dynamic period partition stage, and a topology identification stage, is presented. First, to address the challenges posed by uncertainties, a novel problem-specified scenario reduction process is proposed to obtain the representative scenarios. Then, to obtain the minimum number of necessary operations to alter the network topologies for the next 24-hour horizon, a dynamic period partition strategy is presented to partition the hours into several periods according to the hourly voltage information based on the voltage stability problem. Finally, a topology identification stage is performed to identify the final network topology scheme. The effectiveness and robustness of the proposed three-stage solution methodology under different loading conditions and the effectiveness of the proposed partition strategy are evaluated on the IEEE 118-bus and 3120-bus power systems.","PeriodicalId":51326,"journal":{"name":"Journal of Modern Power Systems and Clean Energy","volume":"12 3","pages":"730-741"},"PeriodicalIF":5.7000,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10355079","citationCount":"0","resultStr":"{\"title\":\"Day-Ahead Voltage-Stability-Constrained Network Topology Optimization with Uncertainties\",\"authors\":\"Dingli Guo;Lei Wang;Ticao Jiao;Ke Wu;Wenjing Yang\",\"doi\":\"10.35833/MPCE.2023.000673\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A day-ahead voltage-stability-constrained network topology optimization (DVNTO) problem is proposed to find the day-ahead topology schemes with the minimum number of operations (including line switching and bus-bar splitting) while ensuring the sufficient hourly voltage stability margin and the engineering operation requirement of power systems. The AC continuation power flow and the uncertainty from both renewable energy sources and loads are incorporated into the formulation. The proposed DVNTO problem is a stochastic, large-scale, nonlinear integer programming problem. To solve it tractably, a tailored three-stage solution methodology, including a scenario generation and reduction stage, a dynamic period partition stage, and a topology identification stage, is presented. First, to address the challenges posed by uncertainties, a novel problem-specified scenario reduction process is proposed to obtain the representative scenarios. Then, to obtain the minimum number of necessary operations to alter the network topologies for the next 24-hour horizon, a dynamic period partition strategy is presented to partition the hours into several periods according to the hourly voltage information based on the voltage stability problem. Finally, a topology identification stage is performed to identify the final network topology scheme. The effectiveness and robustness of the proposed three-stage solution methodology under different loading conditions and the effectiveness of the proposed partition strategy are evaluated on the IEEE 118-bus and 3120-bus power systems.\",\"PeriodicalId\":51326,\"journal\":{\"name\":\"Journal of Modern Power Systems and Clean Energy\",\"volume\":\"12 3\",\"pages\":\"730-741\"},\"PeriodicalIF\":5.7000,\"publicationDate\":\"2023-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10355079\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Modern Power Systems and Clean Energy\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10355079/\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Modern Power Systems and Clean Energy","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10355079/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一个日前电压稳定约束网络拓扑优化(DVNTO)问题,旨在寻找操作次数(包括线路切换和母线分裂)最少的日前拓扑方案,同时保证足够的每小时电压稳定裕度和电力系统的工程运行要求。交流续流功率流以及来自可再生能源和负荷的不确定性都被纳入了计算公式。所提出的 DVNTO 问题是一个随机、大规模、非线性整数编程问题。为了轻松求解该问题,提出了一种量身定制的三阶段求解方法,包括情景生成和还原阶段、动态周期划分阶段和拓扑识别阶段。首先,针对不确定性带来的挑战,提出了一种新颖的问题指定情景还原过程,以获得代表性情景。然后,为了获得在下一个 24 小时范围内改变网络拓扑结构所需的最少操作次数,提出了一种动态时段划分策略,根据基于电压稳定性问题的每小时电压信息将小时划分为多个时段。最后,执行拓扑识别阶段,以确定最终的网络拓扑方案。在 IEEE 118 总线和 3120 总线电力系统上评估了所提出的三阶段求解方法在不同负载条件下的有效性和鲁棒性,以及所提出的分区策略的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Day-Ahead Voltage-Stability-Constrained Network Topology Optimization with Uncertainties
A day-ahead voltage-stability-constrained network topology optimization (DVNTO) problem is proposed to find the day-ahead topology schemes with the minimum number of operations (including line switching and bus-bar splitting) while ensuring the sufficient hourly voltage stability margin and the engineering operation requirement of power systems. The AC continuation power flow and the uncertainty from both renewable energy sources and loads are incorporated into the formulation. The proposed DVNTO problem is a stochastic, large-scale, nonlinear integer programming problem. To solve it tractably, a tailored three-stage solution methodology, including a scenario generation and reduction stage, a dynamic period partition stage, and a topology identification stage, is presented. First, to address the challenges posed by uncertainties, a novel problem-specified scenario reduction process is proposed to obtain the representative scenarios. Then, to obtain the minimum number of necessary operations to alter the network topologies for the next 24-hour horizon, a dynamic period partition strategy is presented to partition the hours into several periods according to the hourly voltage information based on the voltage stability problem. Finally, a topology identification stage is performed to identify the final network topology scheme. The effectiveness and robustness of the proposed three-stage solution methodology under different loading conditions and the effectiveness of the proposed partition strategy are evaluated on the IEEE 118-bus and 3120-bus power systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Modern Power Systems and Clean Energy
Journal of Modern Power Systems and Clean Energy ENGINEERING, ELECTRICAL & ELECTRONIC-
CiteScore
12.30
自引率
14.30%
发文量
97
审稿时长
13 weeks
期刊介绍: Journal of Modern Power Systems and Clean Energy (MPCE), commencing from June, 2013, is a newly established, peer-reviewed and quarterly published journal in English. It is the first international power engineering journal originated in mainland China. MPCE publishes original papers, short letters and review articles in the field of modern power systems with focus on smart grid technology and renewable energy integration, etc.
×
引用
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学术官方微信