Search

In recent years, there has been an increasing need to understand the complex interdependencies between critical infrastructure systems, for example, electric power, natural gas, and potable water. Whereas open-source and commercial tools for the independent simulation of these systems are well established, frameworks for cosimulation with other systems are nascent and tools for co-optimization are scarce—the major challenge being the hidden combinatorics that arise when connecting multiple-infrastructure system models. Building toward a comprehensive solution for modeling interdependent infrastructure systems, this work presents InfrastructureModels, an extensible, open-source mathematical programming framework for co-optimizing multiple interdependent infrastructures. This work provides new insights into methods and programming abstractions that make state-of-the-art independent infrastructure models composable with minimal additional effort. To that end, this paper presents the design of the InfrastructureModels framework, documents key components of the software's implementation, and demonstrates its effectiveness with three case studies on canonical co-optimization tasks arising in interdependent infrastructure systems. History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: The work was funded by Los Alamos National Laboratory's Directed Research and Development project "The Optimization of Machine Learning: Imposing Requirements on Artificial Intelligence" and the U.S. Department of Energy's Office of Electricity Advanced Grid Modeling projects "Joint Power System and Natural Gas Pipeline Optimal Expansion Planning" and "Coordinated Planning and Operation of Water and Power Infrastructures for Increased Resilience and Reliability." This work was carried out under the U.S. DOE contract no. [DE-AC52-06NA25396]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0118) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0118). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Recent increases in gas-fired power generation have engendered increased interdependencies between natural gas and power transmission systems. These interdependencies have amplified existing vulnerabilities in gas and power grids, where disruptions can require the curtailment of load in one or both systems. Although typically operated independently, coordination of these systems during severe disruptions can allow for targeted delivery to lifeline services, including gas delivery for residential heating and power delivery for critical facilities. To address the challenge of estimating maximum joint network capacities under such disruptions, we consider the task of determining feasible steady-state operating points for severely damaged systems while ensuring the maximal delivery of gas and power loads simultaneously, represented mathematically as the nonconvex joint Maximal Load Delivery (MLD) problem. To increase its tractability, we present a mixed-integer convex relaxation of the MLD problem. Then, to demonstrate the relaxation's effectiveness in determining bounds on network capacities, exact and relaxed MLD formulations are compared across various multi-contingency scenarios on nine joint networks ranging in size from 25 to 1191 nodes. The relaxation-based methodology is observed to accurately and efficiently estimate the impacts of severe joint network disruptions, often converging to the relaxed MLD problem's globally optimal solution within ten seconds. [ABSTRACT FROM AUTHOR]

This work considers the task of finding an ac-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC maximal load delivery (AC-MLD) task is a nonconvex nonlinear optimization problem that is incredibly challenging to solve on large-scale transmission system data sets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 $N$ - $k$ scenarios on seven power networks ranging in size from 70 to 6000 buses. The most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered. [ABSTRACT FROM AUTHOR]

Around the globe, electric power networks are transforming into complex cyber–physical energy systems (CPES) due to the accelerating integration of both information and communication technologies (ICT) and distributed energy resources. While this integration improves power grid operations, the growing number of Internet-of-Things (IoT) controllers and high-wattage appliances being connected to the electric grid is creating new attack vectors, largely inherited from the IoT ecosystem, that could lead to disruptions and potentially energy market manipulation via coordinated load-altering attacks (LAAs). In this article, we explore the feasibility and effects of a realistic LAA targeted at IoT high-wattage loads connected at the distribution system level, designed to manipulate local energy markets and perform energy storage (ES) arbitrage. Realistic integrated transmission and distribution (T&D) systems are used to demonstrate the effects that LAAs have on locational marginal prices at the transmission level and in distribution systems adjacent to the targeted network. [ABSTRACT FROM AUTHOR]

