Optimization of Bidding Mode for Capacity Market Considering The Participation of New Energy

Authors

  • Qinchen Yang
  • Man Jin
  • Anbang Xie
  • Huixuan Li
  • Shuo Yin

DOI:

https://doi.org/10.54691/rmr23z85

Keywords:

New Energy, Capacity Market, Bidding Mode, Power Cost.

Abstract

One of the construction purposes of the capacity market is to solve the problem of fixed cost recovery of power sources in the pure energy market based on variable cost bidding. With the continuous deepening of the construction of new power systems, more new energy entities will participate in providing capacity resources. If the capacity market lacks consideration for the differences in power cost structure, it will be difficult to meet the different cost recovery demands of various power sources, which will affect the accurate generation of investment incentive signals. This article analyzes the capacity market construction problem under the current differentiated power supply cost structure, proposes a capacity market mechanism design scheme for differentiated power supply cost structure, and verifies it through numerical examples.

Downloads

Download data is not yet available.

References

[1] Z .Ouyang, S.M. Shahidehpour. An intelligent dynamic programming for unit commitment application[J].IEEE Transactions on Power Systems, 1991, 6(3):1203 1209.

[2] B. Palmintier, M. Webster. Heterogeneous unit clustering for efficient operational flexibility modeling [J].IEEE Transactions on Power Systems, 2014, 29(3):1089 1098.

[3] J. Meus, K. Poncelet, E. Delarue. Applicability of A Clustered Unit Commitment Model in Power System Modeling[J]. IEEE Transactions on Power Systems, 2018, 33(2): 2195-2204.

[4] Matteo Fischetti, Fred Glover, Andrea Lodi. The feasibility pump[J]. Mathematical Programming, 2005, 104(1): 91 104.

[5] Bertacco L, Fischetti M, Lodi A. A feasibility pump Heuristic for general mixed-integer problems. Disc Optim, 2007, 4: 63–76.

[6] Achterberg T, Berthold T. Improving the feasibility pump. Disc Optim, 2007, 4: 77–86.

Downloads

Published

2025-06-18

Issue

Section

Articles