An Interior-Point Solver for AC Optimal Power Flow Considering Variable Impedance-Based FACTS Devices
Not Available
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Not Available
Not provided.
Not provided.
The code is intended to take the data outputted by the MATPOWER OPF solver tools and restructures the data in a way that is best suited for machine learning. The variables are read and the desired values are taken and added to an array in the correct format. This array is then converted into a python array for future use. The code also utilizes MATPOWER's ability to construct different power flow scenarios and repeat them a chosen number of times. Each iteration will add a new line to the formatted array so that the final output is a matrix has a height equal to the number of repetition used.
Abstract not provided.
This grant funded a Market and Technology Assessment project which included 1) an analysis of the total addressable market (TAM) for the RT-OPF technology; 2) a segmented assessment of North American utility business models and barriers to adoption of the RT-OPF technology for those models; 3) a validation of DER customer needs and barriers to participation in utility programs; and 4) a forward-looking analysis of utility regulatory innovation and changes that may impact utility business models and ability for utilities to adopt this technology.
Abstract not provided.
Though the convex optimization has been widely used in power systems, it still cannot guarantee to yield a tight (accurate) solution to some problems. To mitigate this issue, this paper proposes an ensemble learning based convex approximation for alternating current (AC) power flow equations that differs from the existing convex relaxations. The proposed approach is based on three-phase quadratic power flow equations in rectangular coordinates. To develop this data-driven convex approximation of power flows, the polynomial regression (PR) is first deployed as a basic learner to fit convex relationships between the independent and dependent variables. Then, ensemble learning algorithms such as gradient boosting (GB) and bagging are introduced to combine learners to boost model performance. Based on the learned convex approximation of power flow, optimal power flow (OPF) is formulated as a convex quadratic programming problem. The simulation results on IEEE standard cases of both balanced and unbalanced systems show that, in the context of solving OPF, the proposed data-driven convex approximation outperforms the conventional semi-definite programming (SDP) relaxation in both accuracy and computational efficiency, especially in the cases that the conventional SDP relaxation fails
ExaGO is a high-performance computing power systems modeling suite providing models for different power flow analyses. It supports forward AC power flow, multiperiod AC and DC optimal power flow analyses, contingency analysis, as well as stochastic optimal power flow analysis. ExaGO can use HiOp and Ipopt optimization engines. It supports Matpower and PSS/E input file formats. ExaGO v2 includes code from ExaGO 1.6.0.
Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s
MIDAS DC2AC is an automated tool for achieving a converged AC power flow solution from any dispatch, e.g., determined using DC power flow model based optimal power flow. The entire process is free of human interference. It is usually encountered in practice that, even with a DC power flow solution, acquiring the solved AC power flow solution, if exists, sometimes could be a challenging task, especially during the planning stage. It is also difficult to distinguish the unsolvable cases from diverging iterations. Manual adjustments to approach the desired power flow condition has been largely relied on in the past using lots of engineering heuristics. This tool provides a systematic way to first achieve a solvable AC power flow case by modifying the power flow condition, and then try to track the AC power flow solution while gradually removing the adopted changes. If all adopted changes can be completely removed, then the original AC power flow solution is obtained. Otherwise, insights for actionable controls are derived to help operation and planning. Currently, this tool has been implemented in Python using SIEMENS PTI PSS/E as power flow solver, where only adjusting generator terminal voltage set point is considered as an available means to try to turn an unsolved power flow to a solved one. In future, more means should be considered, including the operation of tap-changing transformers, switched shunts and redispatch of active power.
DC2AC is an automated tool for achieving a converged AC power flow solution from any dispatch, e.g., determined using DC power flow model based optimal power flow. The entire process is free of human interference. It is usually encountered in practice that, even with a DC power flow solution, acquiring the solved AC power flow solution, if exists, sometimes could be a challenging task, especially during the planning stage. It is also difficult to distinguish the unsolvable cases from diverging iterations. Manual adjustments to approach the desired power flow condition has been largely relied on in the past using lots of engineering heuristics. This tool provides a systematic way to first achieve a solvable AC power flow case by modifying the power flow condition, and then try to track the AC power flow solution while gradually removing the adopted changes. If all adopted changes can be completely removed, then the original AC power flow solution is obtained. Otherwise, insights for actionable controls are derived to help operation and planning. Currently, this tool has been implemented in Python using SIEMENS PTI PSS/E as power flow solver, where only adjusting generator terminal voltage set point is considered as an available means to try to turn an unsolved power flow to a solved one. In future, more means should be considered, including the operation of tap-changing transformers, switched shunts and redispatch of active power.
Simple Julia scrips for solving AC power flow, AC optimal power flow, and security-constrained AC optimal power flow. These scripts are intended for experimentation with different (possibly, new) methods, formulations, and settings for solving these power system problem. Their implementation, therefore, intentionally avoids excessive encapsulation, which makes other packages difficult to modify by non-developers.
In this paper, we address the problem of the optimal power dispatch of Distributed Generators (DGs) in Alternating Current (AC) networks, better known as the Optimal Power Flow (OPF) problem. We used, as the objective function, the minimization of power losses (P loss ) associated with energy transport, which are subject to the set of constraints that compose AC networks in an environment of distributed generation. To validate the effectiveness of the proposed methodology in solving the OPF problem in any network topology, we employed one 10-node mesh test system and three radial text systems: 10, 33, and 69 nodes. In each test system, DGs were allowed to inject 20%, 40%, and 60% of the power supplied by the slack generator in the base case. To solve the OPF problem, we used a master–slave methodology that integrates the optimization method Salps Swarm Algorithm (SSA) and the load flow technique based on the Successive Approximation (SA) method. Moreover, for comparison purposes, we employed some of the algorithms reported in the specialized literature to solve the OPF problem (the continuous genetic algorithm, the particle swarm optimization algorithm, the black hole algorithm, the antlion optimization algorithm, and the Multi-Verse Optimizer algorithm), which were selected because of their excellent results in solving such problems. The results obtained by the proposed solution methodology demonstrate its superiority and convergence capacity in terms of minimization of P loss in both radial and mesh systems. It provided the best reduction in minimum P loss in short processing times and showed excellent repeatability in each test system and scenario under analysis.
This paper proposes a new formulation and solution algorithm that uses transmission level solar inverters to address the security-constrained optimal power flow (SCOPF) problem. The goal is to stabilize voltage fluctuations in transmission networks in base case and contingency scenarios, by using bulk solar power plant with a minimal number of post-contingency corrections. To achieve this goal, a two-stage volt/var optimization method is proposed to first correct all voltage violations with the volt-var alternating current optimal power flow (ACOPF) algorithm for a base case. Then a linearized SCOPF volt-var control algorithm is proposed to identify the corrective actions for all potential voltage violations in all contingency scenarios. The proposed method was tested and validated on a modified IEEE 118-bus system with solar photovoltaic (PV) data.