Searcharxiv⌕ Search

arXiv subjects

Christopher L. DeMarco

Publications and source records attributed to Christopher L. DeMarco.

4 recordsLinked to original sources

EPIGRIDS: Documentation and Validation of Seven Open Synthetic Transmission Grid Cases

This paper documents and checks EPIGRIDS, seven open synthetic transmission grid cases from four independently built networks, made with an optimization-based construction method instead of the graph-statistics method behind most large public synthetic grids. The cases range from 250 to 78,484 buses, with geolocated substations, voltages up to 765 kV, and line parameters taken from conductor data. Each ships under an open license in three common power flow formats that agree at the solved operating point, and the six larger cases have a companion hourly, bus-level load series for one year. The Texas, Florida, and Michigan, Ohio, and Indiana cases are sub-networks of the Eastern case. Every case solves an alternating-current power flow from its stored operating point. With parallel circuits merged, the Eastern and Western cases are 9 and 16% denser than the real interconnections, while graph-statistics cases on the same footprints lie within 6% and meet more published realism criteria. A full single-outage contingency analysis completes on every case, and in an optimal power flow benchmark every case except the New England base case and one of its 12 operating points solves in polar form.

eess.SY↗

GridForge: A Tractable Network-Flow Method for Constructing Open, Continental-Scale Synthetic Power Grids

The goal of this paper is to construct open, continental-scale synthetic transmission grids with an optimization method that stays tractable. Security restrictions keep models of the real grid out of open research and machine-learning datasets, and optimization-based construction is hard at scale: the number of candidate lines grows combinatorially, so electrically faithful methods prune the candidates in advance. This paper presents GridForge, which keeps every bus pair within physical length limits as a candidate, selects lines with Garver's length-weighted network-flow linear program instead of binary decisions, and resizes them with a sequential direct-current (DC) power flow. Two stages of 13 regional networks are evaluated. Their node-degree distributions are nearly as strongly log-linear as those of the real Eastern and Western Interconnections ($R^2$ of 0.92 to 0.98 against 0.971 and 0.981), although the areas under the fitted lines differ from the real ones by 39.9% on average. On the upper Midwest and Tennessee Valley footprints, resizing lowers the DC power-flow loss from 5.89% to 4.14% and from 14.55% to 7.05%, and the DC optimal power-flow loss from 4.03% to 2.02% and from 5.54% to 2.47%. Without relaxing any line limit, the DC optimal power flow is feasible in 78.81% and 0.82% of the scenarios. Most lines are built at 69 kV. The models span 250 to 78,484 buses, were built on single machines, and are freely redistributable.

eess.SY↗

Sparse Tableau Formulation for Optimal Power Flow Applications

Typical formulations of the optimal power flow (OPF) problem rely on what is termed the "bus-branch" model, with network electrical behavior summarized in the Ybus admittance matrix. From a circuit perspective, this admittance representation restricts network elements to be voltage controlled and limitations of the Ybus have long been recognized. A fixed Ybus is unable to represent an ideal circuit breaker, and more subtle limitations appear in transformer modeling. In power systems parlance, more detailed approaches to overcome these limitations are termed "node-breaker" representations, but these are often cumbersome, and are not widely utilized in OPF. This paper develops a general network representation adapted to the needs of OPF, based on the Sparse Tableau Formulation (STF) with following advantages for OPF: (i) conceptual clarity in formulating constraints, allowing a comprehensive set of network electrical variables; (ii) improved fidelity in capturing physical behavior and engineering limits; (iii) added flexibility in optimization solution, in that elimination of intermediate variables is left to the optimization algorithm. The STF is then applied to OPF numerical case studies which demonstrate that the STF shows little or no penalty in computational speed compared to classic OPF representations, and sometimes provides considerable advantage in computational speed.

math.OC↗

A Sufficient Condition for Power Flow Insolvability with Applications to Voltage Stability Margins

For the nonlinear power flow problem specified with standard PQ, PV, and slack bus equality constraints, we present a sufficient condition under which the specified set of nonlinear algebraic equations has no solution. This sufficient condition is constructed in a framework of an associated feasible, convex optimization problem. The objective employed in this optimization problem yields a measure of distance (in a parameter set) to the power flow solution boundary. In practical terms, this distance is closely related to quantities that previous authors have proposed as voltage stability margins. A typical margin is expressed in terms of the parameters of system loading (injected powers); here we additionally introduce a new margin in terms of the parameters of regulated bus voltages.

math.OC↗