Line Roald

Dr. Line Roald


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 August 2017 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
LRLine Roald
Line Roald
GAGoran Andersson
Goran Andersson
Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. In this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. We first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.

23 December 2020 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
NRNoah Rhodes
Noah Rhodes
LNLewis Ntaimo
Lewis Ntaimo
LRLine Roald
Line Roald
Electric grid faults can ignite catastrophic wildfires, particularly in regions with high winds and low humidity. In real-time operations, electric utilities have few options for wildfire risk mitigation, leading to use of disruptive measures such as proactive de-energization of equipment, frequently referred to as public safety power shut-offs. Such power shut-offs have significant impacts on customers, who experience power cuts in an attempt to protect them from fires. This work proposes the optimal power shut-off problem, an optimization model to support short-term operational decision making in the context of extreme wildfire risk. Specifically, the model optimizes grid operations to maximize the amount of power that can be delivered, while proactively minimizing the risk of wildfire ignitions by selectively de-energizing components in the grid. This is the first optimization model to consider how preventive wildfire risk measures impact both wildfire risk and power systems reliability at a short-term, operational time-frame. The effectiveness of the method is demonstrated on an augmented version of the RTS-GMLC test case, located in Southern California, and compared against two approaches based on simple risk thresholds. The proposed optimization-based model reduces both wildfire risk and lost load shed relative to the benchmarks.

1 January 2022 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
SMSidhant Misra
Sidhant Misra
LRLine Roald
Line Roald
YNYeesian Ng
Yeesian Ng
In many engineered systems, optimization is used for decision making at time scales ranging from real-time operation to long-term planning. This process often involves solving similar optimization problems over and over again with slightly modified input parameters, often under tight latency requirements. We consider the problem of using the information available through this repeated solution process to learn important characteristics of the optimal solution as a function of the input parameters. Our proposed method is based on learning relevant sets of active constraints, from which the optimal solution can be obtained efficiently. Using active sets as features preserves information about the physics of the system, enables interpretable results, accounts for relevant safety constraints, and is easy to represent and encode. However, the total number of active sets is also very large, as it grows exponentially with system size. The key contribution of this paper is a streaming algorithm that learns the relevant active sets from training samples consisting of the input parameters and the corresponding optimal solution, without any restrictions on the problem type, problem structure or probability distribution of the input parameters. The algorithm comes with theoretical performance guarantees and is shown to converge fast for problem instances with a small number of relevant active sets. It can thus be used to establish simultaneously learn the relevant active sets and the practicability of the learning method. Through case studies in optimal power flow, supply chain planning, and shortest path routing, we demonstrate that often only a few active sets are relevant in practice, suggesting that active sets provide an appropriate level of abstraction for a learning algorithm to target.

22 May 2019 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
TMTillmann Muhlpfordt
Tillmann Muhlpfordt
LRLine Roald
Line Roald
VHVeit Hagenmeyer
Veit Hagenmeyer
TFTimm Faulwasser
Timm Faulwasser
SMSidhant Misra
Sidhant Misra
As the share of renewables in the grid increases, the operation of power systems becomes more challenging. The present paper proposes a method to formulate and solve chance-constrained optimal power flow while explicitly considering the full nonlinear AC power flow equations and stochastic uncertainties. We use polynomial chaos expansion to model the effects of arbitrary uncertainties of finite variance, which enables to predict and optimize the system state for a range of operating conditions. We apply chance constraints to limit the probability of violations of inequality constraints. Our method incorporates a more detailed and a more flexible description of both the controllable variables and the resulting system state than previous methods. Two case studies highlight the efficacy of the method, with a focus on satisfaction of the AC power flow equations and on the accurate computation of moments of all random variables.

3 January 2019 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
MLM. Lubin
M. Lubin
YDY. Dvorkin
Y. Dvorkin
LRLine Roald
Line Roald

22 June 2020 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
APAlejandra Pena-Ordieres
Alejandra Pena-Ordieres
DMDaniel Molzahn
Daniel Molzahn
LRLine Roald
Line Roald
AWAndreas Waechter
Andreas Waechter
Managing uncertainty and variability in power injections has become a major concern for power system operators due to the increasing levels of fluctuating renewable energy connected to the grid. This work addresses this uncertainty via a joint chance-constrained formulation of the DC optimal power flow (OPF) problem, which satisfies all the constraints jointly with a pre-determined probability. The few existing approaches for solving joint chance-constrained OPF problems are typically either computationally intractable for large-scale problems or give overly conservative solutions that satisfy the constraints far more often than required, resulting in excessively costly operation. This paper proposes an algorithm for solving joint chance-constrained DC OPF problems by adopting an Sl1QP-type trust-region algorithm. This algorithm uses a sample-based approach that avoids making strong assumptions on the distribution of the uncertainties, scales favorably to large problems, and can be tuned to obtain less conservative results. We illustrate the performance of our method using several IEEE test cases. The results demonstrate the proposed algorithm's advantages in computational times and limited conservativeness of the solutions relative to other joint chance-constrained DC OPF algorithms.