NMDA-type glutamate receptors mediate both trophic and excitotoxic signalling in CNS neurons. We have previously shown that blocking NMDAR- post-synaptic density-95 ( PSD95) interactions provides significant protection from excitotoxicity and in vivo ischaemia; however, the mechanism of neuroprotection is unclear. Here, we report that blocking PSD-95 interactions with the Tat- NR2B9c peptide enhances a Ca2 + -dependent protective pathway converging on cAMP Response Element binding protein ( CREB) activation. We provide evidence that Tat- NR2B9c neuroprotection from oxygen glucose deprivation and NMDA toxicity occurs in parallel with the activation of calmodulin kinase signalling and is dependent on a sustained phosphorylation of the CREB transcription factor and its activator Ca MKIV. Tat- NR2B9c-dependent neuroprotection and CREB phosphorylation are blocked by coapplication of CaM kinase ( KN93 and STO-609) or CREB ( KG-501) inhibitors, and by si RNA knockdown of Ca MKIV. These results are mirrored in vivo in a rat model of permanent focal ischaemia. Tat- NR2B9c application significantly reduces infarct size and causes a selective and sustained elevation in Ca MKIV phosphorylation; effects which are blocked by coadministration of KN93. Thus, calcium-dependent nuclear signalling via Ca MKIV and CREB is critical for neuroprotection via NMDAR- PSD95 blockade, both in vitro and in vivo. This study highlights the importance of maintaining neuronal function following ischaemic injury. Future stroke research should target neurotrophic and pro-survival signal pathways in the development of novel neuroprotective strategies. [ABSTRACT FROM AUTHOR]

Severe geomagnetic disturbances (GMDs) increase the magnitude of the electric field on the Earth’s surface (E-field) and drive geomagnetically-induced currents (GICs) along the transmission lines in electric grids. These additional currents can pose severe risks, such as current distortions, transformer saturation and increased reactive power losses, each of which can lead to system unreliability. Several mitigation actions (e.g., changing grid topology) exist that can reduce the harmful GIC effects on the grids. Making such decisions can be challenging, however, because the magnitude and direction of the E-field are uncertain and non-stationary. In this paper, we model uncertain E-fields using the distributionally robust optimization (DRO) approach that determines optimal transmission grid operations such that the worst-case expectation of the system cost is minimized. We also capture the effect of GICs on the nonlinear AC power flow equations. For solution approaches, we develop an accelerated column-and-constraint generation (CCG) algorithm by exploiting a special structure of the support set of uncertain parameters representing the E-field. Extensive numerical experiments based on “epri-21” and “uiuc-150” systems, designed for GMD studies, demonstrate (i) the computational performance of the accelerated CCG algorithm, (ii) the superior performance of distributionally robust grid operations that satisfy nonlinear, nonconvex AC power flow equations and GIC constraints, in comparison with standard stochastic programming-based methods during the out-of-sample testing. [ABSTRACT FROM AUTHOR]

The vehicle routing problem with time windows is a hard combinatorial optimization problem that has received considerable attention in the last decades. This paper proposes a two-stage hybrid algorithm for this transportation problem. The algorithm first minimizes the number of vehicles, using simulated annealing. It then minimizes travel cost by using a large neighborhood search that may relocate a large number of customers. Experimental results demonstrate the effectiveness of the algorithm, which has improved 10 (17%) of the 56 best published solutions to the Solomon benchmarks, while matching or improving the best solutions in 46 problems (82%). More important perhaps,the algorithm is shown to be very robust. With a fixed configuration of its parameters, it returns either the best published solutions (or improvements thereof) or solutions very close in quality on all Solomon benchmarks. Very preliminary results on the extended Solomon benchmarks are also given. [ABSTRACT FROM AUTHOR]

This paper presents a deterministic and efficient algorithm for online facility location. The algorithm is based on a simple hierarchical partitioning and is extremely simple to implement. It also applies to a variety of models, i.e., models where the facilities can be placed anywhere in the region, or only at customer sites, or only at fixed locations. The paper shows that the algorithm is O(logn)-competitive under these various models, where n is the total number of customers. It also shows that the algorithm is O(1)-competitive with high probability and for any arrival order when customers are uniformly distributed or when they follow a distribution satisfying a smoothness property. Experimental results for a variety of scenarios indicate that the algorithm behaves extremely well in practice. [Copyright &y& Elsevier]

Focuses on the activities of the American Board of Professional Psychology (ABPP) from 1947 to 1997. Role of ABPP in the history of professional psychology; Influence of ABPP on psychologists and psychological organizations; Purposes and goals of the ABPP.

