Optimal Dispatch of Active Distribution Network for Solar Power Accommodation Based on Conditional Value at Risk

Xiuwen Cai, Maoxin Chen, Keyao Lin, Jiawei Lyu, Shenxi Zhang, Haozhong Cheng
{"title":"Optimal Dispatch of Active Distribution Network for Solar Power Accommodation Based on Conditional Value at Risk","authors":"Xiuwen Cai, Maoxin Chen, Keyao Lin, Jiawei Lyu, Shenxi Zhang, Haozhong Cheng","doi":"10.1109/CICED50259.2021.9556822","DOIUrl":null,"url":null,"abstract":"Nowadays, with the worldwide attention on renewable energy, the grid-connected photovoltaic (PV) equipment is playing a significant role in the active distribution network (ADN). This paper proposes a novel day-ahead optimal dispatch model for ADN based on the conditional value at risk (CVaR) to promote solar power accommodation. Firstly, the uncertainties of PV output and load are modeled by the generated typical scenarios based on historic data and K-means clustering and can be embedded in the discretized and linearized CVaR model. Then, the optimal dispatch model aimed to maximize solar power accommodation is established. Active management (AM) includes the on-load tap changer, capacitor bank, battery energy storage, and load curtailment. Constraints mainly involve power flow, nodal voltage, branch power load, and the limits of AM. The problem is finally transferred into a mixed-integer second-order cone programming one, which can be solved by the commercial solver Gurobi directly based on the branch-and-bound method. Case studies based on a modified IEEE 33-bus system illustrate the feasibility and validity of the proposed method.","PeriodicalId":221387,"journal":{"name":"2021 China International Conference on Electricity Distribution (CICED)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 China International Conference on Electricity Distribution (CICED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICED50259.2021.9556822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Nowadays, with the worldwide attention on renewable energy, the grid-connected photovoltaic (PV) equipment is playing a significant role in the active distribution network (ADN). This paper proposes a novel day-ahead optimal dispatch model for ADN based on the conditional value at risk (CVaR) to promote solar power accommodation. Firstly, the uncertainties of PV output and load are modeled by the generated typical scenarios based on historic data and K-means clustering and can be embedded in the discretized and linearized CVaR model. Then, the optimal dispatch model aimed to maximize solar power accommodation is established. Active management (AM) includes the on-load tap changer, capacitor bank, battery energy storage, and load curtailment. Constraints mainly involve power flow, nodal voltage, branch power load, and the limits of AM. The problem is finally transferred into a mixed-integer second-order cone programming one, which can be solved by the commercial solver Gurobi directly based on the branch-and-bound method. Case studies based on a modified IEEE 33-bus system illustrate the feasibility and validity of the proposed method.
基于风险条件值的太阳能发电调节有功配电网优化调度
在可再生能源日益受到世界各国重视的今天,光伏并网设备在有源配电网中扮演着重要的角色。本文提出了一种新的基于条件风险值(CVaR)的ADN日前最优调度模型,以促进太阳能发电调节。首先,根据历史数据和K-means聚类方法生成典型情景,对光伏发电出力和负荷的不确定性进行建模,并嵌入到离散化和线性化的CVaR模型中。在此基础上,建立了以太阳能发电容纳量最大化为目标的最优调度模型。主动管理(AM)包括有载分接开关、电容器组、电池储能和负载缩减。约束条件主要包括潮流、节点电压、支路负荷和调幅限制。最后将该问题转化为一个混合整数二阶锥规划问题,该问题可由商业求解器Gurobi基于分支定界法直接求解。以改进的IEEE 33总线系统为例,验证了该方法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信