IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v34y2022i3p1819-1840.html
   My bibliography  Save this article

Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets

Author

Listed:
  • Kai Pan

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

  • Yongpei Guan

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

Abstract

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. Summary of Contribution: This paper develops innovative models and methods to study a family of practically important problems via the interactions of operations research and computing. Specifically, this paper provides in-depth analyses of innovative stochastic optimization modeling approaches and develops computationally efficient polyhedral results. The paper also verifies the effectiveness of proposed analyses via extensive computing experiments.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:orijoc:v:34:y:2022:i:3:p:1819-1840
    DOI: 10.1287/ijoc.2021.1150
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2021.1150
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2021.1150?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. E. J. Anderson & A. B. Philpott, 2002. "Using Supply Functions for Offering Generation into an Electricity Market," Operations Research, INFORMS, vol. 50(3), pages 477-489, June.
    3. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    4. Nils Löhndorf & David Wozabal & Stefan Minner, 2013. "Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming," Operations Research, INFORMS, vol. 61(4), pages 810-823, August.
    5. Anthony Papavasiliou & Shmuel S. Oren, 2013. "Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network," Operations Research, INFORMS, vol. 61(3), pages 578-592, June.
    6. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    7. Maurice QUEYRANNE & Laurence A. WOLSEY, 2017. "Tight MIP formulations for bounded up/down times and interval-dependent start-ups," LIDAM Reprints CORE 2876, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Fleten, Stein-Erik & Hoyland, Kjetil & Wallace, Stein W., 2002. "The performance of stochastic dynamic and fixed mix portfolio models," European Journal of Operational Research, Elsevier, vol. 140(1), pages 37-49, July.
    9. Jean-Paul Watson & David Woodruff, 2011. "Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems," Computational Management Science, Springer, vol. 8(4), pages 355-370, November.
    10. 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.
    11. Jorge Valenzuela & Mainak Mazumdar, 2003. "Commitment of Electric Power Generators Under Stochastic Market Prices," Operations Research, INFORMS, vol. 51(6), pages 880-893, December.
    12. PAPAVASILIOU, Anthony & OREN, Schmuel S., 2013. "Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network," LIDAM Reprints CORE 2500, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Qipeng Zheng & Jianhui Wang & Panos Pardalos & Yongpei Guan, 2013. "A decomposition approach to the two-stage stochastic unit commitment problem," Annals of Operations Research, Springer, vol. 210(1), pages 387-410, November.
    Full references (including those not matched with items on IDEAS)

    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. Chao Li & Muhong Zhang & Kory Hedman, 2021. "Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1037-1055, July.
    3. Schulze, Tim & Grothey, Andreas & McKinnon, Ken, 2017. "A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 247-259.
    4. Trine K. Boomsma, 2019. "Comments on: A comparative study of time aggregation techniques in relation to power capacity-expansion modeling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(3), pages 406-409, October.
    5. Yonghan Feng & Sarah Ryan, 2016. "Solution sensitivity-based scenario reduction for stochastic unit commitment," Computational Management Science, Springer, vol. 13(1), pages 29-62, January.
    6. Melamed, Michal & Ben-Tal, Aharon & Golany, Boaz, 2018. "A multi-period unit commitment problem under a new hybrid uncertainty set for a renewable energy source," Renewable Energy, Elsevier, vol. 118(C), pages 909-917.
    7. Francisco Munoz & Jean-Paul Watson, 2015. "A scalable solution framework for stochastic transmission and generation planning problems," Computational Management Science, Springer, vol. 12(4), pages 491-518, October.
    8. Skolfield, J. Kyle & Escobedo, Adolfo R., 2022. "Operations research in optimal power flow: A guide to recent and emerging methodologies and applications," European Journal of Operational Research, Elsevier, vol. 300(2), pages 387-404.
    9. Majid Al-Gwaiz & Xiuli Chao & Owen Q. Wu, 2017. "Understanding How Generation Flexibility and Renewable Energy Affect Power Market Competition," Manufacturing & Service Operations Management, INFORMS, vol. 19(1), pages 114-131, February.
    10. 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).
    11. Ali Kakhbod & Asuman Ozdaglar & Ian Schneider, 2021. "Selling Wind," The Energy Journal, , vol. 42(1), pages 1-38, January.
    12. Site Wang & Harsha Gangammanavar & Sandra Ekşioğlu & Scott J. Mason, 2020. "Statistical estimation of operating reserve requirements using rolling horizon stochastic optimization," Annals of Operations Research, Springer, vol. 292(1), pages 371-397, September.
    13. 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.
    14. Luckny Zéphyr & C. Lindsay Anderson, 2018. "Stochastic dynamic programming approach to managing power system uncertainty with distributed storage," Computational Management Science, Springer, vol. 15(1), pages 87-110, January.
    15. Fattahi, Salar & Ashraphijuo, Morteza & Lavaei, Javad & Atamtürk, Alper, 2017. "Conic relaxations of the unit commitment problem," Energy, Elsevier, vol. 134(C), pages 1079-1095.
    16. Lee, Jinkyu & Bae, Sanghyeon & Kim, Woo Chang & Lee, Yongjae, 2023. "Value function gradient learning for large-scale multistage stochastic programming problems," European Journal of Operational Research, Elsevier, vol. 308(1), pages 321-335.
    17. Faezeh Akhavizadegan & Lizhi Wang & James McCalley, 2020. "Scenario Selection for Iterative Stochastic Transmission Expansion Planning," Energies, MDPI, vol. 13(5), pages 1-18, March.
    18. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    19. Kevin Ryan & Shabbir Ahmed & Santanu S. Dey & Deepak Rajan & Amelia Musselman & Jean-Paul Watson, 2020. "Optimization-Driven Scenario Grouping," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 805-821, July.
    20. Fan, Yingjie & Schwartz, Frank & Voß, Stefan, 2017. "Flexible supply chain planning based on variable transportation modes," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 654-666.

    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:orijoc:v:34:y:2022:i:3:p:1819-1840. 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.