The critical role of gas fired-plants to compensate renewable generation has increased the operational variability in natural gas networks (GN). Towards developing more reliable and efficient computational tools for GN monitoring, control, and planning, this work considers the task of solving the nonlinear equations governing steady-state flows and pressures in GNs. It is first shown that if the gas flow equations are feasible, they enjoy a unique solution. To the best of our knowledge, this is the first result proving uniqueness of the steady-state gas flow solution over the entire feasible domain of gas injections. To find this solution, we put forth a mixed-integer second-order cone program (MI-SOCP)-based solver relying on a relaxation of the gas flow equations. This relaxation is provably exact under specific network topologies. Unlike existing alternatives, the devised solver does not need proper initialization or knowing the gas flow directions beforehand, and can handle gas networks with compressors. Numerical tests on tree and meshed networks indicate that the relaxation is exact even when the derived conditions are not met.
more »
« less
Inexactness of Second Order Cone Relaxations for Calculating Operating Envelopes
As the number of distributed energy resources participating in power networks increases, it becomes increasingly more important to actively manage network constraints to ensure safe operation. One proposed method that has gained significant attention and implementation, particularly in Australia, is the use of dynamic operating envelopes. Operating envelopes represent net export limits set by the system operator on every node in the distribution network that change as system conditions change. They are calculated using an optimal power flow problem, frequently using a linearization or relaxation of the nonlinear power flow equations. This paper presents two case studies and some numerical analysis to explain why a second order cone relaxation of the power flow equations will lead to ineffective operating envelopes. A modification to the objective function which allows the second order cone relaxation to nearly recover the solution to the nonlinear formulation is also presented.
more »
« less
- Award ID(s):
- 1845093
- PAR ID:
- 10486457
- Publisher / Repository:
- IEEE
- Date Published:
- Journal Name:
- IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids
- ISBN:
- 978-1-6654-5556-5
- Page Range / eLocation ID:
- 1 to 6
- Format(s):
- Medium: X
- Location:
- Glasgow, United Kingdom
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The Optimal Power Shutoff (OPS) problem is an optimization problem that makes power line de-energization decisions in order to reduce the risk of igniting a wildfire, while minimizing the load shed of customers. This problem, with DC linear power flow equations, has been used in many studies in recent years. However, using linear approximations for power flow when making decisions on the network topology is known to cause challenges with AC feasibility of the resulting network, as studied in the related contexts of optimal transmission switching or grid restoration planning. This paper explores the accuracy of the DC OPS formulation and the ability to recover an AC-feasible power flow solution after de-energization decisions are made. We also extend the OPS problem to include variants with the AC, Second-Order-Cone, and Network-Flow power flow equations, and compare them to the DC approximation with respect to solution quality and time. The results highlight that the DC approximation overestimates the amount of load that can be served, leading to poor de-energization decisions. The AC and SOC-based formulations are better, but prohibitively slow to solve for even modestly sized networks thus demonstrating the need for new solution methods with better trade-offs between computational time and solution quality.more » « less
-
Transmission networks and generating units must be reinforced to satisfy the ever-increasing demand for electricity and to keep power system reliability within an acceptable level. According to the standards, the planned power system must be able to supply demand in the case of outage of a single element (N − 1 security criteria), and the possibility of cascading failures must be minimized. In this paper, we propose a risk-based dynamic generation and transmission expansion planning model with respect to the propagating effect of each contingency on the power system. Using the concept of risk, post-contingency load-shedding penalty costs are obtained and added in the objective function to penalize high-risk contingencies more dominantly. The McCormick relaxation is tailored to alter the objective function into a linear format. To keep the practicality of the proposed model, a second-order cone programming model is applied for power flow representation, and the problem is modeled in a dynamic time frame. The proposed model is formulated as a mixed-integer second-order cone programming problem. The numerical studies on the RTS 24-bus test system illustrate the efficacy of the proposed model.more » « less
-
Solar hosting capacity analysis (HCA) assesses the ability of a distribution network to host distributed solar generation without seriously violating distribution network constraints. In this paper, we consider risk-sensitive HCA that limits the risk of network constraint violations with a collection of scenarios of solar irradiance and nodal power demands, where risk is modeled via the conditional value at risk (CVaR) measure. First, we consider the question of maximizing aggregate installed solar capacities, subject to risk constraints and solve it as a second-order cone program (SOCP) with a standard conic relaxation of the feasible set of the power flow equations. Second, we design an incremental algorithm to decide whether a configuration of solar installations has acceptable risk of constraint violations, modeled via CVaR. The algorithm circumvents explicit risk computation by incrementally constructing inner and outer polyhedral approximations of the set of acceptable solar installation configurations from prior such tests conducted. Our numerical examples study the impact of risk parameters, the number of scenarios and the scalability of our framework.more » « less
-
Dispatching a large fleet of distributed energy resources (DERs) in response to wholesale energy market or regional grid signals requires solving a challenging disaggregation problem when the DERs are located within a distribution network. This manuscript presents a computationally tractable convex inner approximation for the optimal power flow (OPF) problem that characterizes a feeders aggregate DERs hosting capacity and enables a realtime, grid-aware dispatch of DERs for radial distribution networks. The inner approximation is derived by considering convex envelopes on the nonlinear terms in the AC power flow equations. The resulting convex formulation is then used to derive provable nodal injection limits, such that any combination of DER dispatches within their respective nodal limits is guaranteed to be AC admissible. These nodal injection limits are then used to construct a realtime, open-loop control policy for dispatching DERs at each location in the network to collectively deliver grid services. The IEEE-37 distribution network is used to validate the technical results and highlight various use-cases.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/SmartGridComm57358.2023.10333939
