Dealing with storage without forecasts in smart grids: problem transformation and online scheduling algorithm

G. Georgiadis, M. Papatriantafilou
{"title":"Dealing with storage without forecasts in smart grids: problem transformation and online scheduling algorithm","authors":"G. Georgiadis, M. Papatriantafilou","doi":"10.1145/2554850.2554943","DOIUrl":null,"url":null,"abstract":"Renewable and distributed energy sources are today possible but these technologies bring benefits as well as challenges, such as their intermittent nature, that leads to utilization problems for the power grid. On the other hand, upcoming storage technologies, such as electric vehicles, hold the potential to store and utilize this intermittent supply at a later time but bring challenges of their own, for example efficient storage utilization and intermittent energy demand. In this paper we propose a novel modelling of the problem of unforecasted energy dispatch with storage as an online scheduling problem of tasks on machines, by transforming time constraints of energy requests into equivalent machine constraints as well as by modelling energy storage through the extension of existing online scheduling techniques with the concept of load credit. Based on this transformation, we also present an algorithm that dispatches load and utilizes efficiently any storage capabilities in order to mitigate the effect of unreliable or non-existent demand forecasts, and we prove that the resulting solution's competitive ratio is within a logarithmic factor of the optimal offline solution. Finally, we provide an extensive simulation study for a variety of scenarios based on data from a large network of consumers, showing that the presented algorithm is highly competitive even to methods that assume exact knowledge about the demand requests.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2554850.2554943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Renewable and distributed energy sources are today possible but these technologies bring benefits as well as challenges, such as their intermittent nature, that leads to utilization problems for the power grid. On the other hand, upcoming storage technologies, such as electric vehicles, hold the potential to store and utilize this intermittent supply at a later time but bring challenges of their own, for example efficient storage utilization and intermittent energy demand. In this paper we propose a novel modelling of the problem of unforecasted energy dispatch with storage as an online scheduling problem of tasks on machines, by transforming time constraints of energy requests into equivalent machine constraints as well as by modelling energy storage through the extension of existing online scheduling techniques with the concept of load credit. Based on this transformation, we also present an algorithm that dispatches load and utilizes efficiently any storage capabilities in order to mitigate the effect of unreliable or non-existent demand forecasts, and we prove that the resulting solution's competitive ratio is within a logarithmic factor of the optimal offline solution. Finally, we provide an extensive simulation study for a variety of scenarios based on data from a large network of consumers, showing that the presented algorithm is highly competitive even to methods that assume exact knowledge about the demand requests.
智能电网无预测存储处理:问题转换与在线调度算法
可再生能源和分布式能源在今天是可能的,但这些技术带来了好处和挑战,例如它们的间歇性,导致电网的利用问题。另一方面,即将到来的存储技术,如电动汽车,具有存储和利用这种间歇性供应的潜力,但也带来了自己的挑战,例如高效的存储利用和间歇性的能源需求。本文通过将能量请求的时间约束转换为等效的机器约束,并通过扩展现有的在线调度技术,用负荷信用的概念对储能进行建模,提出了一种新的模型,将不可预测的储能能源调度问题作为机器上的任务在线调度问题。基于这种转换,我们还提出了一种算法,该算法可以有效地调度负载并利用任何存储能力,以减轻不可靠或不存在的需求预测的影响,并且我们证明了所得到的解决方案的竞争比在最优离线解决方案的对数因子内。最后,我们基于来自大型消费者网络的数据,对各种场景进行了广泛的模拟研究,表明所提出的算法甚至比假设对需求请求有确切了解的方法具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信