通过日前定价实现最优负荷管理

M. R. Rao, J. Kuri, T. V. Prabhakar
{"title":"通过日前定价实现最优负荷管理","authors":"M. R. Rao, J. Kuri, T. V. Prabhakar","doi":"10.1109/COMSNETS.2015.7098699","DOIUrl":null,"url":null,"abstract":"Demand Response is under implementation throughout the globe by many utilities to incorporate the end user as an active player in reducing supply-demand imbalances. Day-ahead pricing is provided as an option to schedule electric loads so as to take advantage of time-varying prices. However, user convenience is also a factor that must be taken into account, as users may be willing to forego some savings to reduce inconvenience. We formulate an optimal scheduling problem considering both aspects. As the search space is exponentially large, we propose two greedy algorithms to find good schedules. To assess performance, we obtain the optimal schedule via Markov Chain Monte Carlo (MCMC) based simulations. We apply the framework to two case studies; one study uses appliance energy profiles obtained by actual measurements using the Joule Jotter, a device designed and developed in-house. Results indicate that the proposed algorithms perform very well, achieving performance within 10% of the optimal.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Towards optimal load management with day ahead pricing\",\"authors\":\"M. R. Rao, J. Kuri, T. V. Prabhakar\",\"doi\":\"10.1109/COMSNETS.2015.7098699\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Demand Response is under implementation throughout the globe by many utilities to incorporate the end user as an active player in reducing supply-demand imbalances. Day-ahead pricing is provided as an option to schedule electric loads so as to take advantage of time-varying prices. However, user convenience is also a factor that must be taken into account, as users may be willing to forego some savings to reduce inconvenience. We formulate an optimal scheduling problem considering both aspects. As the search space is exponentially large, we propose two greedy algorithms to find good schedules. To assess performance, we obtain the optimal schedule via Markov Chain Monte Carlo (MCMC) based simulations. We apply the framework to two case studies; one study uses appliance energy profiles obtained by actual measurements using the Joule Jotter, a device designed and developed in-house. Results indicate that the proposed algorithms perform very well, achieving performance within 10% of the optimal.\",\"PeriodicalId\":277593,\"journal\":{\"name\":\"2015 7th International Conference on Communication Systems and Networks (COMSNETS)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 7th International Conference on Communication Systems and Networks (COMSNETS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2015.7098699\",\"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 7th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2015.7098699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

需求响应正在全球范围内由许多公用事业公司实施,以使最终用户成为减少供需不平衡的积极参与者。日前电价作为电力负荷调度的一种选择,以利用时变电价。然而,用户的便利性也是一个必须考虑的因素,因为用户可能愿意放弃一些储蓄来减少不便。我们提出了一个考虑这两方面的最优调度问题。由于搜索空间是指数级的,我们提出了两种贪心算法来寻找好的调度。为了评估性能,我们通过基于马尔可夫链蒙特卡罗(MCMC)的模拟获得了最优调度。我们将该框架应用于两个案例研究;一项研究使用了内部设计和开发的焦耳记录仪,通过实际测量获得的电器能量曲线。结果表明,所提出的算法性能良好,性能在最优值的10%以内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Towards optimal load management with day ahead pricing
Demand Response is under implementation throughout the globe by many utilities to incorporate the end user as an active player in reducing supply-demand imbalances. Day-ahead pricing is provided as an option to schedule electric loads so as to take advantage of time-varying prices. However, user convenience is also a factor that must be taken into account, as users may be willing to forego some savings to reduce inconvenience. We formulate an optimal scheduling problem considering both aspects. As the search space is exponentially large, we propose two greedy algorithms to find good schedules. To assess performance, we obtain the optimal schedule via Markov Chain Monte Carlo (MCMC) based simulations. We apply the framework to two case studies; one study uses appliance energy profiles obtained by actual measurements using the Joule Jotter, a device designed and developed in-house. Results indicate that the proposed algorithms perform very well, achieving performance within 10% of the optimal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GSM-based positioning for public transportation commuters Passing the torch: Role alternation for fair energy usage in D2D group communication Performance analysis of parameters affecting power efficiency in networks BlinkToSCoAP: An end-to-end security framework for the Internet of Things Contextual sensitivity of the ambient temperature sensor in Smartphones
×
引用
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