Search

Determining contingency aware dispatch decisions by solving a security-constrained optimal power flow (SCOPF) is challenging for real-world power systems, as the high problem dimensionality often leads to impractical computational requirements. This problem becomes more severe when the SCOPF has to be solved not only for a single instance, but for multiple periods, e.g. in the context of electricity market analyses. This paper proposes an algorithm that identifies the minimal set of constraints that exactly define the space of feasible nodal injections for a given network and contingency scenarios. By internalizing the technical limits of the nodal injections and enforcing a minimal worst-case impact of contingencies to line flows, computational effort can be further improved. The case study applies and analyzes the methods on the IEEE 118 and A&M 2000 bus systems, as well as the German and European transmission systems. In all tested cases the proposed algorithm identifies at least 95% of the network and security constraints as redundant, leading to significant SCOPF solve time reductions. Scalability and practical implementation are explicitly discussed. The code and input data of the case study is published supplementary to the paper under an open-source license. [ABSTRACT FROM AUTHOR]

Moving towards regional Supergrids, an increasing number of interconnections are formed by High Voltage Direct Current (HVDC) lines. Currently, in most regions, HVDC losses are not considered in market operations, resulting in additional costs for Transmission System Operators (TSOs). Nordic TSOs have proposed the introduction of HVDC loss factors in the market clearing algorithm, to account for the cost of losses and avoid HVDC flows between zones with zero price difference. In this paper, we introduce a rigorous framework to assess the introduction of loss factors, in particular HVDC loss factors, in nodal and zonal pricing markets. First, we focus on the identification of an appropriate loss factor. We propose and compare three different models: constant, linear, and piecewise linear. Second, we introduce formulations to include losses in market clearing algorithms. Carrying numerical tests for a whole year, we find that accounting only for HVDC or AC losses may lead to lower social welfare for a non-negligible amount of time. To counter this, this paper introduces a framework for including both AC and HVDC losses in a zonal or nodal pricing environment. We show both theoretically and through simulations that such a framework is guaranteed to increase social welfare. [ABSTRACT FROM AUTHOR]

Securing profits from energy, reserve capacity and balancing markets is critical to ensure the profitability of battery energy systems (BES). However, the intimate connection between offers on these trading floors combined with the limited energy storage capacity of BES renders its scheduling very complex. In this paper, we develop a bilevel optimization problem for strategic participation of a BES in the day-ahead energy-reserve and balancing markets, improving the state-of-the-art by (i) considering the conditional-value-at-risk; (ii) ensuring the real-time feasibility of the obtained day-ahead schedule; (iii) addressing the operational underperformance risk stemming from inaccurate battery modeling. In a case study, we illustrate how the proposed model allows risk-averse BES owners to hedge their day-ahead position without jeopardizing their expected profit, while ensuring the feasibility of their day-ahead schedule. [ABSTRACT FROM AUTHOR]

In this paper, we present a two-stage model of zonal electricity markets with day-ahead market clearing and real-time re-dispatch and balancing that accounts for transmission line switching at both stages. We show how the day-ahead problem with switching can be formulated as an adaptive robust optimization problem with mixed integer recourse and present a new algorithm for solving the adversarial max-min problem that obeys the structure of an interdiction game. We apply the model on a realistic instance of the Central Western European system and comment on the impacts of both proactive and reactive transmission switching on the operating costs of the system. Part I presents day-ahead models of a short-term zonal electricity market with switching, and describes our algorithmic approach for solving these models efficiently. Part II describes variants of the real-time model, and presents the results of our case study on the Central Western European market. [ABSTRACT FROM AUTHOR]

In this paper, we present a two-stage model of zonal electricity markets with day-ahead market clearing, and real-time re-dispatch and balancing that accounts for transmission line switching at both stages. We show how the day-ahead problem with switching can be formulated as an adaptive robust optimization problem with mixed integer recourse, and present a new algorithm for solving the adversarial max-min problem that obeys the structure of an interdiction game. We apply the model on a realistic instance of the Central Western European system, and comment on the impacts of both proactive, and reactive transmission switching on the operating costs of the system. Part I presents day-ahead models of a short-term zonal electricity market with switching, and describes our algorithmic approach for solving these models efficiently. Part II describes variants of the real-time model, and presents the results of our case study on the Central Western European market. [ABSTRACT FROM AUTHOR]

The first of this two-paper series addresses a practical day-ahead auction model, where generation revenue constraints are explicitly incorporated in the problem formulation, as routinely done in several national electricity markets across Europe. The revenue-constrained market-clearing procedure includes the effect of the transmission network, inter-temporal constraints associated with generation scheduling, demand-side bidding, and marginal pricing. This auction design is an instance of price-based market clearing which features two major complicating factors. First, locational marginal prices become decision variables of the optimization process. In addition, producer revenues are formulated as bilinear and highly nonconvex products of power outputs and market-clearing prices. The resulting problem is formulated as a mixed-integer nonlinear bilevel program with bilinear terms for which available solution techniques rely on heuristics, approximations, or modeling simplifications. This paper presents a novel and exact methodology whereby the original problem is recast as an equivalent single-level mixed-integer linear program. As a consequence, finite convergence to optimality is guaranteed and the use of standard commercial software is allowed. The proposed transformation is based on duality theory of linear programming, Karush-Kuhn-Tucker optimality conditions, and integer algebra results. In the second part of this two-paper series, numerical results from several case studies illustrate the effective performance of the proposed solution approach. [ABSTRACT FROM AUTHOR]

A novel model for the clearing of European day-ahead electricity markets, with all associated types of orders, namely simple hourly orders, block orders, complex orders and PUN (“Prezzo Unico Nazionale”) orders is presented in this paper. An iterative algorithm is employed for the market clearing, bearing an inner iteration process for the handling of Paradoxically Accepted block and MIC orders, and an outer iteration process for the handling of PUN orders. During the iterative process a Master Problem and a PUN subproblem are sequentially solved and coordinated, for the efficient handling of all order clearing conditions and market and/or system constraints. The clearing conditions of each order type are explicitly incorporated in the PUN subproblem, formulating a Mixed Complementarity Problem bearing both primal and dual decision variables. The PUN subproblem concerns the sequential clearing of 24 hourly subproblems, employing a special technique for handling the possible inefficiencies due to the myopic nature of the hourly subproblem solutions, leading to enhanced behavior in terms of social surplus with respect to the state-of-the-art day-ahead market clearing solver. The model and the algorithmic process are evaluated in a west-European test case, demonstrating minimal computational requirements and proving its excellent escalation capabilities. [ABSTRACT FROM AUTHOR]