skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Entropic Value-at-Risk Constrained Optimal Power Flow Considering Distribution Network Outages During Extreme Events
Measuring and managing the risk of extensive distribution network outages during extreme events is critical for ensuring system-level energy balance in transmission network operations. However, existing risk measures used in stochastic optimization of power systems are computationally intractable for this problem involving large numbers of discrete random variables. Using a new coherent risk measure, Entropic Value-at-Risk (EVaR), that requires significantly less computational complexity, we propose an EVaR-constrained optimal power flow model that can quantify and manage the outage risk of extensive distribution feeders. The optimization problem with EVaR constraints on discrete random variables is equivalently reformulated as a conic programming model, which allows the problem to leverage the computational efficiency of conic solvers. The superiority of the proposed model is validated on the real-world Puerto Rico transmission grid combined with its large-scale distribution networks.  more » « less
Award ID(s):
2103754
PAR ID:
10610271
Author(s) / Creator(s):
; ; ; ; ;
Publisher / Repository:
Institute of Electrical and Electronics Engineers (IEEE)
Date Published:
Journal Name:
IEEE Transactions on Power Systems
Volume:
40
Issue:
1
ISSN:
0885-8950
Page Range / eLocation ID:
1184 to 1187
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Operations Research)
    We describe strong convex valid inequalities for conic quadratic mixed 0–1 optimization. These inequalities can be utilized for solving numerous practical nonlinear discrete optimization problems from value-at-risk minimization to queueing system design, from robust interdiction to assortment optimization through appropriate conic quadratic mixed 0–1 relaxations. The inequalities exploit the submodularity of the binary restrictions and are based on the polymatroid inequalities over binaries for the diagonal case. We prove that the convex inequalities completely describe the convex hull of a single conic quadratic constraint as well as the rotated cone constraint over binary variables and unbounded continuous variables. We then generalize and strengthen the inequalities by incorporating additional constraints of the optimization problem. Computational experiments on mean-risk optimization with correlations, assortment optimization, and robust conic quadratic optimization indicate that the new inequalities strengthen the convex relaxations substantially and lead to significant performance improvements. 
    more » « less
  2. ; ; (, Building Simulation)
    Abstract Buildings use a large amount of energy in the United States. It is important to optimally manage and coordinate the resources across building and power distribution networks to improve overall efficiency. Optimizing the power grid with discrete variables was very challenging for traditional computers and algorithms, as it is an NP-hard problem. In this study, we developed a new optimization solution based on quantum computing for BTG integration. We first used MPC for building loads connected with a commercial distribution grid for cost reduction. Then we used discretization and Benders Decomposition methods to reformulate the problem and decompose the continuous and discrete variables, respectively. We used D-Wave quantum computer to solve dual problems and used conventional algorithm for primal problems. We applied the proposed method to an IEEE 9-bus network with 3 commercial buildings and over 300 residential buildings to evaluate the feasibility and effectiveness. Compared with traditional optimization methods, we obtained similar solutions with some fluctuations and improved computational speed from hours to seconds. The time of quantum computing was greatly reduced to less than 1% of traditional optimization algorithm and software such as MATLAB. Quantum computing has proved the potential to solve large-scale discrete optimization problems for urban energy systems. 
    more » « less
  3. ; ; ; ; ; (, Proceedings of the National Academy of Sciences)
    Distribution networks, with large-scale integration of distributed renewable resources, particularly rooftop solar photovoltaic systems, represent the most extensive yet vulnerable components of modern electric power systems during climate extremes such as hurricanes. However, existing day-ahead electricity dispatch approaches primarily focus on the transmission network and lack the capability to manage the spatiotemporal risks associated with the vast distribution networks, which can potentially lead to significant power imbalances due to the mismatches between scheduled generation and actual demand. To address this increasingly critical gap under intensifying climate extremes and growing distributed renewable integration, we introduce Risk-aware Electricity Dispatch under Climate Extremes with Renewable integration (REDUCER), a risk-aware day-ahead electricity dispatch model that incorporates high-resolution spatiotemporal risk analysis for distribution networks with large-scale distributed renewable integration into an Entropic Value-at-Risk-constrained mixed-integer convex optimization framework. Applied to the 2022 Puerto Rico power grid under Hurricane Fiona, the proposed REDUCER model is seen to effectively manage these risks with substantially less reliance on additional flexibility resources to cope with power imbalances, reducing overall operational costs by about 30% under extreme cases compared to standard unit commitment strategies already informed by average demand loss. Also, the proposed REDUCER model consistently demonstrates its effectiveness in managing the increasing temporal net demand variability introduced by growing large-scale distributed solar integration while maintaining minimal operational costs. This model offers a practical solution for cost-effective and resilient electricity dispatch of modern power systems with large-scale renewable integration facing intensifying climate risks. 
    more » « less
  4. ; ; (, IEEE)
    Combinatorial distribution system optimization problems, such as scheduling electric vehicle (EV) charging during evacuations, present significant computational challenges. These challenges stem from the large numbers of constraints, continuous variables, and discrete variables, coupled with the unbalanced nature of distribution systems. In response to the escalating frequency of extreme events impacting electric power systems, this paper introduces a method that integrates sample-based conservative linear power flow approximations (CLAs) into an optimization framework. In particular, this integration aims to ameliorate the aforementioned challenges of distribution system optimization in the context of efficiently minimizing the charging time required for EVs in urban evacuation scenarios. 
    more » « less
  5. ; ; (, IEEE)
    Optimization problems that involve topology opti- mization in scenarios with large scale outages, such as post- disaster restoration or public safety power shutoff planning, are very challenging to solve. Using simple power flow representa- tions such as DC power flow or network flow models results in low quality solutions which requires significantly higher- than-predicted load shed to become AC feasible. Recent work has shown that formulations based on the Second Order Cone (SOC) power flow formulation find very high quality solutions with low load shed, but the computational burden of these formulations remains a significant challenge. With the aim of reducing computational time while maintaining high solution quality, this work explores formulations which replace the conic constraints with a small number of linear cuts. The goal of this approach is not to find an exact power flow solution, but rather to identify good binary decisions, where the power flow can be resolved after the binary variables are fixed. We find that a simple reformulation of the Second Order Cone Optimal Power Shutoff problem can greatly improve the solution speed, but that a full linearization of the SOC voltage cone equation results in an overestimation of the amount of power that can be delivered to loads. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email