Fully distributed convex hull pricing based on alternating direction method of multipliers

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
{"title":"Fully distributed convex hull pricing based on alternating direction method of multipliers","authors":"","doi":"10.1016/j.cor.2024.106823","DOIUrl":null,"url":null,"abstract":"<div><p>In certain power markets, due to the non-convex operation characteristics, generators adhering to the decisions of Independent System Operators (ISO) may struggle to recover costs through local marginal energy sales. ISOs impose discriminatory additional payments as incentives for generator compliance. Convex hull pricing is a unified scheme that significantly reduces these supplementary payments. The Lagrangian dual problem of the Unit Commitment (UC) problem is solved within the dual space to determine convex hull prices. To navigate the computational challenges posed by the real large-scale power systems, we propose a methodology for a global convergence distributed solution, which addresses the Lagrangian dual problem. This methodology is based on the Alternating Direction Method of Multipliers (ADMM) algorithm and incorporates convex hull cut planes to enhance computational efficiency. Moreover, a tight and compact UC model is employed to reduce the number of iterations. Numerical results indicate that if the convex hull descriptions of units can be obtained, our algorithm is capable of providing precise convex hull prices and high-quality solutions within a feasible timeframe, while also maintaining the confidentiality of individual subset unit information.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824002958","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In certain power markets, due to the non-convex operation characteristics, generators adhering to the decisions of Independent System Operators (ISO) may struggle to recover costs through local marginal energy sales. ISOs impose discriminatory additional payments as incentives for generator compliance. Convex hull pricing is a unified scheme that significantly reduces these supplementary payments. The Lagrangian dual problem of the Unit Commitment (UC) problem is solved within the dual space to determine convex hull prices. To navigate the computational challenges posed by the real large-scale power systems, we propose a methodology for a global convergence distributed solution, which addresses the Lagrangian dual problem. This methodology is based on the Alternating Direction Method of Multipliers (ADMM) algorithm and incorporates convex hull cut planes to enhance computational efficiency. Moreover, a tight and compact UC model is employed to reduce the number of iterations. Numerical results indicate that if the convex hull descriptions of units can be obtained, our algorithm is capable of providing precise convex hull prices and high-quality solutions within a feasible timeframe, while also maintaining the confidentiality of individual subset unit information.

基于交替方向乘法的全分布式凸壳定价
在某些电力市场,由于非凸运行特性,遵守独立系统运营商(ISO)决定的发电商可能很难通过当地边际能源销售收回成本。独立系统运营商为鼓励发电商遵守规定,会收取歧视性的额外费用。凸壳定价是一种统一的方案,可显著减少这些附加费用。单位承诺(UC)问题的拉格朗日对偶问题在对偶空间内求解,以确定凸壳价格。为了应对实际大规模电力系统带来的计算挑战,我们提出了一种全局收敛分布式求解方法,以解决拉格朗日对偶问题。该方法基于交替方向乘法(ADMM)算法,并结合了凸壳切割平面以提高计算效率。此外,还采用了紧凑的 UC 模型来减少迭代次数。数值结果表明,如果能获得单元的凸壳描述,我们的算法就能在可行的时间内提供精确的凸壳价格和高质量的解决方案,同时还能保持单个子集单元信息的机密性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信