Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Power Flow”

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.

At least 199 records · Page 11

Scenario Creation and Power-Conditioning Strategies for Operating Power Grids with Two-Stage Stochastic Economic Dispatch

A significant difficulty associated with the use of stochastic programming to solve optimal power flow problems on a 5-minute timescale is the quality of renewable energy scenarios input by the user. This is especially true when considering power systems with high penetrations of renewable energy, e.g. wind power. This paper introduces the use of stochastic programming to solve the DC optimal power flow problem with scenarios drawn directly from high-fidelity data sets. Hence, the proposed method avoids the problem of lost physics by finding high-fidelity analogs that can describe future states of the system. Furthermore, this method can be simply extended to output multi-period scenarios to the stochastic program. We demonstrate the effectiveness of this technique by simulating dispatch operations on a synthetic test system over the course of a week.

94 GMLC - Grid Modernization Laboratory Consortium↗

Scenario Creation and Power-Conditioning Strategies for Operating Power Grids with Two-Stage Stochastic Economic Dispatch

A significant difficulty associated with the use of stochastic programming to solve optimal power flow problems on a 5-minute timescale is the quality of renewable energy scenarios input by the user. This is especially true when considering power systems with high penetrations of renewable energy, e.g. wind power. This paper introduces the use of stochastic programming to solve the DC optimal power flow problem with scenarios drawn directly from high-fidelity data sets. Hence, the proposed method avoids the problem of lost physics by finding high-fidelity analogs that can describe future states of the system. Furthermore, this method can be simply extended to output multi-period scenarios to the stochastic program. We demonstrate the effectiveness of this technique by simulating dispatch operations on a synthetic test system over the course of a week.

analog forecast↗

OPFLearn.jl [SWR-21-109]

OPFLearn.jl is a Julia package for creating datasets for machine learning approaches to solving AC optimal power flow (AC OPF). It was developed to provide researchers with a standardized way to efficiently create AC OPF datasets that are representative of more of the AC OPF feasible load space compared to typical dataset creation methods. The OPFLearn dataset creation method uses a relaxed AC OPF formulation to reduce the volume of the unclassified input space throughout the dataset creation process. Over time this input space tightens around the relaxed AC OPF feasible region to increase the percentage of feasible load profiles found while uniformly sampling the input space. Load samples are processed using AC OPF formulations from PowerModels.jl. More information on the dataset creation method can be found in our publication, "OPF-Learn: An Open-Source Framework for Creating Representative AC Optimal Power Flow Datasets". To use OPFLearn.jl a PowerModels network data dictionary is required (can be loaded from Matpower ".m" files) to define the network the dataset is being created for.

Joswig-Jones, Trager↗

OPFLearn.jl v0.1.2 5/18/2023 [SWR-21-109]

OPFLearn.jl is a Julia package for creating datasets for machine learning approaches to solving AC optimal power flow (AC OPF). It was developed to provide researchers with a standardized way to efficiently create AC OPF datasets that are representative of more of the AC OPF feasible load space compared to typical dataset creation methods. The OPFLearn dataset creation method uses a relaxed AC OPF formulation to reduce the volume of the unclassified input space throughout the dataset creation process. Over time this input space tightens around the relaxed AC OPF feasible region to increase the percentage of feasible load profiles found while uniformly sampling the input space. Load samples are processed using AC OPF formulations from PowerModels.jl. More information on the dataset creation method can be found in our publication, "OPF-Learn: An Open-Source Framework for Creating Representative AC Optimal Power Flow Datasets". To use OPFLearn.jl a PowerModels network data dictionary is required (can be loaded from Matpower ".m" files) to define the network the dataset is being created for.

Joswig-Jones, Trager↗

Conservation Voltage Reduction (CVR) via Two-Timescale Control in Unbalanced Power Distribution Systems

Voltage control devices are employed in power distribution systems to reduce the power consumption by operating the system closer to the lower acceptable voltage limits; this technique is called conservation voltage reduction (CVR). The different modes of operation for system’s legacy devices (with binary control) and new devices (e.g. smart inverters with continuous control) coupled with variable photovoltaic (PV) generation results in voltage fluctuations which makes it challenging to achieve CVR objective. This paper presents a two-timescale control of feeder’s voltage control devices to achieve CVR that includes (1)a centralized controller operating in a slower time-scale to coordinate voltage control devices across the feeder and (2) local controllers operating in a faster timescale to mitigate voltage fluctuations due to PV variability. The centralized controller utilizes a three-phase optimal power flow model to obtain the decision variables for both legacy devices and smart inverters. The local controllers operate smart inverters to minimize voltage fluctuations and restore nodal voltages to their reference values by adjusting the reactive power support. The proposed approach is validated using the IEEE-123 bus (medium-size) and R3-12.47-2 (large-size) feeders. It is demonstrated that the proposed approach is effective in achieving the CVR objective for unbalanced distribution systems.

