IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-03522241.html

Individual Thermal Generator and Battery Storage Bidding Strategies Based on Robust Optimization

Author

Listed:
  • Matea Vidan

    (University of Zagreb)

  • Fabio D’andreagiovanni

    (Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne] - UTC - Université de Technologie de Compiègne - CNRS - Centre National de la Recherche Scientifique)

  • Hrvoje Pandzic

    (University of Zagreb)

Abstract

Bidding in the day-ahead market encompasses uncertainty on market prices. To properly address this issue, dedicated optimal bidding models are constructed. Traditionally, these models have been derived for generating units, in particular thermal generators. Recently, optimal bidding models have been updated to account for specifics of energy storage, foremost battery storage. Batteries are significantly different devices than generators. On one hand, a battery can both purchase and sell electricity with practically instant change in its output power. On the other hand, a battery is energy-limited, which makes its profit very sensitive to optimal scheduling. In this paper, we examine the existing and derive new robust optimization-based optimal bidding models individually for a thermal generator and a battery storage. The models are examined in terms of the expected profit by applying the obtained bidding curves and (dis)charging schedules to actual realizations of uncertainty. Moreover, we examine the effect of the range of uncertainty caused by the selection of input scenarios. Based on the presented case studies, we form conclusions on the effectiveness of the robust optimization approach for this type of problems.

Suggested Citation

  • Matea Vidan & Fabio D’andreagiovanni & Hrvoje Pandzic, 2021. "Individual Thermal Generator and Battery Storage Bidding Strategies Based on Robust Optimization," Post-Print hal-03522241, HAL.
  • Handle: RePEc:hal:journl:hal-03522241
    DOI: 10.1109/ACCESS.2021.3076872
    Note: View the original document on HAL open archive server: https://hal.science/hal-03522241v1
    as

    Download full text from publisher

    File URL: https://hal.science/hal-03522241v1/document
    Download Restriction: no

    File URL: https://libkey.io/10.1109/ACCESS.2021.3076872?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:hal:journl:hal-03522241. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.