Towards the development of risk-constrained optimal bidding strategies for generation companies in electricity markets

被引:32
|
作者
Ma, XS
Wen, FS
Nia, YX
Liu, HX
机构
[1] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China
[2] N China Elect Power Univ, Dept Elect Engn, Baoding 071003, Peoples R China
关键词
electricity market; sealed auction; bidding strategy; risk analysis;
D O I
10.1016/j.epsr.2004.07.004
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In the competitive electricity market environment, generation dispatching is bid-based, and individual generation companies (Gencos) are required to compete with rivals through bidding to the market. Competition implies the opportunities for Gencos to get more profit and, in the meantime, the risk of not being dispatched. As a result, it has become a major concern for Gencos to build optimal bidding strategies so as to maximize profits while minimizing risks associated. In this paper, a new approach is developed for building optimal bidding strategies with risks taken into account for Gencos participating in a pool-based single-buyer electricity market. It is assumed that each Genco bids a linear supply function and that the system is dispatched to minimize the total purchasing cost of the single-buyer. Each Genco chooses the coefficients in the linear supply function for making tradeoff between two conflicting objectives: profit maximization and risk minimization. A stochastic optimization model is established for the purpose and a novel method for solving this problem is presented. Numerical test results for a simulated electricity market with six Gencos show clearly the essential features of the developed model and method. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:305 / 312
页数:8
相关论文
共 50 条
  • [21] Optimal bidding strategies with risks for LSEs in competitive electricity markets
    Liu, Haoming
    Chen, Xingying
    Xie, Jun
    Yu, Kun
    Liao, Yingchen
    2007 IEEE POWER ENGINEERING SOCIETY GENERAL MEETING, VOLS 1-10, 2007, : 2727 - +
  • [22] Optimal bidding strategies in electricity markets using reinforcement learning
    Wu, QH
    Guo, J
    Turner, DR
    Wu, ZX
    Zhou, XX
    ELECTRIC POWER COMPONENTS AND SYSTEMS, 2004, 32 (02) : 175 - 192
  • [23] Risk-Constrained Optimal Bidding Strategy for Pairing of Wind and Demand Response Resources
    Asensio, Miguel
    Contreras, Javier
    IEEE TRANSACTIONS ON SMART GRID, 2017, 8 (01) : 200 - 208
  • [24] Bidding strategies in dynamic electricity markets
    Kian, AR
    Cruz, JB
    DECISION SUPPORT SYSTEMS, 2005, 40 (3-4) : 543 - 551
  • [25] Development of bidding strategies in electricity markets using possibility theory
    Li, Y
    Wen, FS
    Wu, FF
    Ni, YX
    Qiu, JJ
    POWERCON 2002: INTERNATIONAL CONFERENCE ON POWER SYSTEM TECHNOLOGY, VOLS 1-4, PROCEEDINGS, 2002, : 182 - 187
  • [26] Optimal bidding strategies for LSEs in single-bargainer electricity markets
    Wang, Ping
    Chen, Xingying
    Xie, Jun
    Liao, Yingchen
    Liu, Haoming
    2008 THIRD INTERNATIONAL CONFERENCE ON ELECTRIC UTILITY DEREGULATION AND RESTRUCTURING AND POWER TECHNOLOGIES, VOLS 1-6, 2008, : 510 - 514
  • [27] Optimal Demand-Side Bidding Strategies in Electricity Spot Markets
    Herranz, Rocio
    Munoz San Roque, Antonio
    Villar, Jose
    Alberto Campos, Fco.
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2012, 27 (03) : 1204 - 1213
  • [28] Risk-constrained bidding strategy for wind power producer in day-ahead and balancing markets
    Tahmasebi, Mehrdad
    Pasupuleti, Jagadeesh
    Askari, Mohammad Tolou
    Khan, M. Reyasudin Basir
    JOURNAL OF ELECTRICAL SYSTEMS, 2018, 14 (04) : 34 - 47
  • [29] Risk-constrained bidding strategy with stochastic unit commitment
    Li, Tao
    Shahidehpour, Mohammad
    Li, Zuyi
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2007, 22 (01) : 449 - 458
  • [30] RISK-CONSTRAINED OPTIMAL BIDDING STRATEGY FOR A GENERATION COMPANY USING SELF-ORGANIZING HIERARCHICAL PARTICLE SWARM OPTIMIZATION
    Boonchuay, Chanwit
    Ongsakul, Weerakorn
    APPLIED ARTIFICIAL INTELLIGENCE, 2012, 26 (03) : 246 - 260