IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v21y2024i2d10.1007_s10287-024-00525-y.html
   My bibliography  Save this article

Applying and benchmarking a stochastic programming-based bidding strategy for day-ahead hydropower scheduling

Author

Listed:
  • Kristine Klock Fleten

    (Aneo AS)

  • Ellen Krohn Aasgård

    (Aneo AS)

  • Liyuan Xing

    (Aneo AS)

  • Hanne Høie Grøttum

    (Aneo AS)

  • Stein-Erik Fleten

    (Norwegian University of Science and Technology)

  • Odd Erik Gundersen

    (Norwegian University of Science and Technology
    Aneo AS)

Abstract

Aneo is one of the first Nordic power companies to apply stochastic programming for day-ahead bidding of hydropower. This paper describes our experiences in implementing, testing, and operating a stochastic programming-based bidding method aimed at setting up an automated process for day-ahead bidding. The implementation process has faced challenges such as generating price scenarios for the optimization model, post-processing optimization results to create feasible and understandable bids, and technically integrating these into operational systems. Additionally, comparing the bids from the new stochastic-based method to the existing operator-determined bids has been challenging, which is crucial for building trust in new procedures. Our solution is a rolling horizon comparison, benchmarking the performance of the bidding methods over consecutive two-week periods. Our benchmarking results show that the stochastic method can replicate the current operator-determined bidding strategy. However, additional work is needed before we can fully automate the stochastic bidding setup, particularly in addressing inflow uncertainty and managing special constraints on our watercourses.

