基于在线凸优化的自主需求响应算法

S. Bahrami, Y. Chen, V. Wong
{"title":"基于在线凸优化的自主需求响应算法","authors":"S. Bahrami, Y. Chen, V. Wong","doi":"10.1109/SmartGridComm.2018.8587535","DOIUrl":null,"url":null,"abstract":"A price-based demand response program is a viable solution for distribution network operators (DNOs) to motivate electricity consumers toward scheduling their load demand during off-peak periods. This paper addresses the problem of load scheduling in a demand response program, while accounting for load demand uncertainty and the distribution network operational constraints. The centralized load control is a non convex optimization problem due to the ac power flow equations. We use convex relaxation techniques to transform the problem into a semidefinite program (SDP), which is solved using online convex optimization techniques to address the load demand uncertainty. To tackle the issue of computational complexity, we use proximal Jacobian alternating direction method of multipliers (PJ-ADMM) to decompose the centralized problem into the customers' load scheduling subproblems. The decentralized algorithm is executed by each customer to schedule its load demand in real-time. Via simulations on the IEEE 37-bus test feeder, we show that the proposed algorithm enables customers to approximate the optimal load profile in the benchmark scenario without load uncertainty, and the approximation is tight. Furthermore, we show a negligible gap of 2.3% between the customers' cost with the proposed algorithm and the cost in the benchmark scenario.","PeriodicalId":213523,"journal":{"name":"2018 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An Autonomous Demand Response Algorithm based on Online Convex Optimization\",\"authors\":\"S. Bahrami, Y. Chen, V. Wong\",\"doi\":\"10.1109/SmartGridComm.2018.8587535\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A price-based demand response program is a viable solution for distribution network operators (DNOs) to motivate electricity consumers toward scheduling their load demand during off-peak periods. This paper addresses the problem of load scheduling in a demand response program, while accounting for load demand uncertainty and the distribution network operational constraints. The centralized load control is a non convex optimization problem due to the ac power flow equations. We use convex relaxation techniques to transform the problem into a semidefinite program (SDP), which is solved using online convex optimization techniques to address the load demand uncertainty. To tackle the issue of computational complexity, we use proximal Jacobian alternating direction method of multipliers (PJ-ADMM) to decompose the centralized problem into the customers' load scheduling subproblems. The decentralized algorithm is executed by each customer to schedule its load demand in real-time. Via simulations on the IEEE 37-bus test feeder, we show that the proposed algorithm enables customers to approximate the optimal load profile in the benchmark scenario without load uncertainty, and the approximation is tight. Furthermore, we show a negligible gap of 2.3% between the customers' cost with the proposed algorithm and the cost in the benchmark scenario.\",\"PeriodicalId\":213523,\"journal\":{\"name\":\"2018 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SmartGridComm.2018.8587535\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartGridComm.2018.8587535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

基于价格的需求响应方案是配电网运营商激励用户在非高峰时段调度用电需求的可行方案。在考虑电力需求不确定性和配电网运行约束的情况下,研究了电力需求响应规划中的负荷调度问题。由于交流潮流方程的存在,集中负荷控制是一个非凸优化问题。利用凸松弛技术将该问题转化为半定规划(SDP),利用在线凸优化技术解决负荷需求的不确定性问题。为了解决计算量大的问题,我们采用近端雅可比乘法器交替方向法(PJ-ADMM)将集中问题分解为客户负载调度子问题。分散算法由每个客户执行,以实时调度其负载需求。通过在IEEE 37总线测试馈线上的仿真,我们表明所提出的算法使客户能够在没有负载不确定性的情况下近似基准场景下的最佳负载轮廓,并且近似是严密的。此外,我们还显示,使用所提出算法的客户成本与基准场景中的成本之间的差距可以忽略不计,仅为2.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Autonomous Demand Response Algorithm based on Online Convex Optimization
A price-based demand response program is a viable solution for distribution network operators (DNOs) to motivate electricity consumers toward scheduling their load demand during off-peak periods. This paper addresses the problem of load scheduling in a demand response program, while accounting for load demand uncertainty and the distribution network operational constraints. The centralized load control is a non convex optimization problem due to the ac power flow equations. We use convex relaxation techniques to transform the problem into a semidefinite program (SDP), which is solved using online convex optimization techniques to address the load demand uncertainty. To tackle the issue of computational complexity, we use proximal Jacobian alternating direction method of multipliers (PJ-ADMM) to decompose the centralized problem into the customers' load scheduling subproblems. The decentralized algorithm is executed by each customer to schedule its load demand in real-time. Via simulations on the IEEE 37-bus test feeder, we show that the proposed algorithm enables customers to approximate the optimal load profile in the benchmark scenario without load uncertainty, and the approximation is tight. Furthermore, we show a negligible gap of 2.3% between the customers' cost with the proposed algorithm and the cost in the benchmark scenario.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信