Distributed generation and remotely controlled switches have emerged as important technologies to improve the resiliency of distribution grids against extreme weather-related disturbances. Therefore it becomes important to study how best to place them on the grid in order to meet a resiliency criteria, while minimizing costs and capturing their dependencies on the associated communication systems that sustain their distributed operations. This paper introduces the Optimal Resilient Design Problem for Distribution and Communication Systems (ORDPDC) to address this need. The ORDPDC is formulated as a two-stage stochastic mixed-integer program that captures the physical laws of distribution systems, the communication connectivity of the smart grid components, and a set of scenarios that specifies which components are affected by potential disasters. The paper proposes an exact branch-and-price algorithm for the ORDPDC that features a strong lower bound and a variety of acceleration schemes to address degeneracy. The ORDPDC model and branch-and-price algorithm were evaluated on a variety of test cases with varying disaster intensities and network topologies. The results demonstrate the significant impact of the network topologies on the expansion plans and costs, as well as the computational benefits of the proposed approach. [ABSTRACT FROM AUTHOR]

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro. [ABSTRACT FROM AUTHOR]

An increasing dependence on natural gas has amplified existing vulnerabilities to the power grid, including disruptions to gas transmission networks from natural and man-made disasters. To address the operational challenges arising from these disruptions, we consider the problem of estimating the steady-state operating capacity of a damaged gas pipeline network while ensuring the maximal delivery of load. Specifically, we formulate the mixed-integer nonconvex maximal load delivery (MLD) problem, which proves difficult to solve on large-scale networks. To address this challenge, we present a relaxation of the MLD problem and use it to determine bounds on the transport capacity of a gas pipeline system. A rigorous computational evaluation over network models ranging in size from 11 to 4 , 197 junctions shows that the relaxation-based method is suitable for analyzing the impacts of multi-contingency network disruptions, often converging to the optimal solution of the relaxation in less than ten seconds. • Maximal Load Delivery (MLD) analysis estimates the capacity of a damaged gas system. • Relaxations of gas network physics increase the tractability of an MLD analysis. • Rigorous benchmarking illustrates computational advantages of the relaxations. • MLD analyses can help estimate the effects of natural disasters on gas networks. [ABSTRACT FROM AUTHOR]

We propose machine learning-based (ML) methods to accelerate convergence to global solutions for the AC Optimal Power Flow (AC-OPF) problem. In particular, for the non-convex AC-OPF problem, optimality-based bound tightening (OBBT) has been observed to be a very effective approach for tightening the variable domains, thus leading to tight convex relaxations that are nearly global optimum solutions. However, by construction, OBBT is computationally expensive even on medium-scaled power networks. To address this issue, we propose a novel ML-based policy to replace the exhaustive algorithm of OBBT by choosing a subset of variables whose tightening of bounds can still contribute to the best improvement of the convex relaxation of the AC-OPF problem. To this end, we leverage historical data of load profiles for a test system to learn a map between the system loading and subset selection of variables which will need to participate in the OBBT algorithm, thus enabling us to find near-global optimal solutions at faster run-times. Finally, we present detailed numerical studies on a few medium-sized benchmark instances, on which we observe up to 6.3× speed-up in OBBT run times. • Novel ML-based policies to accelerate convergence to global solutions for the AC-OPF problem. • Applying optimality-based bound tightening (OBBT) algorithm on an important variable subset. • Leveraging historical data of load profiles to learn a map between the loads and variable subsets. • Numerical studies for corroborating efficacy of ML-based OBBT algorithm on IEEE instances. [ABSTRACT FROM AUTHOR]

Power grid operators decide where and how much power to generate based on the current topology and demands of the network. The topology can change as safety devices trigger (connecting or disconnecting parts of the network) or as lines go down. Often, the operator cannot observe these events directly, but instead has contemporary measurements and historical information about a subset of the line flows and bus (node) properties. This information can be used in conjunction with a computational model to infer the topology of the network. We present a Bayesian approach to topological inference that considers a bank of possible topologies. The solution provides a probability for each member in the model bank. The approach has two important features. First, we build a statistical approximation, or emulator, to the computational model, which is too computationally expensive to run a large number of times. Second, we use the emulator in an importance sampling scheme to estimate the probabilities. The resulting algorithm is fast enough to use in real time and very accurate. This article has online supplementary materials. [ABSTRACT FROM AUTHOR]

