IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v64y2016i6p1482-1498.html
   My bibliography  Save this article

Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment

Author

Listed:
  • Kai Pan

    (Department of Logistics and Maritime Studies, Faculty of Business, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong)

  • Yongpei Guan

    (Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611)

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.

Suggested Citation

  • Kai Pan & Yongpei Guan, 2016. "Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment," Operations Research, INFORMS, vol. 64(6), pages 1482-1498, December.
    • Handle: RePEc:inm:oropre:v:64:y:2016:i:6:p:1482-1498
    DOI: 10.1287/opre.2016.1520
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2016.1520
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2016.1520?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Santiago Cerisola & Álvaro Baíllo & José M. Fernández-López & Andrés Ramos & Ralf Gollmer, 2009. "Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods," Operations Research, INFORMS, vol. 57(1), pages 32-46, February.
    2. GÜNLÜK, Oktay & POCHET, Yves, 2001. "Mixing mixed-integer inequalities," LIDAM Reprints CORE 1504, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Guglielmo Lulli & Suvrajeet Sen, 2004. "A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems," Management Science, INFORMS, vol. 50(6), pages 786-796, June.
    4. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    5. Caroe, Claus C. & Tind, Jorgen, 1997. "A cutting-plane approach to mixed 0-1 stochastic integer programs," European Journal of Operational Research, Elsevier, vol. 101(2), pages 306-316, September.
    6. Yongpei Guan & Shabbir Ahmed & George L. Nemhauser, 2009. "Cutting Planes for Multistage Stochastic Integer Programs," Operations Research, INFORMS, vol. 57(2), pages 287-298, April.
    7. Kai Huang & Shabbir Ahmed, 2009. "The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty," Operations Research, INFORMS, vol. 57(4), pages 893-904, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bismark Singh & David P. Morton & Surya Santoso, 2018. "An adaptive model with joint chance constraints for a hybrid wind-conventional generator system," Computational Management Science, Springer, vol. 15(3), pages 563-582, October.
    2. Briest, Gordon & Lauven, Lars-Peter & Kupfer, Stefan & Lukas, Elmar, 2022. "Leaving well-worn paths: Reversal of the investment-uncertainty relationship and flexible biogas plant operation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1162-1176.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jianqiu Huang & Kai Pan & Yongpei Guan, 2021. "Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 352-369, January.
    2. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).
    3. Eyyüb Y. Kıbış & İ. Esra Büyüktahtakın & Robert G. Haight & Najmaddin Akhundov & Kathleen Knight & Charles E. Flower, 2021. "A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 808-834, May.
    4. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    5. Yongpei Guan, 2011. "Stochastic lot-sizing with backlogging: computational complexity analysis," Journal of Global Optimization, Springer, vol. 49(4), pages 651-678, April.
    6. Onur Tavaslıoğlu & Oleg A. Prokopyev & Andrew J. Schaefer, 2019. "Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function," Operations Research, INFORMS, vol. 67(6), pages 1659-1677, November.
    7. Bülbül, Kerem & Noyan, Nilay & Erol, Hazal, 2021. "Multi-stage stochastic programming models for provisioning cloud computing resources," European Journal of Operational Research, Elsevier, vol. 288(3), pages 886-901.
    8. Bansal, Manish & Mehrotra, Sanjay, 2019. "On solving two-stage distributionally robust disjunctive programs with a general ambiguity set," European Journal of Operational Research, Elsevier, vol. 279(2), pages 296-307.
    9. ARAVENA, Ignacio & PAPAVASILIOU, Anthony, 2016. "An Asynchronous Distributed Algorithm for solving Stochastic Unit Commitment," LIDAM Discussion Papers CORE 2016038, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. Lara, Cristiana L. & Mallapragada, Dharik S. & Papageorgiou, Dimitri J. & Venkatesh, Aranya & Grossmann, Ignacio E., 2018. "Deterministic electric power infrastructure planning: Mixed-integer programming model and nested decomposition algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1037-1054.
    11. Ursavas, Evrim, 2017. "A benders decomposition approach for solving the offshore wind farm installation planning at the North Sea," European Journal of Operational Research, Elsevier, vol. 258(2), pages 703-714.
    12. Kai Pan & Yongpei Guan, 2022. "Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1819-1840, May.
    13. Nickel, Stefan & Saldanha-da-Gama, Francisco & Ziegler, Hans-Peter, 2012. "A multi-stage stochastic supply network design problem with financial decisions and risk management," Omega, Elsevier, vol. 40(5), pages 511-524.
    14. Ward Romeijnders & Niels van der Laan, 2020. "Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty," Operations Research, INFORMS, vol. 68(4), pages 1199-1217, July.
    15. Torres-Rincón, Samuel & Sánchez-Silva, Mauricio & Bastidas-Arteaga, Emilio, 2021. "A multistage stochastic program for the design and management of flexible infrastructure networks," Reliability Engineering and System Safety, Elsevier, vol. 210(C).
    16. İ. Esra Büyüktahtakın, 2022. "Stage-t scenario dominance for risk-averse multi-stage stochastic mixed-integer programs," Annals of Operations Research, Springer, vol. 309(1), pages 1-35, February.
    17. Luis Montero & Antonio Bello & Javier Reneses, 2022. "A Review on the Unit Commitment Problem: Approaches, Techniques, and Resolution Methods," Energies, MDPI, vol. 15(4), pages 1-40, February.
    18. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    19. Zhili Zhou & Yongpei Guan, 2013. "Two-stage stochastic lot-sizing problem under cost uncertainty," Annals of Operations Research, Springer, vol. 209(1), pages 207-230, October.
    20. Manish Bansal & Yingqiu Zhang, 2021. "Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs," Journal of Global Optimization, Springer, vol. 81(2), pages 391-433, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:64:y:2016:i:6:p:1482-1498. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.