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
TL;DR: The numerical results show that the hierarchical coordination using the generalized bid function converges to very close results compared with the results of centralized dispatch.
123 citations
TL;DR: Using adaptive real coded biogeography-based optimization (ARCBBO), this paper presented the optimization of various objective functions of an optimal power flow (OPF) problem in a power system.
122 citations
TL;DR: This paper considers a smart grid cyber-security problem analyzing the vulnerabilities of electric power networks to false data attacks and shows that an relaxation technique provides an exact optimal solution to this cardinality minimization problem.
Abstract: This paper considers a smart grid cyber-security problem analyzing the vulnerabilities of electric power networks to false data attacks. The analysis problem is related to a constrained cardinality minimization problem. The main result shows that an relaxation technique provides an exact optimal solution to this cardinality minimization problem. The proposed result is based on a polyhedral combinatorics argument. It is different from well-known results based on mutual coherence and restricted isometry property. The results are illustrated on benchmarks including the IEEE 118-bus, IEEE 300-bus, and the Polish 2383-bus and 2736-bus systems.
122 citations
Cites background from "MATPOWER: Steady-State Operations, ..."
...nd I being empty. The incidence matrix B describes the topology of one of the following benchmark systems: IEEE 14-bus, IEEE 57-bus, IEEE 118-bus, IEEE 300-bus and Polish 2383-bus and Polish 2736-bus [35]. For each benchmark, (9) is solved for all possible values of k (e.g., 186 choices in the 118- bus case and 411 choices in the 300-bus case). Two solution approaches are tested. The first approach is ...
[...]
TL;DR: In this article, the authors present a novel optimization framework that combines the optimal design and operation of distributed energy systems with calculations of electrical grid constraints and building energy use, which can help in achieving less carbon-intensive energy systems through efficiency gains over centralized power systems.
122 citations
TL;DR: In this article, the vulnerability analysis problem is shown to be NP-hard, meaning that unless P=NP there is no polynomial time algorithm to analyze the vulnerability of the system.
Abstract: The resilience of Supervisory Control and Data Acquisition (SCADA) systems for electric power networks for certain cyber-attacks is considered. We analyze the vulnerability of the measurement system to false data attack on communicated measurements. The vulnerability analysis problem is shown to be NP-hard, meaning that unless P=NP there is no polynomial time algorithm to analyze the vulnerability of the system. Nevertheless, we identify situations, such as the full measurement case, where the analysis problem can be solved efficiently. In such cases, we show indeed that the problem can be cast as a generalization of the minimum cut problem involving nodes with possibly nonzero costs. We further show that it can be reformulated as a standard minimum cut problem (without node costs) on a modified graph of proportional size. An important consequence of this result is that our approach provides the first exact efficient algorithm for the vulnerability analysis problem under the full measurement assumption. Furthermore, our approach also provides an efficient heuristic algorithm for the general NP-hard problem. Our results are illustrated by numerical studies on benchmark systems including the IEEE 118-bus system.
121 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]....
[...]