Incentive Design for Lowest Cost Aggregate Energy Demand Reduction

Soumyadip Ghosh, J. Kalagnanam, D. Katz, M. Squillante, Xiaoxuan Zhang, E. Feinberg
{"title":"Incentive Design for Lowest Cost Aggregate Energy Demand Reduction","authors":"Soumyadip Ghosh, J. Kalagnanam, D. Katz, M. Squillante, Xiaoxuan Zhang, E. Feinberg","doi":"10.1109/SMARTGRID.2010.5622095","DOIUrl":null,"url":null,"abstract":"We design an optimal incentive mechanism offered to energy customers at multiple network levels, e.g., distribution and feeder networks, with the aim of determining the lowest-cost aggregate energy demand reduction. Our model minimizes a utility's total cost for this mode of virtual demand generation, i.e., demand reduction, to achieve improvements in both total systemic costs and load reduction over existing mechanisms. We assume the utility can predict with reasonable accuracy the average load reduction response of end-users with respect to rebates by observing and learning from their past behavior. Within a single period formulation, we propose a heuristic policy that segments the customers according to their likelihood of reducing load. Within a multi-period formulation, we observe that customers who are more willing to reduce their aggregate demand over the entire horizon, rather than simply shifting their load to off-peak periods, tend to receive higher incentives, and vice versa.","PeriodicalId":106908,"journal":{"name":"2010 First IEEE International Conference on Smart Grid Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 First IEEE International Conference on Smart Grid Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMARTGRID.2010.5622095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

We design an optimal incentive mechanism offered to energy customers at multiple network levels, e.g., distribution and feeder networks, with the aim of determining the lowest-cost aggregate energy demand reduction. Our model minimizes a utility's total cost for this mode of virtual demand generation, i.e., demand reduction, to achieve improvements in both total systemic costs and load reduction over existing mechanisms. We assume the utility can predict with reasonable accuracy the average load reduction response of end-users with respect to rebates by observing and learning from their past behavior. Within a single period formulation, we propose a heuristic policy that segments the customers according to their likelihood of reducing load. Within a multi-period formulation, we observe that customers who are more willing to reduce their aggregate demand over the entire horizon, rather than simply shifting their load to off-peak periods, tend to receive higher incentives, and vice versa.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
降低总能源需求最低成本的激励设计
我们设计了一个最优的激励机制,提供给能源客户在多个网络层面,如配电和馈线网络,目的是确定最低成本的总能源需求减少。我们的模型最大限度地减少了这种虚拟需求生成模式的总成本,即需求减少,以实现对现有机制的总系统成本和负载减少的改进。我们假设,通过观察和学习终端用户过去的行为,电力公司可以合理准确地预测终端用户相对于折扣的平均减负荷响应。在单一周期公式中,我们提出了一种启发式策略,该策略根据客户减少负载的可能性对客户进行细分。在多期公式中,我们观察到,更愿意在整个周期内减少总需求的客户,而不是简单地将负荷转移到非高峰时期,往往会获得更高的激励,反之亦然。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Spectrum for Smart Grid: Policy Recommendations Enabling Current and Future Applications Privacy for Smart Meters: Towards Undetectable Appliance Load Signatures Quality of Service Networking for Smart Grid Distribution Monitoring The POWER of Networking: How Networking Can Help Power Management Hydro: A Hybrid Routing Protocol for Low-Power and Lossy Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1