scispace - formally typeset
Search or ask a question
Journal ArticleDOI

MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education

TL;DR: The details of the network modeling and problem formulations used by MATPOWER, including its extensible OPF architecture, are presented, which are used internally to implement several extensions to the standard OPF problem, including piece-wise linear cost functions, dispatchable loads, generator capability curves, and branch angle difference limits.
Abstract: MATPOWER is an open-source Matlab-based power system simulation package that provides a high-level set of power flow, optimal power flow (OPF), and other tools targeted toward researchers, educators, and students. The OPF architecture is designed to be extensible, making it easy to add user-defined variables, costs, and constraints to the standard OPF problem. This paper presents the details of the network modeling and problem formulations used by MATPOWER, including its extensible OPF architecture. This structure is used internally to implement several extensions to the standard OPF problem, including piece-wise linear cost functions, dispatchable loads, generator capability curves, and branch angle difference limits. Simulation results are presented for a number of test cases comparing the performance of several available OPF solvers and demonstrating MATPOWER's ability to solve large-scale AC and DC OPF problems.

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI
TL;DR: An interactive cascading model for power grids and coupled communications systems is proposed based on the redistribution of DC power flow and the routing of the open shortest path first (OSPF) strategy with consideration of the abnormal transmission, and the interdependency is analyzed numerically.

52 citations

Journal ArticleDOI
TL;DR: This letter proposes a novel and simple iterative contingency-screening procedure that is able to eliminate 99.4% of the constraints selected by existing iterative methods, allowing for the solution of much larger-scale problems.
Abstract: When solving the security-constrained unit commitment problem, one of the most complicating factors is handling the large number of transmission constraints, corresponding to both base case and N − 1 line contingency scenarios. Although it is well known that only a few of these constraints need to be enforced, identifying this critical subset of constraints efficiently remains a challenge. In this letter, we propose a novel and simple iterative contingency-screening procedure that is able to eliminate 99.4% of the constraints selected by existing iterative methods, allowing for the solution of much larger-scale problems. We report computational results in realistic instances with up to 6468 buses and 9000 transmission lines. The method was also independently implemented and evaluated at MISO, where it performed faster than alternative methods.

52 citations

Journal ArticleDOI
TL;DR: This paper proposes a new efficient formulation which recasts the max-min problem to a Mixed Integer Programming (MIP) problem using Binary Expansion (BE), and the upper bound of the gap between the new MIP problem and the original max- Min problem is derived.
Abstract: With increasing renewable penetration in power systems, considerable research efforts have been focused on how to accommodate the uncertainties from renewables in the Security-Constraint Unit Commitment (SCUC) problem One of the candidate approaches to handling uncertainties is the two-stage Robust SCUC (RSCUC), which enables system to survive in any scenario The survivability is guaranteed by the solution optimality of the max-min problem in the second stage However, as the non-convex max-min problem is NP-hard, it is difficult to get the exact optimal solution in acceptable time In this paper, we propose a new efficient formulation which recasts the max-min problem to a Mixed Integer Programming (MIP) problem using Binary Expansion (BE) The upper bound of the gap between the new MIP problem and the original max-min problem is derived The gap, which quantifies the solution optimality of the max-min problem, is controllable Two effective acceleration techniques are proposed to improve the performance of the MIP problem by eliminating inactive flow constraints and decomposing time-coupled uncertainty budget constraints Accordingly, the computation burden of solving the max-min problem is reduced tremendously The simulation results for the IEEE 118-Bus system validate and demonstrate the effectiveness of the new BE-based solution approach to the two-stage RSCUC and the acceleration techniques

52 citations

Proceedings ArticleDOI
25 Jun 2018
TL;DR: This paper proposes a Deep Learning (DL) based method to accurately detect stealthy FDI attacks on the SE of power grid and compares the performance of the DL method with three popular machine learning algorithms, which are: gradient boosting machines (GBM), generalized linear modelings (GLM) and distributed random forests (DRF).
Abstract: The electric power grid, as a critical national infrastructure, is under constant threat from cyber-attacks. State estimation (SE) is at the foundation of a series of critical control processes in a power transmission system. A false data injection (FDI) attack against SE can disrupt these control processes, crippling a power system and wreaking havoc in a region. With knowledge of the system topology, a cyber-attacker can formulate and execute stealthy FDI attacks that are very difficult to detect. Statistical and, more recently, machine learning approaches have been undertaken to detect FDI attacks on SE of the power grid. In this paper, we propose a Deep Learning (DL) based method to accurately detect stealthy FDI attacks on the SE of power grid. We compare the performance of the DL method with three popular machine learning algorithms, which are: gradient boosting machines (GBM), generalized linear modelings (GLM) and distributed random forests (DRF). All four algorithms analyze a dataset simulating the IEEE 14-bus system. The results demonstrate that these algorithms perform well in accurately and precisely detecting stealthy FDI attacks on the smart grid, with the DL-based approach showing best results.

52 citations


Cites methods from "MATPOWER: Steady-State Operations, ..."

  • ...For this work, we simulated a standard IEEE 14-bus (transmission) system with 5 generators and 11 loads [37], as shown in Figure 3, using the MATPOWER toolbox [38]....

    [...]