optimal control, distributed generation, fluctuati↗

pnnl/oedisi_dopf

OpenEDI - System Integration (OEDI-SI) - PNNL Distributed Optimal Power Flow (DOPF)

Slay, Tylor↗

Strengthening the SDP Relaxation of AC Power Flows with Convex Envelopes, Bound Tightening, and Valid Inequalities

Here this work revisits the Semidefine Programming (SDP) relaxation of the AC power flow equations in light of recent results illustrating the benefits of bounds propagation, valid inequalities, and the Convex Quadratic (QC) relaxation. By integrating all of these results into the SDP model a new hybrid relaxation is proposed, which combines the benefits from all of these recent works. This strengthened SDP formulation is evaluated on 71 AC Optimal Power Flow test cases from the NESTA archive and is shown to have an optimality gap of less than 1% on 63 cases. This new hybrid relaxation closes 50% of the open cases considered, leaving only 8 for future investigation.

42 ENGINEERING↗

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations

Here, we demonstrate that valid inequalities, or lifted nonlinear cuts (LNC), can be projected to tighten the Second Order Cone (SOC), Convex DistFlow (CDF), and Network Flow (NF) relaxations of the AC Optimal Power Flow (AC-OPF) problem. We conduct experiments on 38 cases from the PGLib-OPF library, showing that the LNC strengthen the SOC and CDF relaxations in 100% of the test cases, with average and maximum differences in the optimality gaps of 6.2% and 17.5% respectively. The NF relaxation is strengthened in 46.2% of test cases, with average and maximum differences in the optimality gaps of 1.3% and 17.3% respectively. We also study the trade-off between relaxation quality and solve time, demonstrating that the strengthened CDF relaxation outperforms the strengthened SOC formulation in terms of runtime and number of iterations needed, while the strengthened NF formulation is the most scalable with the lowest relaxation quality improvement due to these LNC.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Decentralized Optimal Dispatch of Photovoltaic Inverters in Residential Distribution Systems

Summary form only given. Decentralized methods for computing optimal real and reactive power setpoints for residential photovoltaic (PV) inverters are developed in this paper. It is known that conventional PV inverter controllers, which are designed to extract maximum power at unity power factor, cannot address secondary performance objectives such as voltage regulation and network loss minimization. Optimal power flow techniques can be utilized to select which inverters will provide ancillary services, and to compute their optimal real and reactive power setpoints according to well-defined performance criteria and economic objectives. Leveraging advances in sparsity-promoting regularization techniques and semidefinite relaxation, this paper shows how such problems can be solved with reduced computational burden and optimality guarantees. To enable large-scale implementation, a novel algorithmic framework is introduced - based on the so-called alternating direction method of multipliers - by which optimal power flow-type problems in this setting can be systematically decomposed into sub-problems that can be solved in a decentralized fashion by the utility and customer-owned PV systems with limited exchanges of information. Since the computational burden is shared among multiple devices and the requirement of all-to-all communication can be circumvented, the proposed optimization approach scales favorably to large distribution networks.

14 SOLAR ENERGY↗

Tightest Mixed-Integer Programming Formulations for Quadratic SCUC Optimization

In this project, we developed new, tighter Mixed-Integer Programming (MIP) formulations for the combined Alternating Current (AC) Security-Constrained Unit Commitment (SCUC) and Security-Constrained Optimal Power Flow (SCOPF). The work addresses a critical challenge in power system operations: efficiently determining which generation units to commit and how to optimally dispatch them while maintaining network reliability constraints for both normal and contingency scenarios. Our efforts: 1. Advance the Understanding of SCUC/SCOPF Modeling: By introducing tighter MIP formulations and leveraging cutting-edge optimization tools (Julia/JuMP, PowerModels.jl), this project has pushed forward the state of the art in efficient power systems scheduling. 2. Enhance Technical and Economic Feasibility: The methods developed provide more accurate and potentially faster solutions to large-scale, realistic scheduling and dispatch problems in electric power systems, which can translate into improved reliability and potentially lower costs for grid operations. 3. Benefit to the Public: Greater efficiency in power system operations leads to cost savings for utilities and end-users. Improved reliability and integration of advanced modeling approaches can facilitate the adoption of clean energy resources and better accommodate uncertainties in renewable generation. Because this technology could impact bulk power markets and reliability, these innovations have far-reaching public benefits in terms of cost savings, reliability, and sustainability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Topology Reconfiguration and distributed Volt Var Control (TR-dVVC) v1

Topology Reconfiguation is a simple algorithm to choose a network configuration with the least losses in a system with high penetration of renewable energy. It uses a linearized optimal power flow algorithm to identify the optimal setpoints of PV in a system, then performs an exhaustive search of switch configurations to find the loss minimizing solution, it repeats this process until convergence. At the end, the operator has a switch schedule for a 24 hour period that should minimize losses. VVC is a distributed algorithm in which PV units drive voltage at points within the network to 1 per unit through reactive power control. The VVC algorithm relies on extremum seeking control to provide the control. The software package is a simulation of VVC on a standard IEEE 34 bus three phase network.

