Mixed-Integer Optimization for Volt/VAr Control in Radial Networks

M. Knaiber, R. Jabr
{"title":"Mixed-Integer Optimization for Volt/VAr Control in Radial Networks","authors":"M. Knaiber, R. Jabr","doi":"10.1109/REDEC.2018.8598089","DOIUrl":null,"url":null,"abstract":"Due to the increase in load demand and capacity of distributed generation, radial distribution systems are exposed to voltage violation problems. Volt/VAr control (VVC) has a primary objective of removing voltage violations, and a secondary objective of minimizing the real power loss. Volt/VAr control operates on capacitor switches, transformer taps, and the reactive power set-points of distributed generation. In this paper, the VVC problem is solved using mixed-integer conic programming to establish a globally optimal benchmark. To improve computational performance, a discrete coordinate-descent algorithm is employed, starting from a solution to the continuous relaxation of the VVC mixed-integer conic program. Numerical results are reported on radial distribution networks with up to 3146 nodes. The results reveal that the discrete coordinate-descent algorithm, when initialized by solving a continuous conic program, can give solutions that are very close to the global optimum; these solutions are obtained within a very reasonable computing time and are superior to initiating the search from the current operating point.","PeriodicalId":426643,"journal":{"name":"2018 4th International Conference on Renewable Energies for Developing Countries (REDEC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Renewable Energies for Developing Countries (REDEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REDEC.2018.8598089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Due to the increase in load demand and capacity of distributed generation, radial distribution systems are exposed to voltage violation problems. Volt/VAr control (VVC) has a primary objective of removing voltage violations, and a secondary objective of minimizing the real power loss. Volt/VAr control operates on capacitor switches, transformer taps, and the reactive power set-points of distributed generation. In this paper, the VVC problem is solved using mixed-integer conic programming to establish a globally optimal benchmark. To improve computational performance, a discrete coordinate-descent algorithm is employed, starting from a solution to the continuous relaxation of the VVC mixed-integer conic program. Numerical results are reported on radial distribution networks with up to 3146 nodes. The results reveal that the discrete coordinate-descent algorithm, when initialized by solving a continuous conic program, can give solutions that are very close to the global optimum; these solutions are obtained within a very reasonable computing time and are superior to initiating the search from the current operating point.
径向网络电压/无功控制的混合整数优化
由于负荷需求和分布式发电容量的增加,径向配电系统暴露出电压违例问题。电压/VAr控制(VVC)的主要目标是消除电压违规,次要目标是最大限度地减少实际功率损失。伏特/VAr控制作用于电容器开关、变压器抽头和分布式发电的无功功率设定点。本文采用混合整数二次规划方法求解VVC问题,建立全局最优基准。为了提高计算性能,采用离散坐标下降算法,从求解VVC混合整数二次规划的连续松弛问题入手。给出了节点数为3146的径向配电网的数值计算结果。结果表明,离散坐标下降算法通过求解连续二次规划初始化时,可以得到非常接近全局最优的解;这些解在非常合理的计算时间内得到,并且优于从当前操作点开始搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信