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: A developed LSTM-based attack detection model has a generalization ability to catch modern power grids’ dynamic behaviors, excelling current traditional approaches in the designed case studies and achieves accuracy higher than 90% in all experiments.

30 citations

Journal ArticleDOI
TL;DR: A new constructive heuristic approach, based on a local controlled random search (simulated rebounding algorithm) is proposed to choose the decision variables in the multi-stage security-constrained transmission network expansion planning.

30 citations

Posted ContentDOI
27 Jul 2018
TL;DR: Simulation results indicate that the proposed genetic algorithm with the alternative constraint handling approach yields superior solutions when compared to other recently reported techniques.
Abstract: This paper presents an alternative constraint handling approach within a specialized genetic algorithm (SGA) for the optimal reactive power dispatch (ORPD) problem. The ORPD is formulated as a nonlinear single-objective optimization problem aiming to minimize power losses while keeping network constraints. The proposed constraint handling approach is based on a product of sub-functions that represents permissible limits on system variables and that includes a specific goal on power loss reduction. The main advantage of this approach is the fact that it allows a straightforward verification of both feasibility and optimality. The SGA is examined and tested with the proposed constraint handling approach and the traditional penalization of deviations from feasible solutions. Several tests are run in the IEEE 30, 57, 118 and 300 bus test power systems. The results obtained with the proposed approach are compared to those offered by other metaheuristic techniques reported in the specialized literature. Simulation results indicate that the proposed genetic algorithm with the alternative constraint handling approach yields superior solutions when compared to other recently reported techniques.

30 citations

Journal ArticleDOI
TL;DR: In this paper, the authors proposed a robust N-1 OTS model with the help of corrective actions, where the corrective control with respect to different contingencies is utilized during the period when the transmission topology remains unchanged, which can be formulated as a two-stage problem.
Abstract: In order to achieve a better economic dispatch decision of the electricity generation while guaranteeing system security, the optimal transmission switching (OTS) has been proposed with the well-known N-k contingency security criterion. However, the challenge for treating the OTS problem considering N-k contingencies lie in that it may lead to a conservative result, since the optimal solution should simultaneously satisfy all the sets of N-k constraints. To address this problem, the corrective control with respect to different contingencies is utilised during the period when the transmission topology remains unchanged, which can be formulated as a two-stage problem. Consequently, a two-stage robust optimisation is employed to optimise the objective value under the worst contingency, so as to hedge against the contingency uncertainties. Comparison of the traditional N-1 OTS and the proposed robust N-1 OTS models on IEEE 30-bus test system shows that the robust OTS model has less conservatism than the traditional OTS model with the help of corrective actions. Moreover, it illustrates that the proposed method can be fairly applicable to cases with even N-k contingencies, which can facilitate the complexity of contingency analysis.

30 citations

Journal ArticleDOI
TL;DR: In this paper, the authors propose an algorithm that computes a provably feasible path from an initial operating point to a desired operating point, given an initial feasible point, the algorithm solves a sequence of convex quadratically constrained optimization problems over conservative convex inner approximations of the OPF feasible space.
Abstract: Nonconvexity induced by the nonlinear AC power flow equations challenges solution algorithms for AC optimal power flow (OPF) problems. While significant research efforts have focused on reliably computing high-quality OPF solutions, it is not always clear that there exists a feasible path to reach the desired operating point. Transitioning between operating points while avoiding constraint violations can be challenging since the feasible space of the OPF problem is nonconvex and potentially disconnected. To address this problem, we propose an algorithm that computes a provably feasible path from an initial operating point to a desired operating point. Given an initial feasible point, the algorithm solves a sequence of convex quadratically constrained optimization problems over conservative convex inner approximations of the OPF feasible space. In each iteration, we obtain a new, improved operating point and a feasible transition from the operating point in the previous iteration. In addition to computing a feasible path to a known desired operating point, this algorithm can also be used to improve the operating point locally. Extensive numerical studies on a variety of test cases demonstrate the algorithm and the ability to arrive at a high-quality solution in few iterations.

30 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

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]....

    [...]