A Bi-level model for strategic bidding of virtual power plant in day-ahead and balancing market

M. Shafiekhani, A. Badri, Farshad Khavari
{"title":"A Bi-level model for strategic bidding of virtual power plant in day-ahead and balancing market","authors":"M. Shafiekhani, A. Badri, Farshad Khavari","doi":"10.1109/SGC.2017.8308833","DOIUrl":null,"url":null,"abstract":"Today, with the reduced fossil fuel resources and increased environmental concerns, considering the increased use of renewable energy sources in power grids appears to be essential given the great benefits of these resources. The virtual power plant is an extensive energy management system to gather the capacity of interruptible loads, storage devices and distributed products to provide support services for the system and the energy marketing. The main objective of this paper is to provide a method for an optimal virtual power plant bidding strategy considering rivals in a joint day-ahead and balancing market. To this end, a bi-level mathematical optimization model with equilibrium constraints is provided. The first level of this model includes the maximization of the virtual power plant profits, while its second level involves maximizing the level of social welfare. The bi-level model is converted to a Mixed-Integer Linear Programming model using the theory of duality and Karush-Kuhn-Tucker (KKT) optimization conditions. The mentioned model is tested on the Standard IEEE 24-Bus network, which results indicated its effectiveness.","PeriodicalId":346749,"journal":{"name":"2017 Smart Grid Conference (SGC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Smart Grid Conference (SGC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SGC.2017.8308833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Today, with the reduced fossil fuel resources and increased environmental concerns, considering the increased use of renewable energy sources in power grids appears to be essential given the great benefits of these resources. The virtual power plant is an extensive energy management system to gather the capacity of interruptible loads, storage devices and distributed products to provide support services for the system and the energy marketing. The main objective of this paper is to provide a method for an optimal virtual power plant bidding strategy considering rivals in a joint day-ahead and balancing market. To this end, a bi-level mathematical optimization model with equilibrium constraints is provided. The first level of this model includes the maximization of the virtual power plant profits, while its second level involves maximizing the level of social welfare. The bi-level model is converted to a Mixed-Integer Linear Programming model using the theory of duality and Karush-Kuhn-Tucker (KKT) optimization conditions. The mentioned model is tested on the Standard IEEE 24-Bus network, which results indicated its effectiveness.
日前均衡市场下虚拟电厂策略竞价的双层模型
今天,随着矿物燃料资源的减少和环境问题的增加,考虑到这些资源的巨大利益,在电网中增加使用可再生能源似乎是必不可少的。虚拟电厂是一个广泛的能源管理系统,它收集可中断负荷、存储设备和分布式产品的容量,为系统和能源营销提供支持服务。本文的主要目的是提供一种联合日前平衡市场中考虑竞争对手的最优虚拟电厂报价策略的方法。为此,提出了一个具有均衡约束的双层数学优化模型。该模型的第一级涉及虚拟电厂利润最大化,第二级涉及社会福利水平最大化。利用对偶理论和KKT (Karush-Kuhn-Tucker)优化条件,将双层模型转化为混合整数线性规划模型。该模型在标准IEEE 24总线网络上进行了测试,结果表明了该模型的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信