基于ILP的智能电网需求响应客户选择优化算法

S. Kuppannagari, R. Kannan, V. Prasanna
{"title":"基于ILP的智能电网需求响应客户选择优化算法","authors":"S. Kuppannagari, R. Kannan, V. Prasanna","doi":"10.1109/CSCI.2015.140","DOIUrl":null,"url":null,"abstract":"Demand Response (DR) events are initiated by utilities during peak demand periods to curtail consumption. They ensure system reliability and minimize the utility's expenditure. Selection of the right customers and strategies is critical for a DR event. An effective DR scheduling algorithm minimizes the curtailment error which is the absolute difference between the achieved curtailment value and the target. State-of-the-art heuristics exist for customer selection, however their curtailment errors are unbounded and can be as high as 70%. In this work, we develop an Integer Linear Programming (ILP) formulation for optimally selecting customers and curtailment strategies that minimize the curtailment error during DR events in SmartGrids. We perform experiments on real world data obtained from the University of Southern California's SmartGrid and show that our algorithm achieves near exact curtailment values with errors in the range of 10-17 to 10-5, which are within the range of numerical errors. We compare our results against the state-of-the-art heuristic being deployed in practice in the USC SmartGrid. We show that for the same set of available customerstrategy pairs our algorithm performs 10-3 to 10-7 times better in terms of the curtailment errors incurred.","PeriodicalId":417235,"journal":{"name":"2015 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"An ILP Based Algorithm for Optimal Customer Selection for Demand Response in SmartGrids\",\"authors\":\"S. Kuppannagari, R. Kannan, V. Prasanna\",\"doi\":\"10.1109/CSCI.2015.140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Demand Response (DR) events are initiated by utilities during peak demand periods to curtail consumption. They ensure system reliability and minimize the utility's expenditure. Selection of the right customers and strategies is critical for a DR event. An effective DR scheduling algorithm minimizes the curtailment error which is the absolute difference between the achieved curtailment value and the target. State-of-the-art heuristics exist for customer selection, however their curtailment errors are unbounded and can be as high as 70%. In this work, we develop an Integer Linear Programming (ILP) formulation for optimally selecting customers and curtailment strategies that minimize the curtailment error during DR events in SmartGrids. We perform experiments on real world data obtained from the University of Southern California's SmartGrid and show that our algorithm achieves near exact curtailment values with errors in the range of 10-17 to 10-5, which are within the range of numerical errors. We compare our results against the state-of-the-art heuristic being deployed in practice in the USC SmartGrid. We show that for the same set of available customerstrategy pairs our algorithm performs 10-3 to 10-7 times better in terms of the curtailment errors incurred.\",\"PeriodicalId\":417235,\"journal\":{\"name\":\"2015 International Conference on Computational Science and Computational Intelligence (CSCI)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Computational Science and Computational Intelligence (CSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCI.2015.140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computational Science and Computational Intelligence (CSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCI.2015.140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

需求响应(DR)事件由公用事业公司在需求高峰期间发起,以减少消费。它们确保了系统的可靠性,并将公用事业的支出降至最低。选择正确的客户和策略对于灾难恢复至关重要。一种有效的容灾调度算法可以最小化缩减误差,即实现的缩减值与目标之间的绝对差值。最先进的启发式方法存在于客户选择中,但是它们的缩减误差是无界的,可能高达70%。在这项工作中,我们开发了一个整数线性规划(ILP)公式,用于优化选择客户和削减策略,以最大限度地减少智能电网中DR事件期间的削减误差。我们对来自南加州大学SmartGrid的真实世界数据进行了实验,结果表明我们的算法实现了接近精确的削减值,误差范围在10-17到10-5之间,在数值误差范围内。我们将我们的结果与USC智能电网实践中部署的最先进的启发式方法进行比较。我们表明,对于相同的一组可用的客户策略对,我们的算法在产生的缩减误差方面的性能要好10-3到10-7倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An ILP Based Algorithm for Optimal Customer Selection for Demand Response in SmartGrids
Demand Response (DR) events are initiated by utilities during peak demand periods to curtail consumption. They ensure system reliability and minimize the utility's expenditure. Selection of the right customers and strategies is critical for a DR event. An effective DR scheduling algorithm minimizes the curtailment error which is the absolute difference between the achieved curtailment value and the target. State-of-the-art heuristics exist for customer selection, however their curtailment errors are unbounded and can be as high as 70%. In this work, we develop an Integer Linear Programming (ILP) formulation for optimally selecting customers and curtailment strategies that minimize the curtailment error during DR events in SmartGrids. We perform experiments on real world data obtained from the University of Southern California's SmartGrid and show that our algorithm achieves near exact curtailment values with errors in the range of 10-17 to 10-5, which are within the range of numerical errors. We compare our results against the state-of-the-art heuristic being deployed in practice in the USC SmartGrid. We show that for the same set of available customerstrategy pairs our algorithm performs 10-3 to 10-7 times better in terms of the curtailment errors incurred.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信