Abstract
As a result of its liberalization, the European gas market is organized as an entry-exit system in order to decouple the trading and transport of natural gas. Roughly summarized, the gas market organization consists of four subsequent stages. First, the transmission system operator (TSO) is obliged to allocate so-called maximal technical capacities for the nodes of the network. Second, the TSO and the gas traders sign mid- to long-term capacity-right contracts, where the capacity is bounded above by the allocated technical capacities. These contracts are called bookings. Third, on a day-ahead basis, gas traders can nominate the amount of gas that they inject or withdraw from the network at entry and exit nodes, where the nominated amount is bounded above by the respective booking. Fourth and finally, the TSO has to operate the network such that the nominated amounts of gas can be transported. By signing the booking contract, the TSO guarantees that all possibly resulting nominations can indeed be transported. Consequently, maximal technical capacities have to satisfy that all nominations that comply with these technical capacities can be transported through the network. This leads to a highly challenging mathematical optimization problem. We consider the specific instantiations of this problem in which we assume capacitated linear as well as potential-based flow models. In this contribution, we formally introduce the problem of Computing Technical Capacities (CTC) and prove that it is NP-complete on trees and NP-hard in general. To this end, we first reduce the Subset Sum problem to CTC for the case of capacitated linear flows in trees. Afterward, we extend this result to CTC with potential-based flows and show that this problem is also NP-complete on trees by reducing it to the case of capacitated linear flow. Since the hardness results are obtained for the easiest case, i.e., on tree-shaped networks with capacitated linear as well as potential-based flows, this implies the hardness of CTC for more general graph classes.
Highlights
The European gas market is organized as a so-called entry-exit market system, which has been the outcome of the European gas market liberalization; see Directive (1998, 2009, 2003)
The current market organization that should achieve this goal is mainly split into different stages in which the transmission system operator (TSO) and the gas traders interact with each other
We proved that computing maximal technical capacities in the European entryexit gas market is NP-hard
Summary
The European gas market is organized as a so-called entry-exit market system, which has been the outcome of the European gas market liberalization; see Directive (1998, 2009, 2003). There it is shown that in case of a linear potential-based flow model, this characterization enables us to check the feasibility of a booking in polynomial time. I.e., a nonlinear potential-based flow model on arbitrary networks, the complexity of checking the feasibility of a booking is not yet decided and an open question for research. For the case of a capacitated linear flow model, checking the feasibility of a booking is coNP-complete for cyclic networks, but it can be solved in polynomial time for trees; see Hayn (2016). We prove that computing maximal technical capacities is NP-complete for capacitated linear flows as well as potential-based flow models even in treeshaped networks.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
