A Tempo-Spatially Clustered Unit Commitment with Long-Cycle Storage Dispatch

Jingbo Wang, Ce Shang
{"title":"A Tempo-Spatially Clustered Unit Commitment with Long-Cycle Storage Dispatch","authors":"Jingbo Wang, Ce Shang","doi":"10.1109/EI256261.2022.10116870","DOIUrl":null,"url":null,"abstract":"Unit commitment that addresses the flexibility restrictions of power system operation that other routines like (optimal) power flow cannot, has been given more expectation for large-scale long-term scenarios, while its computational efficiency hinders its deployment, especially with a large number of binary variables. The typical reduction method — temporal clustering method cannot be applied to systems with long-cycle storages because of the loss of chronological information. A new framework of reformulated unit commitment composed of both temporal clustering with clustering index and unit clustering in the spatial dimension is proposed here, which aims at combining the advantages of the two clustering methods for unit commitment to suffice as the operation routine in large-scale long-term long-cycle storages equipped power system optimizations. The entire tempo-spatially clustered unit commitment with long-cycle storage dispatch is evaluated on a 118-node 54-unit system.","PeriodicalId":413409,"journal":{"name":"2022 IEEE 6th Conference on Energy Internet and Energy System Integration (EI2)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 6th Conference on Energy Internet and Energy System Integration (EI2)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EI256261.2022.10116870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Unit commitment that addresses the flexibility restrictions of power system operation that other routines like (optimal) power flow cannot, has been given more expectation for large-scale long-term scenarios, while its computational efficiency hinders its deployment, especially with a large number of binary variables. The typical reduction method — temporal clustering method cannot be applied to systems with long-cycle storages because of the loss of chronological information. A new framework of reformulated unit commitment composed of both temporal clustering with clustering index and unit clustering in the spatial dimension is proposed here, which aims at combining the advantages of the two clustering methods for unit commitment to suffice as the operation routine in large-scale long-term long-cycle storages equipped power system optimizations. The entire tempo-spatially clustered unit commitment with long-cycle storage dispatch is evaluated on a 118-node 54-unit system.
具有长周期存储调度的时间空间集群单元承诺
单元承诺解决了电力系统运行的灵活性限制,这是(最优)潮流等其他例程无法做到的,在大规模的长期场景中被赋予了更多的期望,但其计算效率阻碍了其部署,特别是在大量二元变量的情况下。由于时间信息的丢失,典型的约简方法——时间聚类方法不能应用于具有长周期存储的系统。本文提出了一种由具有聚类指标的时间聚类和空间维度上的单元聚类两种聚类方法组成的重新表述的机组承诺框架,旨在结合两种聚类方法在机组承诺方面的优势,使其能够满足大规模长周期储能系统配置优化中的运行常规。在一个118节点54单元系统上,对具有长周期存储调度的整个时空集群单元承诺进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信