[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i4p784-798.html
   My bibliography  Save this article

A dynamic multi-level iterative algorithm for clearing European electricity day-ahead markets: An application to the Turkish market

Author

Listed:
  • Burak Büke
  • Mesut Sayin
  • Fehmi Tanrisever
Abstract
Designing and clearing day-ahead electricity market auctions have recently received significant attention from academia and practice alike. Given the size and the complexity of day-ahead market auctions, clearing them within the time limits imposed by the market is a major practical concern. In this paper, we model all the practical details of the Turkish day-ahead electricity market and provide a new multi-level iterative heuristic to clear the market. We compare our results with a commercial solver using data provided by Energy Exchange Istanbul. Our heuristic achieves an average optimality gap less than 0.09%, with an average solution time of just 14 s; whereas the commercial solver takes, on average, 18 min (and in some cases up to three hours) to find the optimal solution. We also demonstrate that using our heuristic solution to warm-start the commercial solver further reduces the solution time by 25%, on average. Overall, our heuristic proves to be very efficient in clearing the Turkish day-ahead market. We also test the performance of our algorithm as the problem size grows.

Suggested Citation

  • Burak Büke & Mesut Sayin & Fehmi Tanrisever, 2024. "A dynamic multi-level iterative algorithm for clearing European electricity day-ahead markets: An application to the Turkish market," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(4), pages 784-798, April.
    • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:4:p:784-798
    DOI: 10.1080/01605682.2023.2210182
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2210182
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2023.2210182?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.

    More about this item

    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:taf:tjorxx:v:75:y:2024:i:4:p:784-798. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.