Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/98369
| Title: | Strong formulations for multistage stochastic self-scheduling unit commitment | Authors: | Pan, K Guan, Y |
Issue Date: | Nov-2016 | Source: | Operations research, Nov.-Dec. 2016, v. 64, no. 6, p. 1482-1498 | Abstract: | With the increasing penetration of renewable energy into the power grid system, the volatility of real-time electricity prices increases significantly. This brings challenges for independent power producers to provide optimal bidding strategies. The traditional approaches of only attending the day-ahead market might not be profitable enough without taking advantage of real-time price volatility. In this paper, we study the optimal bidding strategies for the independent power producers utilizing self-scheduling strategies to participate in the real-time market considering real-time electricity price volatility, with the objective of maximizing the total expected profit. Considering the correlations of renewable energy generation outputs among different time periods, the correlations of real-time prices are captured in our modeling framework, in which we explore a multistage stochastic scenario tree to formulate the price uncertainties. Accordingly, the derived multistage stochastic self-scheduling unit commitment problem is transformed as a deterministic equivalent mixed-integer linear programming formulation. To overcome the curse of dimensionality, we develop strong valid inequalities for the derived stochastic unit commitment polytope to speed up the algorithms to solve the problem. In particular, we derive strong valid inequalities that can provide the convex hull descriptions for the two-period case and a special class of the three-period cases with rigorous proofs provided. Furthermore, strong valid inequalities, including facet-defining proofs, for multistage cases are proposed to further strengthen the model. Finally, numerical experiments verify the effectiveness of our derived strong valid inequalities by incorporating them in a branch-and-cut framework. | Keywords: | Cutting planes Self-scheduling unit commitment Stochastic integer programming |
Publisher: | Institute for Operations Research and the Management Sciences | Journal: | Operations research | ISSN: | 0030-364x | EISSN: | 1526-5463 | DOI: | 10.1287/opre.2016.1520 | Rights: | © 2016 INFORMS This is the accepted manuscript of the following article: Pan, K., & Guan, Y. (2016). Strong formulations for multistage stochastic self-scheduling unit commitment. Operations Research, 64(6), 1482-1498, which has been published in final form at https://doi.org/10.1287/opre.2016.1520. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Pan_Strong_Formulations_Multistage.pdf | Pre-Published version | 1.15 MB | Adobe PDF | View/Open |
Page views
79
Citations as of Apr 14, 2025
Downloads
93
Citations as of Apr 14, 2025
SCOPUSTM
Citations
13
Citations as of Dec 19, 2025
WEB OF SCIENCETM
Citations
10
Citations as of Oct 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



