IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1712.00235.html
   My bibliography  Save this paper

Empirical comparison of three models for determining market clearing prices in Turkish day-ahead electricity market

Author

Listed:
  • Gokhan Ceyhan
  • Nermin Elif Kurt
  • H. Bahadir Sahin
  • Kurc{s}ad Derinkuyu

Abstract

Bidders in day-ahead electricity markets want to sell/buy electricity when their bids generate positive surplus and not to take an action when the reverse holds. However, non-convexities in these markets cause conflicts between the actions that the bidders want to take and the actual market results. In this work, we investigate the non-convex market clearing problem of Turkish market operator and propose three different rule sets. The first rule set allows both rejection of bids with positive surplus and acceptance of bids with negative surplus. The second and the third sets only allow one of these conflicted cases. By using total surplus maximization as the objective, we formulate three models and statistically explore their performance with the real data taken from Turkish market operator.

Suggested Citation

  • 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.
    • Handle: RePEc:arx:papers:1712.00235
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1712.00235
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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).
    4. 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. Hongze Li & Xuejie Wang & Fengyun Li & Yuwei Wang & Xinhua Yu, 2018. "A Robust Day-Ahead Electricity Market Clearing Model Considering Wind Power Penetration," Energies, MDPI, vol. 11(7), pages 1-18, July.

    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. 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).
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. D'avid Csercsik, 2020. "Strategic bidding via the interplay of minimum income condition orders in day-ahead power exchanges," Papers 2012.07789, arXiv.org.
    7. 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).
    8. Kursad Derinkuyu & Fehmi Tanrisever & Nermin Kurt & Gokhan Ceyhan, 2020. "Optimizing Day-Ahead Electricity Market Prices: Increasing the Total Surplus for Energy Exchange Istanbul," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 700-716, July.
    9. 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.
    10. 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.
    11. 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.
    12. Tanrisever, Fehmi & Derinkuyu, Kursad & Jongen, Geert, 2015. "Organization and functioning of liberalized electricity markets: An overview of the Dutch market," Renewable and Sustainable Energy Reviews, Elsevier, vol. 51(C), pages 1363-1374.
    13. 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).
    14. Savelli, Iacopo & Cornélusse, Bertrand & Giannitrapani, Antonio & Paoletti, Simone & Vicino, Antonio, 2018. "A new approach to electricity market clearing with uniform purchase price and curtailable block orders," Applied Energy, Elsevier, vol. 226(C), pages 618-630.
    15. Vadim Borokhov, 2022. "Utilizing the redundant constraints for the uplift payment elimination," Operational Research, Springer, vol. 22(2), pages 1377-1402, April.
    16. Jérôme De Boeck & Luce Brotcorne & Bernard Fortz, 2022. "Strategic bidding in price coupled regions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(3), pages 365-407, June.
    17. Han, Jinil & Papavasiliou, Anthony, 2015. "Congestion management through topological corrections: A case study of Central Western Europe," Energy Policy, Elsevier, vol. 86(C), pages 470-482.
    18. Abhishek Ray & Mario Ventresca & Karthik Kannan, 2021. "A Graph-Based Ant Algorithm for the Winner Determination Problem in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 32(4), pages 1099-1114, December.
    19. 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.
    20. Iacopo Savelli & Bertrand Corn'elusse & Antonio Giannitrapani & Simone Paoletti & Antonio Vicino, 2017. "A New Approach to Electricity Market Clearing With Uniform Purchase Price and Curtailable Block Orders," Papers 1711.07731, arXiv.org, revised Jun 2018.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:1712.00235. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.