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.
Citations
More filters
21 Jul 2013
TL;DR: In this article, the authors proposed a fully decentralized algorithm to solve alternating current (AC) optimal power flow (OPF) problems in a smart grid environment, where no central or sub-area controller is needed, and the OPF problem is solved by individual nodes which only have local knowledge of the system.
Abstract: Motivated by the increasing complexity in the control of distribution level electric power systems especially in a smart grid environment, we propose fully decentralized algorithms to solve alternating current (AC) optimal power flow (OPF) problems. The key feature of the proposed algorithms is a complete decentralization of computation down to nodal level. In this way, no central or sub-area controller is needed, and the OPF problem is solved by individual nodes, which only have local knowledge of the system. Preliminary results show promising performance of the fully decentralized algorithms.
85 citations
Cites methods from "MATPOWER: Steady-State Operations, ..."
...We have also conducted preliminary tests on small meshed networks from MATPOWER’s library [20] (a 4-bus system with 2 generators and 4 branches connecting 4 buses in a cycle, and a 6-bus system with 3 generators and 11 branches)....
[...]
TL;DR: In this article, a decentralized unscented Kalman filter (UKF) method based on a consensus algorithm for multi-area power system dynamic state estimation is presented, where the overall system is split into a certain number of non-overlapping areas.
85 citations
TL;DR: This paper proposes a heuristic yet effective method to determine a feasible attacking region of a single line, which requires less network information, and uses six IEEE standard systems to validate the proposed attacking strategy.
Abstract: It has been shown that an attacker can stealthily launch false data injection attacks against the state estimation without knowing the full topology and parameter information of the entire power network. In this paper, we propose a heuristic yet effective method to determine a feasible attacking region of a single line, which requires less network information. We use six IEEE standard systems to validate the proposed attacking strategy. This paper can reveal the vulnerability of the real-time topology of a power grid and is very helpful to develop effective protection strategies against topology attacks in smart grids.
85 citations
Cites methods from "MATPOWER: Steady-State Operations, ..."
...In this section, we test the local topology attacking model using the IEEE 14-bus, IEEE 24-bus, IEEE 30-bus, IEEE 39-bus, IEEE 57-bus and IEEE 118-bus systems [22]....
[...]
01 Oct 2012
TL;DR: This work proposes two algorithms based on the spatial branch and bound framework with lower bounds on the optimal objective function value calculated by solving either the Lagrangian dual or the semidefinite programming (SDP) relaxation for the solution of the Optimal Power Flow problem to global optimality.
Abstract: We propose two algorithms for the solution of the Optimal Power Flow (OPF) problem to global optimality. The algorithms are based on the spatial branch and bound framework with lower bounds on the optimal objective function value calculated by solving either the Lagrangian dual or the semidefinite programming (SDP) relaxation. We show that this approach can solve to global optimality the general form of the OPF problem including: generation power bounds, apparent and real power line limits, voltage limits and thermal loss limits. The approach makes no assumption on the topology or resistive connectivity of the network. This work also removes some of the restrictive assumptions of the SDP approaches [1], [2], [3], [4], [5]. We present the performance of the algorithms on a number of standard IEEE systems, which are known to have a zero duality gap. We also make parameter perturbations to the test cases that result in solutions that fail to satisfy the SDP rank condition and have a non-zero duality gap. The proposed branch and bound algorithms are able to solve these cases to global optimality.
84 citations
Posted Content•
TL;DR: In this paper, moment-based relaxations of the OPF problem developed from the theory of polynomial optimization problems are investigated, and they are generally tighter than the semidefinite relaxation employed in previous research, thus resulting in global solutions for a broader class of OPF problems.
Abstract: The optimal power flow (OPF) problem minimizes power system operating cost subject to both engineering and network constraints. With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex AC OPF problem. This paper investigates ``moment-based'' relaxations of the OPF problem developed from the theory of polynomial optimization problems. At the cost of increased computational requirements, moment-based relaxations are generally tighter than the semidefinite relaxation employed in previous research, thus resulting in global solutions for a broader class of OPF problems. Exploration of the feasible space for test systems illustrates the effectiveness of the moment-based relaxation.
84 citations
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
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
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....
[...]
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]....
[...]