TY - JOUR
T1 - Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
AU - Pan, Kai
AU - Guan, Yongpei
N1 - Funding Information:
History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: Y. Guan was supported in part by the National Science Foundation [Grant 1609794]. Supplemental Material: The online supplement is available at https://doi.org/10.1287/ijoc.2021.1150.
Publisher Copyright:
© 2022 INFORMS Inst.for Operations Res.and the Management Sciences. All rights reserved.
PY - 2022/5
Y1 - 2022/5
N2 - The complexity of current electricity wholesale markets and the increased volatility of electricity prices because of the intermittent nature of renewable generation make independent power producers (IPPs) face significant challenges to submit offers. This challenge increases for those owning traditional coal-fired thermal generators and renewable generation. In this paper, an integrated stochastic optimal strategy is proposed for an IPP using the self-scheduling approach through its participation in both day-ahead and real-time markets (i.e., two-settlement electricity markets) as a price taker. In the proposed approach, the IPP submits an offer for all periods to the day-ahead market for which a multistage stochastic programming setting is explored for providing real-time market offers for each period as a recourse. This strategy has the advantage of achieving overall maximum profits for both markets in the given operational time horizon. Such a strategy is theoretically proved to be more profitable than alternative self-scheduling strategies as it takes advantage of the continuously realized scenario information of the renewable energy output and real-time prices over time. To improve computational efficiency, we explore polyhedral structures to derive strong valid inequalities, including convex hull descriptions for certain special cases, thus strengthening the formulation of our proposed model. Polynomial-time separation algorithms are then established for the derived exponential-sized inequalities to speed up the branch-and-cut process. Finally, both numerical and real case studies demonstrate the potential of the proposed strategy.
AB - The complexity of current electricity wholesale markets and the increased volatility of electricity prices because of the intermittent nature of renewable generation make independent power producers (IPPs) face significant challenges to submit offers. This challenge increases for those owning traditional coal-fired thermal generators and renewable generation. In this paper, an integrated stochastic optimal strategy is proposed for an IPP using the self-scheduling approach through its participation in both day-ahead and real-time markets (i.e., two-settlement electricity markets) as a price taker. In the proposed approach, the IPP submits an offer for all periods to the day-ahead market for which a multistage stochastic programming setting is explored for providing real-time market offers for each period as a recourse. This strategy has the advantage of achieving overall maximum profits for both markets in the given operational time horizon. Such a strategy is theoretically proved to be more profitable than alternative self-scheduling strategies as it takes advantage of the continuously realized scenario information of the renewable energy output and real-time prices over time. To improve computational efficiency, we explore polyhedral structures to derive strong valid inequalities, including convex hull descriptions for certain special cases, thus strengthening the formulation of our proposed model. Polynomial-time separation algorithms are then established for the derived exponential-sized inequalities to speed up the branch-and-cut process. Finally, both numerical and real case studies demonstrate the potential of the proposed strategy.
KW - innovative formulation
KW - renewable generation
KW - self-scheduling
KW - stochastic optimization
UR - http://www.scopus.com/inward/record.url?scp=85133485058&partnerID=8YFLogxK
U2 - 10.1287/ijoc.2021.1150
DO - 10.1287/ijoc.2021.1150
M3 - Journal article
SN - 1091-9856
VL - 34
SP - 1819
EP - 1840
JO - INFORMS Journal on Computing
JF - INFORMS Journal on Computing
IS - 3
ER -