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

Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services

Author

Listed:
  • Jianqiu Huang

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

  • 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

With the increasing penetration of intermittent renewable energy and fluctuating electricity loads, power system operators are facing significant challenges in maintaining system load balance and reliability. In addition to traditional energy markets that are designed to balance power generation and load, ancillary service markets have been recently introduced to help manage the considerable uncertainty by reserving certain generation capacities against unexpected events. In this paper, we develop a multistage stochastic optimization model for system operators to efficiently schedule power-generation assets to co-optimize power generation and regulation reserve service (a critical ancillary service product) under uncertainty. In addition, to improve the computational efficiency of the proposed multistage stochastic integer program, we explore its polyhedral structure by investigating physical characteristics of individual generators, the system-wide requirements that couple all of the generators, and the scenario tree structure for our proposed multistage model. We start with the single-generator polytope and provide convex hull descriptions for the two-period case under different parameter settings. We then provide several families of multiperiod strong valid inequalities linking different scenarios and covering decision variables that represent both power generation and regulation reserve amounts. We further extend our study by exploring the multigenerator polytope and derive strong valid inequalities linking different generators and covering multiple periods. To enhance computational performance, polynomial-time separation algorithms are developed for the exponential number of inequalities. Finally, we verify the effectiveness of our proposed strong valid inequalities by applying them as user cuts under the branch-and-cut scheme to solve multistage stochastic network-constrained power generation scheduling problems.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:orijoc:v:33:y:2021:i:1:p:352-369
    DOI: 10.1287/ijoc.2019.0933
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2019.0933
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2019.0933?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. 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.
    3. 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.
    4. Samer Takriti & Benedikt Krasenbrink & Lilian S.-Y. Wu, 2000. "Incorporating Fuel Constraints and Electricity Spot Prices into the Stochastic Unit Commitment Problem," Operations Research, INFORMS, vol. 48(2), pages 268-280, April.
    5. 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.
    6. Kathryn M. Schumacher & Amy E. M. Cohn & Richard Li-Yang Chen, 2017. "Algorithm for the N -2 Security-Constrained Unit Commitment Problem with Transmission Switching," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 645-659, November.
    7. Yongpei Guan & Kai Pan & Kezhuo Zhou, 2018. "Polynomial time algorithms and extended formulations for unit commitment problems," IISE Transactions, Taylor & Francis Journals, vol. 50(8), pages 735-751, August.
    8. Suvrajeet Sen & Lihua Yu & Talat Genc, 2006. "A Stochastic Programming Approach to Power Portfolio Optimization," Operations Research, INFORMS, vol. 54(1), pages 55-72, February.
    9. 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.
    10. Matthias Nowak & Werner Römisch, 2000. "Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty," Annals of Operations Research, Springer, vol. 100(1), pages 251-272, December.
    11. 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.
    12. Ben Knueven & Jim Ostrowski & Jianhui Wang, 2018. "The Ramping Polytope and Cut Generation for the Unit Commitment Problem," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 739-749, November.
    13. 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).
    14. 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.
    15. Brian Carlson & Yonghong Chen & Mingguo Hong & Roy Jones & Kevin Larson & Xingwang Ma & Peter Nieuwesteeg & Haili Song & Kimberly Sperry & Matthew Tackett & Doug Taylor & Jie Wan & Eugene Zak, 2012. "MISO Unlocks Billions in Savings Through the Application of Operations Research for Energy and Ancillary Services Markets," Interfaces, INFORMS, vol. 42(1), pages 58-73, February.
    16. Pascale Bendotti & Pierre Fouilhoux & Cécile Rottner, 2018. "The min-up/min-down unit commitment polytope," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 1024-1058, October.
    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. 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.
    2. Varawala, Lamia & Dán, György & Hesamzadeh, Mohammad Reza & Baldick, Ross, 2023. "A generalised approach for efficient computation of look ahead security constrained optimal power flow," European Journal of Operational Research, Elsevier, vol. 310(2), pages 477-494.

    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. 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.
    2. 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.
    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. Wim Ackooij & Jérôme Malick, 2016. "Decomposition algorithm for large-scale two-stage unit-commitment," Annals of Operations Research, Springer, vol. 238(1), pages 587-613, March.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Kai Pan & Yongpei Guan, 2016. "Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment," Operations Research, INFORMS, vol. 64(6), pages 1482-1498, December.
    11. Wim Ackooij & Jérôme Malick, 2016. "Decomposition algorithm for large-scale two-stage unit-commitment," Annals of Operations Research, Springer, vol. 238(1), pages 587-613, March.
    12. Zhen, Lu & He, Xueting & Zhuge, Dan & Wang, Shuaian, 2024. "Primal decomposition for berth planning under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    13. 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).
    14. Heejung Park, 2022. "A Unit Commitment Model Considering Feasibility of Operating Reserves under Stochastic Optimization Framework," Energies, MDPI, vol. 15(17), pages 1-22, August.
    15. 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).
    16. Kai Pan & Ming Zhao & Chung-Lun Li & Feng Qiu, 2022. "A Polyhedral Study on Fuel-Constrained Unit Commitment," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3309-3324, November.
    17. Ali Kakhbod & Asuman Ozdaglar & Ian Schneider, 2021. "Selling Wind," The Energy Journal, , vol. 42(1), pages 1-38, January.
    18. Jeanne Aslak Petersen & Ditte Heide-Jørgensen & Nina Detlefsen & Trine Boomsma, 2016. "Short-term balancing of supply and demand in an electricity system: forecasting and scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 449-473, March.
    19. Jeanne Aslak Petersen & Ditte Mølgård Heide-Jørgensen & Nina Kildegaard Detlefsen & Trine Krogh Boomsma, 2016. "Short-term balancing of supply and demand in an electricity system: forecasting and scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 449-473, March.
    20. 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.

    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:33:y:2021:i:1:p:352-369. 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.