Although electricity transmission systems are typically very robust, the impacts that arise when they are disrupted motivate methods for analyzing outage risk. For example, N - k interdiction models were developed to characterize disruptions by identifying the sets of k power system components whose failure results in "worst case" outages. While such models have advanced considerably, they generally neglect how failures outside the power system can cause large-scale outages. Specifically, failures in natural gas pipeline networks that provide fuel for gas-fired generators can affect the function of the power grid. In this study, we extend N - k interdiction modeling to gas pipeline networks. We use recently developed convex relaxations for natural gas flow equations to yield tractable formulations for identifying sets of k components whose failure can cause curtailment of natural gas delivery. We then present a novel cutting-plane algorithm to solve these problems. Finally, we use test instances to analyze the performance of the approach in conjunction with simulations of outage effects on electrical power grids. [ABSTRACT FROM AUTHOR]

Geomagnetic disturbances (GMDs), a result of space weather, pose a severe risk to electric grids. When GMDs occur, they can cause geomagnetically-induced currents (GICs), which saturate transformers, induce hot-spot heating, and increase reactive power losses in the transmission grid. Furthermore, uncertainty in the magnitude and orientation of the geo-electric field, and insufficient historical data make the problem of mitigating the effects of uncertain GMDs challenging. In this paper, we propose a novel distributionally robust optimization (DRO) approach that models uncertain GMDs and mitigates the effects of GICs on electric grids. This is achieved via a set of mitigation actions (e.g., line switching, locating blocking devices, generator re-dispatch and load shedding), prior to the GMD event, such that the worst-case expectation of the system cost is minimized. To this end, we develop a column-and-constraint generation algorithm that solves a sequence of mixed-integer second-order conic programs to handle the underlying convex support set of the uncertain GMDs. Also, we present a monolithic exact reformulation of our DRO model when the underlying support set can be approximated by a polytope with three extreme points. Numerical experiments on 'epri-21' system show the efficacy of the proposed algorithms and the exact reformulation of our DRO model. [ABSTRACT FROM AUTHOR]

Highlights • Networked microgrids connected via a medium-voltage distribution system have been previously proposed as a cost-effective solution for improving distribution system resilience during severe weather events. • A method is developed to evaluate the benefits of networked microgrids for improving resilience. • The method is applied to two large real-world distribution systems. • Results confirm that for some combinations of microgrid construction and line hardening costs a combination of line hardening and network microgrids is the most cost-effective solution to meet resilience requirements. Abstract Electrical distribution systems are often vulnerable to severe weather. Upgrades, such as microgrids, system hardening, and line redundancy, can greatly reduce the number of electrical outages during such extreme events. More recently, the networking of microgrids has received attention as a solution to further improve the resilience of distribution feeders. Although these upgrades have the potential to improve resilience, a barrier to their execution is a lack of tools and approaches that support systematic exploration of the underlying parameters of these upgrades and their cost vs. resilience tradeoffs.To address this gap, we develop a method for designing resilient distribution grids, including networked microgrids, by posing the problem as a two-stage stochastic program. When resilience is defined as the ability of a network to supply load immediately following a storm event, we show that a decomposition-based heuristic algorithm scales to a 1200-node distribution system. We also vary the study parameters, i.e., the cost of microgrids relative to system hardening and target resilience metrics. In this study, we find regions in this parametric space that correspond to different resilient distribution system architectures, such as individual microgrids, hardened networks, and a transition region that suggests the benefits of microgrids networked via hardened circuit segments. [ABSTRACT FROM AUTHOR]

