IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v95y2022i3d10.1007_s00186-021-00768-4.html
   My bibliography  Save this article

Strategic bidding in price coupled regions

Author

Listed:
  • Jérôme De Boeck

    (Université libre de Bruxelles
    INOCS, INRIA Lille Nord-Europe)

  • Luce Brotcorne

    (INOCS, INRIA Lille Nord-Europe)

  • Bernard Fortz

    (Université libre de Bruxelles
    INOCS, INRIA Lille Nord-Europe)

Abstract

With the emerging deregulated electricity markets, a part of the electricity trading takes place in day-ahead markets where producers and retailers place bids in order to maximize their profit. We present a price-maker model for strategic bidding from the perspective of a producer in Price Coupled Regions (PCR) considering a capacitated transmission network between local day-ahead markets. The aim for the bidder is to establish a production plan and set its bids taking into consideration the reaction of the market. We consider the problem as deterministic, that is, the bids of the competitors are known in advance. We are facing a bilevel optimization problem where the first level is a Unit Commitment problem, modeled as a Mixed Integer Linear Program (MILP), and the second level models a market equilibrium problem through a Linear Program. The problem is first reformulated as a single level problem. Properties of the optimal spot prices are studied to obtain an extended formulation that is linearized and tightened using new valid inequalities. Several properties of the spot prices allow to reduce significantly the number of binary variables. Two novel heuristics are proposed, the first applicable in PCR, the second for general formulations with Special Ordered Sets (SOS) of type 1. Our computational experiments highlights the risk of a loss for the bidder if some aspects usually not considered in the literature, such as Price Coupled Regions, or an accurate UC problem, are not taken into account. They also show that the reformulation techniques, combined with new valid inequalities, allow to solve much larger instances than the current state-of-the-art. Finally, our experiments also show that the proposed heuristics deliver very high quality solutions in a short computation time.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:mathme:v:95:y:2022:i:3:d:10.1007_s00186-021-00768-4
    DOI: 10.1007/s00186-021-00768-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-021-00768-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00186-021-00768-4?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. Clements, A.E. & Hurn, A.S. & Li, Z., 2016. "Strategic bidding and rebidding in electricity markets," Energy Economics, Elsevier, vol. 59(C), pages 24-36.
    3. Bala V. Balachandran & Ram T. S. Ramakrishnan, 1996. "Joint Cost Allocation for Multiple Lots," Management Science, INFORMS, vol. 42(2), pages 247-258, February.
    4. Juan M. Morales & Antonio J. Conejo & Henrik Madsen & Pierre Pinson & Marco Zugno, 2014. "Integrating Renewables in Electricity Markets," International Series in Operations Research and Management Science, Springer, edition 127, number 978-1-4614-9411-9, December.
    5. Li, Gong & Shi, Jing & Qu, Xiuli, 2011. "Modeling methods for GenCo bidding strategy optimization in the liberalized electricity spot market–A state-of-the-art review," Energy, Elsevier, vol. 36(8), pages 4686-4700.
    6. David F. Rogers & Robert D. Plante & Richard T. Wong & James R. Evans, 1991. "Aggregation and Disaggregation Techniques and Methodology in Optimization," Operations Research, INFORMS, vol. 39(4), pages 553-582, August.
    7. 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).
    8. 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.
    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. D'avid Csercsik, 2020. "Strategic bidding via the interplay of minimum income condition orders in day-ahead power exchanges," Papers 2012.07789, arXiv.org.
    2. 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).
    3. 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.
    4. Esmaeili Aliabadi, Danial & Kaya, Murat & Sahin, Guvenc, 2017. "Competition, risk and learning in electricity markets: An agent-based simulation study," Applied Energy, Elsevier, vol. 195(C), pages 1000-1011.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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).
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    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. Richard Connors & David Watling, 2015. "Assessing the Demand Vulnerability of Equilibrium Traffic Networks via Network Aggregation," Networks and Spatial Economics, Springer, vol. 15(2), pages 367-395, June.
    19. Christos N. Dimitriadis & Evangelos G. Tsimopoulos & Michael C. Georgiadis, 2021. "A Review on the Complementarity Modelling in Competitive Electricity Markets," Energies, MDPI, vol. 14(21), pages 1-27, November.
    20. Koltsaklis, Nikolaos E. & Nazos, Konstantinos, 2017. "A stochastic MILP energy planning model incorporating power market dynamics," Applied Energy, Elsevier, vol. 205(C), pages 1364-1383.

    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:spr:mathme:v:95:y:2022:i:3:d:10.1007_s00186-021-00768-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.