Aggregating Large-Scale Residential Users for Regulation Reserve Provision: Truthful Combinatorial Auction Based Approach

IF 8.6 1区 工程技术 Q1 ENERGY & FUELS
Shibo Chen;Wenjie Liu;Zhenwei Guo;Suhan Zhang;Zaiyue Yang;Chi Yung Chung
{"title":"Aggregating Large-Scale Residential Users for Regulation Reserve Provision: Truthful Combinatorial Auction Based Approach","authors":"Shibo Chen;Wenjie Liu;Zhenwei Guo;Suhan Zhang;Zaiyue Yang;Chi Yung Chung","doi":"10.1109/TSTE.2024.3479451","DOIUrl":null,"url":null,"abstract":"The proliferation of flexible loads has empowered residential users in contributing both upward and downward frequency regulation reserves to the power grid. Due to barriers like minimum bid size, residential users with relatively small power consumption must be aggregated before they can enter the reserve market. However, the large number of residential users renders the aggregation mechanism design problem a challenging task. In particular, the cost for reserve provision of each user is not only highly heterogeneous, but also coupled through both the temporal dimension and the up/down regulation direction. In order to allow the users to fully express their costs, in this paper, we propose a combinatorial reverse auction (CRA) framework as the market mechanism for user aggregation. In this auction, the aggregator is the auctioneer and procures reserves from residential users. The users submit package bids consisting of combinations of both upward and downward reserves over multiple time-slots, capturing the coupling in the user cost. Furthermore, to address the infamous computational challenges of large-scale combinatorial auctions, we develop a novel fast combinatorial auction (FCA) mechanism that can be solved in polynomial time. It includes an approximate winner determination algorithm and a critical payment scheme. Notably, our proposed mechanism is rigorously proved to possess desirable economic properties such as truthfulness and individual rationality. Extensive simulations have validated the theoretic properties of the proposed CRA mechanism and its advantages over existing methods. In particular, compared with the widely employed truthful Vickery-Clarke-Groves (VCG) mechanism, CRA can be \n<inline-formula><tex-math>$10^{4}$</tex-math></inline-formula>\n times faster than VCG when the user number is above 1000. Meanwhile, it is able to achieve near-optimal social cost, where the average optimality loss is 2.92%.","PeriodicalId":452,"journal":{"name":"IEEE Transactions on Sustainable Energy","volume":"16 1","pages":"686-699"},"PeriodicalIF":8.6000,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Sustainable Energy","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10715698/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
引用次数: 0

Abstract

The proliferation of flexible loads has empowered residential users in contributing both upward and downward frequency regulation reserves to the power grid. Due to barriers like minimum bid size, residential users with relatively small power consumption must be aggregated before they can enter the reserve market. However, the large number of residential users renders the aggregation mechanism design problem a challenging task. In particular, the cost for reserve provision of each user is not only highly heterogeneous, but also coupled through both the temporal dimension and the up/down regulation direction. In order to allow the users to fully express their costs, in this paper, we propose a combinatorial reverse auction (CRA) framework as the market mechanism for user aggregation. In this auction, the aggregator is the auctioneer and procures reserves from residential users. The users submit package bids consisting of combinations of both upward and downward reserves over multiple time-slots, capturing the coupling in the user cost. Furthermore, to address the infamous computational challenges of large-scale combinatorial auctions, we develop a novel fast combinatorial auction (FCA) mechanism that can be solved in polynomial time. It includes an approximate winner determination algorithm and a critical payment scheme. Notably, our proposed mechanism is rigorously proved to possess desirable economic properties such as truthfulness and individual rationality. Extensive simulations have validated the theoretic properties of the proposed CRA mechanism and its advantages over existing methods. In particular, compared with the widely employed truthful Vickery-Clarke-Groves (VCG) mechanism, CRA can be $10^{4}$ times faster than VCG when the user number is above 1000. Meanwhile, it is able to achieve near-optimal social cost, where the average optimality loss is 2.92%.
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Sustainable Energy
IEEE Transactions on Sustainable Energy ENERGY & FUELS-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
21.40
自引率
5.70%
发文量
215
审稿时长
5 months
期刊介绍: The IEEE Transactions on Sustainable Energy serves as a pivotal platform for sharing groundbreaking research findings on sustainable energy systems, with a focus on their seamless integration into power transmission and/or distribution grids. The journal showcases original research spanning the design, implementation, grid-integration, and control of sustainable energy technologies and systems. Additionally, the Transactions warmly welcomes manuscripts addressing the design, implementation, and evaluation of power systems influenced by sustainable energy systems and devices.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信