MacDonald, Jason↗

Stochastic multi-period optimal dispatch of energy storage in unbalanced distribution feeders

This report presents a convex, multi-period, AC-feasible Optimal Power Flow (OPF) framework that robustly dispatches flexible demand-side resources in unbalanced distribution feeders against uncertainty in very-short timescale solar Photo-Voltaic (PV) forecasts. This is valuable for power systems with significant behind-the-meter solar PV generation as their operation is affected by uncertainty from forecasts of demand and solar PV generation. The aim of this work is then to ensure the feasibility and reliability of distribution system operation under high solar PV penetration. We develop and present a novel, robust OPF formulation that accounts for both the nonlinear power flow constraints and the uncertainty in forecasts. This is achieved by linearizing an optimal trajectory and using first-order methods to systematically tighten voltage bounds. Case studies on a realistic distribution feeder shows the effectiveness of a receding-horizon implementation.

25 ENERGY STORAGE↗

Chance-Constrained Day-Ahead Hourly Scheduling in Distribution System Operation

This paper aims to propose a two-step approach for day-ahead hourly scheduling in a distribution system operation, which contains two operation costs, the operation cost at substation level and feeder level. In the first step, the objective is to minimize the electric power purchase from the day-ahead market with the stochastic optimization. The historical data of day-ahead hourly electric power consumption is used to provide the forecast results with the forecasting error, which is presented by a chance constraint and formulated into a deterministic form by Gaussian mixture model (GMM). In the second step, the objective is to minimize the system loss. Considering the nonconvexity of the three-phase balanced AC optimal power flow problem in distribution systems, the second-order cone program (SOCP) is used to relax the problem. Then, a distributed optimization approach is built based on the alternating direction method of multiplier (ADMM). The results shows that the validity and effectiveness method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Beyond Relaxation and Newton–Raphson: Solving AC OPF for Multi-Phase Systems With Renewables

This paper focuses on the AC Optimal Power Flow (OPF) problem for multi-phase systems. Particular emphasis is given to systems with high integration of renewables, where adjustments of the real and reactive output powers from renewable sources of energy are necessary in order to enforce voltage regulation. The AC OPF problem is known to be nonconvex (and, in fact, NP-hard). Convex relaxation techniques have been recently explored to solve the OPF task with reduced computational burden; however, sufficient conditions for tightness of these relaxations are only available for restricted classes of system topologies and problem setups. Identifying feasible power-flow solutions remains hard in more general problem formulations, especially in unbalanced multi-phase systems with renewables. To identify feasible and optimal AC OPF solutions in challenging scenarios where existing methods may fail, this paper leverages the Feasible Point Pursuit - Successive Convex Approximation algorithm - a powerful approach for general nonconvex quadratically constrained quadratic programs. The merits of the approach are illustrated using single- and multiphase distribution networks with renewables, as well as several transmission systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

REDLY

SAND2025-11838O REDLY provides a framework for designing, training, and validating physics-informed neural networks for power system applications. It trains surrogates for Alternating Current Power Flow prediction and general economic dispatch problems, such as Alternating Current Optimal Power Flow and Direct Current Power Flow. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Blakely, Logan↗

Convex Relaxation of Grid-Connected Energy Storage System Models With Complementarity Constraints in DC OPF

Including complementarity constraints in energy storage system (ESS) models in optimization problems ensure an optimal solution will not produce a physically unrealizable control strategy where there is simultaneous charging and discharging. However, the current approaches to impose complementarity constraints require the use of non-convex optimization methods. Here, we propose a convex relaxation for a common ESS model that has terms for both charging and discharging based on a penalty reformulation for use in a model predictive control (MPC) based optimal power flow (DC OPF) problem. In this approach, the complementarity constraints are omitted and a penalty term is added to the optimization objective function. For the DC OPF problem, we provide analysis for the conditions under which the convex relaxation of the complementarity constraint ensures that a solution with simultaneous ESS charging and discharging operation is suboptimal. Simulation results demonstrating ESS behavior with and without the penalty reformulation are provided for an MPC-based DC OPF problem on multiple IEEE test systems.

25 ENERGY STORAGE↗

Multiphase Optimal and Non-Singular Power Flow by Successive Linear Approximations

We propose an optimal power flow method for multiphase power systems. The method works for both radial and meshed networks, and is able to accommodate different types of load/source connections such as wye, delta, and combination thereof. Moreover, the method generates a sequence of nonsingular points (i.e., associated with non-singular power-flow Jacobian) in the electrical state space and a corresponding sequence of power injections, which can be used in real-time control settings. Under certain conditions, the sequences attain the local minimum. The method has been tested using several typical networks, including the IEEE 37-bus and 123-bus test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