The growing dependence of electric power systems on gas-fired generators to balance fluctuating and intermittent production by renewable energy sources has increased the variation and volume of flows withdrawn from natural gas transmission pipelines. Adapting pipeline operations to maintain efficiency and security under these dynamic conditions requires optimization methods that account for substantial intraday transients and can rapidly compute solutions in reaction to generator re-dispatch. Here, we present a computationally efficient method for minimizing gas compression costs under dynamic conditions where deliveries to customers are described by time-dependent mass flows. The optimization method uses a simplified representation of gas flow physics, provides a choice of discretization schemes in time and space, and exploits a two-stage approach to minimize energy costs and ensure smooth and physically meaningful solutions. The resulting large-scale NLPs are solved using an interior point method. The optimization scheme is validated by comparing the solutions with an integration of the dynamic equations using an adaptive timestepping differential equation solver, as well as a different, recently proposed optimal control scheme. The comparison shows that solutions to the discretized problem are feasible for the continuous problem and also practical from an operational standpoint. The results also indicate that our scheme produces at least an order of magnitude reduction in computation time relative to the state of the art and scales to large gas transmission networks with more than 6,000 kilometers of total pipeline. The online supplement is available at https://doi.org/10.1287/ijoc.2018.0821. [ABSTRACT FROM AUTHOR]

In recent years, there have been increasing concerns about how geomagnetic disturbances (GMDs) impact electrical power systems. Geomagnetically induced currents (GICs) can saturate transformers, induce hot spot heating, and increase reactive power losses. These effects can potentially cause catastrophic damage to transformers and severely impact the ability of a power system to deliver power. To address this problem, we develop a model of GIC impacts to power systems that includes 1) GIC thermal capacity of transformers as a function of normal alternating current (AC), and 2) reactive power losses as a function of GIC. We use this model to derive an optimization problem that protects power systems from GIC impacts through line switching, generator redispatch, and load shedding. We employ state-of-the-art convex relaxations of AC power flow equations to lower bound the objective. We demonstrate the approach on a modified RTS96 system and the UIUC 150-bus system and show that line switching is an effective means to mitigate GIC impacts. We also provide a sensitivity analysis of optimal switching decisions with respect to GMD direction. [ABSTRACT FROM PUBLISHER]

Energy supply in rural and off-grid communities has traditionally relied on diesel-based microgrids, due to limited access. But global environmental concerns are pushing for the transformation of these systems into renewable-based microgrids. This transition to more complex systems with a mix of dispatchable and nondispatchable resources requires new planning tools that ensure the security of supply. This paper presents a novel mixed-integer linear optimization model that determines optimal technology mix, size, placement, and associated dispatch for a multi-energy microgrid. The model satisfies microgrid's electrical and heat transfer network limitations by integrating linear power flow and heat transfer equations. It captures the efficiency gains from waste heat recovery through combined heat and power technologies, by modeling the interplay between electrical and heat sources. To ensure a secure design against generator outages, the optimization maintains sufficient reserve capacity in the system, which is dynamically allocated based on system operating conditions. Several case studies on an isolated microgrid model, developed based on a real microgrid in Alaska, illustrate how the proposed model works. The results show the effectiveness of the model and are used to discuss various aspects of the optimization solution. [ABSTRACT FROM PUBLISHER]

This paper introduces a statistical classifier that quickly locates line outages in a power system utilizing only time series phasor measurement data sampled during the system's transient response to the outage. The presented classifier is a linear multinomial regression model that is trained by solving a maximum likelihood optimization problem using synthetic data. The synthetic data is produced through dynamic simulations which are initialized by random samples of a forecast load/generation distribution. Real time computation of the proposed classifier is minimal and therefore the classifier is capable of locating a line outage before steady state is reached, allowing for quick corrective action in response to an outage. In addition, the output of the classifier fits into a statistical framework that is easily accessible. Specific line outages are identified as being difficult to localize and future improvements to the classifier are proposed. [ABSTRACT FROM PUBLISHER]

Protecting inverter-interfaced microgrids is challenging as conventional time-overcurrent protection becomes unusable due to the lack of fault current. There is a great need for novel protective relaying methods that enable the application of protection coordination on microgrids, thereby allowing for microgrids with larger areas and numbers of loads while not compromising reliable power delivery. Tools for modeling and analyzing such microgrids under fault conditions are necessary in order to help design such protective relaying and operate microgrids in a configuration that can be protected, though there is currently a lack of tools applicable to inverter-interfaced microgrids. This paper introduces the concept of applying an optimization problem formulation to the topic of inverter-interfaced microgrid fault modeling, and discusses how it can be employed both for simulating short-circuits and as a set of constraints for optimal microgrid operation to ensure protective device coordination. [ABSTRACT FROM AUTHOR]