IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v300y2022i2p713-726.html
   My bibliography  Save this article

Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently

Author

Listed:
  • Ceyhan, Gökhan
  • Köksalan, Murat
  • Lokman, Banu

Abstract

We study the day-ahead electricity market clearing problem under the prevailing market design in the European electricity markets. We revisit the Benders decomposition algorithm that has been used to solve this problem. We develop new valid inequalities that substantially improve the performance of the algorithm. We generate instances that mimic the characteristics of past bids of the Turkish day-ahead electricity market and conduct experiments. We use two leading mixed-integer programming solvers, IBM ILOG Cplex and Gurobi, in order to assess the impact of employed solver on the algorithm performance. We compare the performances of our algorithm, the primal-dual algorithm, and the Benders decomposition algorithm using the existing cuts from the literature. The extensive experiments we conduct demonstrate that the price-based cuts we develop improve the performance of the Benders decomposition algorithm and outperform the primal-dual algorithm.

Suggested Citation

  • Ceyhan, Gökhan & Köksalan, Murat & Lokman, Banu, 2022. "Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently," European Journal of Operational Research, Elsevier, vol. 300(2), pages 713-726.
    • Handle: RePEc:eee:ejores:v:300:y:2022:i:2:p:713-726
    DOI: 10.1016/j.ejor.2021.10.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721008547
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.10.007?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. Madani, Mehdi & Van Vyve, Mathieu, 2015. "Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions," European Journal of Operational Research, Elsevier, vol. 242(2), pages 580-593.
    2. VAN VYVE, Mathieu, 2011. "Linear prices for non-convex electricity markets: models and algorithms," LIDAM Discussion Papers CORE 2011050, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Madani, Mehdi & Van Vyve, Mathieu, 2018. "Revisiting minimum profit conditions in uniform price day-ahead electricity auctions," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1072-1085.
    4. of England, Bank, 2016. "Markets and operations," Bank of England Quarterly Bulletin, Bank of England, vol. 56(4), pages 212-221.
    5. George Liberopoulos & Panagiotis Andrianesis, 2016. "Critical Review of Pricing Schemes in Markets with Non-Convex Costs," Operations Research, INFORMS, vol. 64(1), pages 17-31, February.
    6. Mehdi Madani & Mathieu Van Vyve, 2017. "A MIP framework for non-convex uniform price day-ahead electricity auctions," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 263-284, March.
    7. O'Neill, Richard P. & Sotkiewicz, Paul M. & Hobbs, Benjamin F. & Rothkopf, Michael H. & Stewart, William R., 2005. "Efficient market-clearing prices in markets with nonconvexities," European Journal of Operational Research, Elsevier, vol. 164(1), pages 269-285, July.
    8. Mehdi MADANI & Mathieu VAN VYVE, 2015. "Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions," LIDAM Reprints CORE 2808, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Fragkogios, Antonios & Qiu, Yuzhuo & Saharidis, Georgios K.D. & Pardalos, Panos M., 2024. "An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 317(2), pages 500-514.
    2. Weninger, Dieter & Wolsey, Laurence A., 2023. "Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing," European Journal of Operational Research, Elsevier, vol. 310(1), pages 84-99.

    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. Nermin Elif Kurt & H. Bahadir Sahin & Kurc{s}ad Derinkuyu, 2018. "An Adaptive Tabu Search Algorithm for Market Clearing Problem in Turkish Day-Ahead Market," Papers 1809.10554, arXiv.org.
    2. Madani, M. & Van Vyve, M., 2015. "A MIP framework for non-convex uniform price day-ahead electricity auctions," LIDAM Discussion Papers CORE 2015017, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Csercsik, Dávid, 2021. "Strategic bidding via the interplay of minimum income condition orders in day-ahead power exchanges," Energy Economics, Elsevier, vol. 95(C).
    4. Le Hong Lam & Valentin Ilea & Cristian Bovo, 2020. "New Clearing Model to Mitigate the Non-Convexity in European Day-ahead Electricity Market," Energies, MDPI, vol. 13(18), pages 1-28, September.
    5. Gokhan Ceyhan & Nermin Elif Kurt & H. Bahadir Sahin & Kurc{s}ad Derinkuyu, 2017. "Empirical comparison of three models for determining market clearing prices in Turkish day-ahead electricity market," Papers 1712.00235, arXiv.org.
    6. Mehdi Madani & Mathieu Van Vyve, 2017. "A MIP framework for non-convex uniform price day-ahead electricity auctions," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 263-284, March.
    7. Xin Shi & Alberto J. Lamadrid L. & Luis F. Zuluaga, 2021. "Revenue Adequate Prices for Chance-Constrained Electricity Markets with Variable Renewable Energy Sources," Papers 2105.01233, arXiv.org.
    8. Vadim Borokhov, 2022. "Utilizing the redundant constraints for the uplift payment elimination," Operational Research, Springer, vol. 22(2), pages 1377-1402, April.
    9. Vazquez, Carlos & Hallack, Michelle & Vazquez, Miguel, 2017. "Price computation in electricity auctions with complex rules: An analysis of investment signals," Energy Policy, Elsevier, vol. 105(C), pages 550-561.
    10. D'avid Csercsik, 2020. "Strategic bidding via the interplay of minimum income condition orders in day-ahead power exchanges," Papers 2012.07789, arXiv.org.
    11. Stevens, Nicolas & Papavasiliou, Anthony & Smeers, Yves, 2024. "On some advantages of convex hull pricing for the European electricity auction," Energy Economics, Elsevier, vol. 134(C).
    12. Mays, Jacob & Morton, David P. & O’Neill, Richard P., 2021. "Investment effects of pricing schemes for non-convex markets," European Journal of Operational Research, Elsevier, vol. 289(2), pages 712-726.
    13. David Fuller, J. & Çelebi, Emre, 2017. "Alternative models for markets with nonconvexities," European Journal of Operational Research, Elsevier, vol. 261(2), pages 436-449.
    14. Hassan Shavandi & Mehrdad Pirnia & J. David Fuller, 2018. "Extended opportunity cost model to find near equilibrium electricity prices under non-convexities," Papers 1809.09734, arXiv.org.
    15. Koltsaklis, Nikolaos E. & Dagoumas, Athanasios S., 2018. "Incorporating unit commitment aspects to the European electricity markets algorithm: An optimization model for the joint clearing of energy and reserve markets," Applied Energy, Elsevier, vol. 231(C), pages 235-258.
    16. Eldridge, B. & O’Neill, R. & Hobbs, B., 2018. "Pricing in Day-Ahead Electricity Markets with Near-Optimal Unit Commitment," Cambridge Working Papers in Economics 1872, Faculty of Economics, University of Cambridge.
    17. Byers, Conleigh & Hug, Gabriela, 2023. "Long-run optimal pricing in electricity markets with non-convex costs," European Journal of Operational Research, Elsevier, vol. 307(1), pages 351-363.
    18. Dávid Csercsik & Ádám Sleisz & Péter Márk Sőrés, 2019. "The Uncertain Bidder Pays Principle and Its Implementation in a Simple Integrated Portfolio-Bidding Energy-Reserve Market Model," Energies, MDPI, vol. 12(15), pages 1-25, August.
    19. Shavandi, Hassan & Pirnia, Mehrdad & Fuller, J. David, 2019. "Extended opportunity cost model to find near equilibrium electricity prices under non-convexities," Applied Energy, Elsevier, vol. 240(C), pages 251-264.
    20. Kuang, Xiaolong & Lamadrid, Alberto J. & Zuluaga, Luis F., 2019. "Pricing in non-convex markets with quadratic deliverability costs," Energy Economics, Elsevier, vol. 80(C), pages 123-131.

    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:eee:ejores:v:300:y:2022:i:2:p:713-726. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.