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

An Adaptive Tabu Search Algorithm for Market Clearing Problem in Turkish Day-Ahead Market

Author

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

Abstract

In this study, we focus on the market clearing problem of Turkish day-ahead electricity market. We propose a mathematical model by extending the variety of bid types for different price regions. The commercial solvers may not find any feasible solution for the proposed problem in some instances within the given time limits. Hence, we design an adaptive tabu search (ATS) algorithm to solve the problem. ATS discretizes continuous search space arising from the flow variables. Our method has adaptive radius and it achieves backtracking by a commercial solver. Then, we compare the performance of ATS with a heuristic decomposition method from the literature by using synthetic data sets. We evaluate the performances of the algorithms with respect to their solution times and surplus differences. ATS performs better in most of the sets.

Suggested Citation

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

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Teodor Gabriel Crainic & Michel Toulouse & Michel Gendreau, 1997. "Toward a Taxonomy of Parallel Tabu Search Heuristics," INFORMS Journal on Computing, INFORMS, vol. 9(1), pages 61-72, February.
    2. 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.
    3. 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.
    4. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    5. 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).
    6. Ghosh, Diptesh, 2003. "A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem," IIMA Working Papers WP2003-07-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Wen-Chyuan Chiang & Robert A. Russell, 1997. "A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 417-430, November.
    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).
    9. 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.
    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. 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.
    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. 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.
    4. 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).
    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. 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.
    10. Shiri, Samaneh & Huynh, Nathan, 2016. "Optimization of drayage operations with time-window constraints," International Journal of Production Economics, Elsevier, vol. 176(C), pages 7-20.
    11. 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.
    12. Vadim Borokhov, 2022. "Utilizing the redundant constraints for the uplift payment elimination," Operational Research, Springer, vol. 22(2), pages 1377-1402, April.
    13. 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.
    14. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    15. 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.
    16. 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.
    17. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.
    18. 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.
    19. Martin Bichler & Vladimir Fux & Jacob Goeree, 2018. "A Matter of Equality: Linear Pricing in Combinatorial Exchanges," Information Systems Research, INFORMS, vol. 29(4), pages 1024-1043, December.
    20. 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.

    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:1809.10554. 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.