基于真实组合拍卖的大规模居民用户调控准备金聚集方法

IF 8.6 1区 工程技术 Q1 ENERGY & FUELS IEEE Transactions on Sustainable Energy Pub Date : 2024-10-14 DOI:10.1109/TSTE.2024.3479451
Shibo Chen;Wenjie Liu;Zhenwei Guo;Suhan Zhang;Zaiyue Yang;Chi Yung Chung
{"title":"基于真实组合拍卖的大规模居民用户调控准备金聚集方法","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":"{\"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}","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

摘要

灵活负荷的激增使住宅用户能够为电网提供向上和向下的频率调节储备。由于最低投标规模等障碍,电量相对较小的住宅用户必须经过聚合才能进入备用市场。然而,大量的住宅用户使得聚合机制设计问题成为一项具有挑战性的任务。特别是,每个用户的储备准备成本不仅具有高度异质性,而且通过时间维度和上下调节方向耦合。为了让用户充分表达自己的成本,本文提出了一种组合反向拍卖(CRA)框架作为用户聚合的市场机制。在本次拍卖中,集成商作为拍卖商,从居民用户处获取储备。用户提交由多个时隙的上行和下行储备组合组成的包投标,从而捕获用户成本中的耦合。此外,为了解决大规模组合拍卖的计算挑战,我们开发了一种新的快速组合拍卖(FCA)机制,可以在多项式时间内解决。它包括一个近似赢家确定算法和一个临界支付方案。值得注意的是,我们提出的机制被严格证明具有理想的经济属性,如真实性和个人合理性。大量的仿真验证了所提出的CRA机制的理论特性及其相对于现有方法的优势。特别是,与广泛使用的真实维克里-克拉克-格罗夫斯(VCG)机制相比,当用户数量大于1000时,CRA可以比VCG快10^{4}$。同时能够实现接近最优的社会成本,其中平均最优损失为2.92%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Aggregating Large-Scale Residential Users for Regulation Reserve Provision: Truthful Combinatorial Auction Based Approach
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%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Table of Contents IEEE Collabratec Get Published in the New IEEE Open Access Journal of Power and Energy Share Your Preprint Research with the World! IEEE Transactions on Sustainable Energy Information for Authors
×
引用
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