Posted Content
TL;DR: This paper's comprehensive computational results show that the QC relaxation may produce significant improvements in accuracy over the SOC relaxation at a reasonable computational cost, especially for networks with tight bounds on phase angle differences.
Abstract: Convex relaxations of the power flow equations and, in particular, the Semi-Definite Programming (SDP) and Second-Order Cone (SOC) relaxations, have attracted significant interest in recent years. The Quadratic Convex (QC) relaxation is a departure from these relaxations in the sense that it imposes constraints to preserve stronger links between the voltage variables through convex envelopes of the polar representation. This paper is a systematic study of the QC relaxation for AC Optimal Power Flow with realistic side constraints. The main theoretical result shows that the QC relaxation is stronger than the SOC relaxation and neither dominates nor is dominated by the SDP relaxation. In addition, comprehensive computational results show that the QC relaxation may produce significant improvements in accuracy over the SOC relaxation at a reasonable computational cost, especially for networks with tight bounds on phase angle differences. The QC and SOC relaxations are also shown to be significantly faster and reliable compared to the SDP relaxation given the current state of the respective solvers.

52 citations


Cites methods from "MATPOWER: Steady-State Operations, ..."

  • ...IPOPT [42] is used as a heuristic [4] to find a feasible solution to the AC-OPF and we measure the optimally gap between the heuristic and a relaxation using the formula Heuristic´ Relaxation Heuristic ....

    [...]

References
More filters
Book
01 Jan 1984
TL;DR: In this paper, the authors present a graduate-level text in electric power engineering as regards to planning, operating, and controlling large scale power generation and transmission systems, including characteristics of power generation units, transmission losses, generation with limited energy supply, control of generation, and power system security.
Abstract: Topics considered include characteristics of power generation units, transmission losses, generation with limited energy supply, control of generation, and power system security. This book is a graduate-level text in electric power engineering as regards to planning, operating, and controlling large scale power generation and transmission systems. Material used was generated in the post-1966 period. Many (if not most) of the chapter problems require a digital computer. A background in steady-state power circuit analysis is required.

6,344 citations

Book
01 Jan 1977

1,937 citations

Journal ArticleDOI
TL;DR: This paper describes a simple, very reliable and extremely fast load-flow solution method that is attractive for accurate or approximate off-and on-line routine and contingency calculations for networks of any size, and can be implemented efficiently on computers with restrictive core-store capacities.
Abstract: This paper describes a simple, very reliable and extremely fast load-flow solution method with a wide range of practical application. It is attractive for accurate or approximate off-and on-line routine and contingency calculations for networks of any size, and can be implemented efficiently on computers with restrictive core-store capacities. The method is a development on other recent work employing the MW-?/ MVAR-V decoupling principle, and its precise algorithmic form has been determined by extensive numerical studies. The paper gives details of the method's performance on a series of practical problems of up to 1080 buses. A solution to within 0.01 MW/MVAR maximum bus mismatches is normally obtained in 4 to 7 iterations, each iteration being equal in speed to 1? Gauss-Seidel iterations or 1/5th of a Newton iteration. Correlations of general interest between the power-mismatch convergence criterion and actual solution accuracy are obtained.

1,447 citations

Journal ArticleDOI
TL;DR: The ac power flow problem can be solved efficiently by Newton's method because only five iterations, each equivalent to about seven of the widely used Gauss-Seidel method are required for an exact solution.
Abstract: The ac power flow problem can be solved efficiently by Newton's method. Only five iterations, each equivalent to about seven of the widely used Gauss-Seidel method, are required for an exact solution. Problem dependent memory and time requirements vary approximately in direct proportion to problem size. Problems of 500 to 1000 nodes can be solved on computers with 32K core memory. The method, introduced in 1961, has been made practical by optimally ordered Gaussian elimination and special programming techniques. Equations, programming details, and examples of solutions of large problems are given.

1,112 citations


"MATPOWER: Steady-State Operations, ..." refers methods in this paper

  • ...The default solver is based on a standard Newton’s method [7] using a polar form and a full Jacobian updated at each iteration....

    [...]

Journal ArticleDOI
TL;DR: Basic features, algorithms, and a variety of case studies are presented in this paper to illustrate the capabilities of the presented tool and its suitability for educational and research purposes.
Abstract: This paper describes the Power System Analysis Toolbox (PSAT), an open source Matlab and GNU/Octave-based software package for analysis and design of small to medium size electric power systems. PSAT includes power flow, continuation power flow, optimal power flow, small-signal stability analysis, and time-domain simulation, as well as several static and dynamic models, including nonconventional loads, synchronous and asynchronous machines, regulators, and FACTS. PSAT is also provided with a complete set of user-friendly graphical interfaces and a Simulink-based editor of one-line network diagrams. Basic features, algorithms, and a variety of case studies are presented in this paper to illustrate the capabilities of the presented tool and its suitability for educational and research purposes.

890 citations


"MATPOWER: Steady-State Operations, ..." refers background or methods in this paper

  • ...This at least partially explains the lack of a graphical user interface used by some related tools such as PSAT [5]....

    [...]

  • ...A nice summary of their features is presented in [5]....

    [...]