Suggested Citation

  • Kristine Klock Fleten & Ellen Krohn Aasgård & Liyuan Xing & Hanne Høie Grøttum & Stein-Erik Fleten & Odd Erik Gundersen, 2024. "Applying and benchmarking a stochastic programming-based bidding strategy for day-ahead hydropower scheduling," Computational Management Science, Springer, vol. 21(2), pages 1-24, December.
    • Handle: RePEc:spr:comgts:v:21:y:2024:i:2:d:10.1007_s10287-024-00525-y
    DOI: 10.1007/s10287-024-00525-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-024-00525-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10287-024-00525-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Rachunok, Benjamin & Staid, Andrea & Watson, Jean-Paul & Woodruff, David L., 2020. "Assessment of wind power scenario creation methods for stochastic power systems operations," Applied Energy, Elsevier, vol. 268(C).
    2. Fleten, Stein-Erik & Kristoffersen, Trine Krogh, 2007. "Stochastic programming for optimizing bidding strategies of a Nordic hydropower producer," European Journal of Operational Research, Elsevier, vol. 181(2), pages 916-928, September.
    3. Gneiting, Tilmann & Raftery, Adrian E., 2007. "Strictly Proper Scoring Rules, Prediction, and Estimation," Journal of the American Statistical Association, American Statistical Association, vol. 102, pages 359-378, March.
    4. Daeho Kim & Hyungkyu Cheon & Dong Gu Choi & Seongbin Im, 2022. "Operations Research Helps the Optimal Bidding of Virtual Power Plants," Interfaces, INFORMS, vol. 52(4), pages 344-362, July.
    5. Wozabal, David & Rameseder, Gunther, 2020. "Optimal bidding of a virtual power plant on the Spanish day-ahead and intraday market for electricity," European Journal of Operational Research, Elsevier, vol. 280(2), pages 639-655.
    6. Ellen Krohn Aasgård & Hans Ivar Skjelbred, 2020. "Progressive hedging for stochastic programs with cross-scenario inequality constraints," Computational Management Science, Springer, vol. 17(1), pages 141-160, January.
    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. Narajewski, Michał & Ziel, Florian, 2022. "Optimal bidding in hourly and quarter-hourly electricity price auctions: Trading large volumes of power with market impact and transaction costs," Energy Economics, Elsevier, vol. 110(C).
    2. Rintamäki, Tuomas & Siddiqui, Afzal S. & Salo, Ahti, 2020. "Strategic offering of a flexible producer in day-ahead and intraday power markets," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1136-1153.
    3. Feng, Jie & Ran, Lun & Wang, Zhiyuan & Zhang, Mengling, 2024. "Optimal energy scheduling of virtual power plant integrating electric vehicles and energy storage systems under uncertainty," Energy, Elsevier, vol. 309(C).
    4. Micha{l} Narajewski & Florian Ziel, 2021. "Optimal bidding in hourly and quarter-hourly electricity price auctions: trading large volumes of power with market impact and transaction costs," Papers 2104.14204, arXiv.org, revised Feb 2022.
    5. Russo, Marianna & Kraft, Emil & Bertsch, Valentin & Keles, Dogan, 2022. "Short-term risk management of electricity retailers under rising shares of decentralized solar generation," Energy Economics, Elsevier, vol. 109(C).
    6. Kim, Seokwoo & Choi, Dong Gu, 2024. "A sample robust optimal bidding model for a virtual power plant," European Journal of Operational Research, Elsevier, vol. 316(3), pages 1101-1113.
    7. Kraft, Emil & Russo, Marianna & Keles, Dogan & Bertsch, Valentin, 2023. "Stochastic optimization of trading strategies in sequential electricity markets," European Journal of Operational Research, Elsevier, vol. 308(1), pages 400-421.
    8. Tryggvi Jónsson & Pierre Pinson & Henrik Madsen & Henrik Aalborg Nielsen, 2014. "Predictive Densities for Day-Ahead Electricity Prices Using Time-Adaptive Quantile Regression," Energies, MDPI, vol. 7(9), pages 1-25, August.
    9. Saeed Hayati & Kenji Fukumizu & Afshin Parvardeh, 2024. "Kernel mean embedding of probability measures and its applications to functional data analysis," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 51(2), pages 447-484, June.
    10. Azar, Pablo D. & Micali, Silvio, 2018. "Computational principal agent problems," Theoretical Economics, Econometric Society, vol. 13(2), May.
    11. Luis A Barboza & Shu-Wei Chou-Chen & Paola Vásquez & Yury E García & Juan G Calvo & Hugo G Hidalgo & Fabio Sanchez, 2023. "Assessing dengue fever risk in Costa Rica by using climate variables and machine learning techniques," PLOS Neglected Tropical Diseases, Public Library of Science, vol. 17(1), pages 1-13, January.
    12. Angelica Gianfreda & Francesco Ravazzolo & Luca Rossini, 2023. "Large Time‐Varying Volatility Models for Hourly Electricity Prices," Oxford Bulletin of Economics and Statistics, Department of Economics, University of Oxford, vol. 85(3), pages 545-573, June.
    13. Tobias Fissler & Yannick Hoga, 2024. "How to Compare Copula Forecasts?," Papers 2410.04165, arXiv.org.
    14. Davide Pettenuzzo & Francesco Ravazzolo, 2016. "Optimal Portfolio Choice Under Decision‐Based Model Combinations," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 31(7), pages 1312-1332, November.
    15. Rubio, F.J. & Steel, M.F.J., 2011. "Inference for grouped data with a truncated skew-Laplace distribution," Computational Statistics & Data Analysis, Elsevier, vol. 55(12), pages 3218-3231, December.
    16. Basora, Luis & Viens, Arthur & Chao, Manuel Arias & Olive, Xavier, 2025. "A benchmark on uncertainty quantification for deep learning prognostics," Reliability Engineering and System Safety, Elsevier, vol. 253(C).
    17. Hwang, Eunju, 2022. "Prediction intervals of the COVID-19 cases by HAR models with growth rates and vaccination rates in top eight affected countries: Bootstrap improvement," Chaos, Solitons & Fractals, Elsevier, vol. 155(C).
    18. R de Fondeville & A C Davison, 2018. "High-dimensional peaks-over-threshold inference," Biometrika, Biometrika Trust, vol. 105(3), pages 575-592.
    19. Armantier, Olivier & Treich, Nicolas, 2013. "Eliciting beliefs: Proper scoring rules, incentives, stakes and hedging," European Economic Review, Elsevier, vol. 62(C), pages 17-40.
    20. Kandpal, Bakul & Pareek, Parikshit & Verma, Ashu, 2022. "A robust day-ahead scheduling strategy for EV charging stations in unbalanced distribution grid," Energy, Elsevier, vol. 249(C).

    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:spr:comgts:v:21:y:2024:i:2:d:10.1007_s10287-024-00525-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.