MPC-Based Black Start and Restoration for Resilient DER-Rich Electric Distribution System
Not Available
SEARCH · Search NASA
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
Given a graph where each vertex is assigned a generation or consumption volume, we try to bisect the graph so that each part has a significant generation/consumption mismatch, and the cutsize of the bisection is small. Our motivation comes from the vulnerability analysis of distribution systems such as the electric power system. We show that the constrained version of the problem, where we place either the cutsize or the mismatch significance as a constraint and optimize the other, is NP-complete, and provide an integer programming formulation. We also propose an alternative relaxed formulation, which can trade-off between the two objectives and show that the alternative formulation of the problem can be solved in polynomial time by a maximum flow solver. Our experiments with benchmark electric power systems validate the effectiveness of our methods.
This study develops a tractable formulation for optimal placement and sizing of inverter-based renewable systems in multi-phase distribution networks. The goal of the formulation is to minimize the cost of inverter installation, average power import, and average distributed generation curtailment. Threephase and single-phase inverter models are presented that preserve the underlying mappings between renewable uncertainty to power injection. The uncertainty of distributed generators (DGs) and loads are characterized by a finite set of scenarios. Linear multi-phase power flow approximations are used in conjunction with scenario reduction techniques to arrive at a tractable twostage stochastic formulation for optimal DG placement and sizing. First-stage decisions are locations for DG deployment and capacity sizes, and second-stage decisions include DG real power curtailment, reactive power support, as well as feeder voltage profile. The resulting formulation is a mixed-integer second-order cone program and can be solved efficiently either by existing optimization solvers or by relaxing the binary variables to the [0,1] interval. Simulation studies on standard multi-phase IEEE test feeders promise that optimal stochastic planning of DGs reduces costs during validation, compared to a scheme where uncertainty is only represented by its average value.
The workplace charging (WPC) has been recently recognized as the most important secondary charging point next to residential charging for plug-in electric vehicles (PEVs). The current WPC practice is spontaneous and grants every PEV a designated charger, which may not be practical or economic when there are a large number of PEVs present at workplace. This study is the first research undertaken that develops an optimization framework for WPC strategies to satisfy all charging demand while explicitly addressing different eligible levels of charging technology and employees’ demographic distributions. The optimization model is to minimize the lifetime cost of equipment, installations, and operations, and is formulated as an integer program. We demonstrate the applicability of the model using numerical examples based on national average data. The results indicate that the proposed optimization model can reduce the total cost of running a WPC system by up to 70% compared to the current practice. The WPC strategies are sensitive to the time windows and installation costs, and dominated by the PEV population size. The WPC has also been identified as an alternative sustainable transportation program to the public transit subsidy programs for both economic and environmental advantages.
Semantic graphs have become key components in analyzing complex systems such as the Internet, or biological and social networks. These types of graphs generally consist of sparsely connected clusters or 'communities' whose nodes are more densely connected to each other than to other nodes in the graph. The identification of these communities is invaluable in facilitating the visualization, understanding, and analysis of large graphs by producing subgraphs of related data whose interrelationships can be readily characterized. Unfortunately, the ability of LLNL to effectively analyze the terabytes of multisource data at its disposal has remained elusive, since existing decomposition algorithms become computationally prohibitive for graphs of this size. We have addressed this limitation by developing more efficient algorithms for discerning community structure that can effectively process massive graphs. Current algorithms for detecting community structure, such as the high quality algorithm developed by Girvan and Newman [1], are only capable of processing relatively small graphs. The cubic complexity of Girvan and Newman, for example, makes it impractical for graphs with more than approximately 10{sup 4} nodes. Our goal for this project was to develop methodologies and corresponding algorithms capable of effectively processing graphs with up to 10{sup 9} nodes. From a practical standpoint, we expect the developed scalable algorithms to help resolve a variety of operational issues associated with the productive use of semantic graphs at LLNL. During FY07, we completed a graph clustering implementation that leverages a dynamic graph transformation to more efficiently decompose large graphs. In essence, our approach dynamically transforms the graph (or subgraphs) into a tree structure consisting of biconnected components interconnected by bridge links. This isomorphism allows us to compute edge betweenness, the chief source of inefficiency in Girvan and Newman's decomposition algorithm, much more efficiently, leading to significantly reduced computation time. Test runs on a desktop computer have shown reductions of up to 89%. Our focus this year has been on the implementation of parallel graph clustering on one of LLNL's supercomputers. In order to achieve efficiency in parallel computing, we have exploited the fact that large semantic graphs tend to be sparse, comprising loosely connected dense node clusters. When implemented on distributed memory computers, our approach performed well on several large graphs with up to one billion nodes, as shown in Table 2. The rightmost column of Table 2 contains the associated Newman's modularity [1], a metric that is widely used to assess the quality of community structure. Existing algorithms produce results that merely approximate the optimal solution, i.e., maximum modularity. We have developed a verification tool for decomposition algorithms, based upon a novel integer linear programming (ILP) approach, that computes an exact solution. We have used this ILP methodology to find the maximum modularity and corresponding optimal community structure for several well-studied graphs in the literature (e.g., Figure 1) [3]. The above approaches assume that modularity is the best measure of quality for community structure. In an effort to enhance this quality metric, we have also generalized Newman's modularity based upon an insightful random walk interpretation that allows us to vary the scope of the metric. Generalized modularity has enabled us to develop new, more flexible versions of our algorithms. In developing these methodologies, we have made several contributions to both graph theoretic algorithms and software engineering. We have written two research papers for refereed publication [3-4] and are working on another one [5]. In addition, we have presented our research findings at three academic and professional conferences.
We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses O (log 2 ( N )) binary variables (qubits) for finding the factors of an integer N. We present how to factorize 15, 143, 59989, and 376289 using 4, 12, 59, and 94 logical qubits, respectively. This method was tested using the D-Wave 2000Q for finding an embedding and determining the prime factors for a given composite number. The method is general and could be used to factor larger integers as the number of available qubits increases, or combined with other ad hoc methods to achieve better performances for specific numbers.
The current linear “take-make-waste-extractive” model leads to the depletion of natural resources and environmental degradation. Circular Economy (CE) aims to address these impacts by building supply chains that are restorative, regenerative, and environmentally benign. This can be achieved through the re-utilization of products and materials, the extensive usage of renewable energy sources, and ultimately by closing any open material loops. Such a transition towards environmental, economic and social advancements requires analytical tools for quantitative evaluation of the alternative pathways. Here, in this work, we present a novel CE system engineering framework and decision-making tool for the modeling and optimization of food supply chains. First, the alternative pathways for the production of the desired product and the valorization of wastes and by-products are identified. Then, a Resource-Task-Network representation that captures all these pathways is utilized, based on which a mixed-integer linear programming model is developed. This approach allows the holistic modeling and optimization of the entire food supply chain, taking into account any of its special characteristics, potential constraints as well as different objectives. Considering that typically CE introduces multiple, often conflicting objectives, we deploy here a multi-objective optimization strategy for trade-off analysis. A representative case study for the supply chain of coffee is discussed, illustrating the steps and the applicability of the framework. Single and multi-objective optimization formulations under five different coffee-product demand scenarios are presented. The production of instant coffee as the only final product is shown to be the least energy and environmental efficient scenario. On the contrary, the production solely of whole beans sets a hypothetical upper bound on the optimal energy and environmental utilization. In both problems presented, the amount of energy generated is significant due to the utilization of waste generated for the production of excess energy.
A known challenge for the simulation of reacting flow systems is that detailed chemical mechanisms contain hundreds to thousands of species and thousands of reactions, leading to high CPU requirements despite the use of state-of-the-art solvers. For specific conditions of interest (temperature, pressure, and composition), smaller mechanisms can predict the chemistry relatively accurately. One possibility for obtaining such mechanisms is species elimination from a detailed mechanism. Here, an automatic method for kinetic model reduction by simultaneous reaction and species elimination is proposed, based on an integer linear program (ILP) formulation. The solution of the ILP is an optimally reduced kinetic mechanism that reproduces the predictions of a reference mechanism within prespecified tolerances for finitely many reference points in the state space. The method is applied to generate optimally reduced models for isobaric, adiabatic homogeneous combustion. Case studies are presented for the combustion of n-heptane. Comparisons between the full and reduced models are shown and the tradeoff between species and reaction elimination is discussed. Tolerances in the ILP formulation control the error introduced by the model reduction. For increasing acceptable error, more species and/or reactions are eliminated. A method of quantifying this tradeoff between approximation error and reduction achieved is proposed, based on multiobjective optimization, and demonstrated in a case study. The effect of variable initial conditions is investigated. The mechanisms generated achieve significant reduction in the CPU requirement and can accurately predict the trajectories of the state variables (species mass fractions and temperature), as well as other metrics of interest, such as ignition time delay. (author)
In this paper, we propose an optimal bidding strategy in the day-ahead market of a microgrid consisting of intermittent distributed generation (DG), storage, dispatchable DG and price responsive loads. The microgrid coordinates the energy consumption or production of its components and trades electricity in both the day-ahead and real-time markets to minimize its operating cost as a single entity. The bidding problem is challenging due to a variety of uncertainties, including power output of intermittent DG, load variation, day-ahead and real-time market prices. A hybrid stochastic/robust optimization model is proposed to minimize the expected net cost, i.e., expected total cost of operation minus total benefit of demand. This formulation can be solved by mixed integer linear programming. The uncertain output of intermittent DG and day-ahead market price are modeled via scenarios based on forecast results, while a robust optimization is proposed to limit the unbalanced power in real-time market taking account of the uncertainty of real-time market price. Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator, a battery and a responsive load show the advantage of stochastic optimization in addition to robust optimization.
Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.
The role of building thermal and battery storage is pivotal in advancing smart cities and achieving sustainability goals through effective energy management. Despite their significance, there are several limitations in the sizing approach and value stream analysis with various objectives for their widespread adoption in buildings. This work proposes a flexible and scalable multi-objective optimization framework for optimal sizing and dispatch of building thermal and battery storage, addressing conflicting objectives simultaneously using mixed-integer linear programming. The weighted-sum method is adapted, combining multiple objectives into a single function. The two-stage procedure iterates over different weights, generating optimal solutions and forming the Pareto front. Case studies are performed to assess the energy, economic, and environmental benefits of building energy storage systems for a large office building in three climate locations. The results demonstrate that the proposed framework efficiently determines optimal sizing and dispatch strategies, addressing the balance between economic viability and emission reduction. The dynamic relationship between time-of-use energy charges and emission factors leads to significantly different strategies based on whether economic or environmental concerns are prioritized. This research enhances our understanding of the benefits of TES and BES systems in buildings, providing valuable guidance to stakeholders.
Multi-objective optimisation of capacity planning for a grid-connected Microgrid (MG) with multi-energy demands is developed in this study. The optimal multi-energy coordinated scheduling, in which uncertainties of renewable energy generation and electricity demand are described by uncertainty intervals, is considered within the capacity planning model. To solve the capacity planning problem while considering the optimal scheduling with uncertainties, a two-level optimisation approach is proposed by integrating interval mixed integer linear programming for scheduling into the multi-objective particle swarm optimisation for capacity planning. The multi-objective addresses the economic issue by minimising the worst-case optimal annual costs of device investments, operation and maintenance, and pollutant emission treatment, as well as the reliability concern by minimising the worst-case optimal annual costs of energy outage. Several MG cases studies are shown to demonstrate the proposed method.
In the aftermath of increasingly frequent catastrophic events, a typical scenario is Critical Infrastructure (CI) units being supported by available backup sources with a weak power grid that can be intermittent or absent. Such a scenario is significantly challenging in the sense of reliable supply of power to CI units. In this article, an intelligent optimization scheme termed as Horizon of Viability (HoV) engine is developed to guarantee the viability of a sustained reliable supply of power to the CI units over a time-horizon. The proposed HoV engine generates a cost-optimal portfolio of the locally available generation sources and the loads over a time horizon using a mixed-integer convex programming problem. A Controller hardware-in-the-loop (CHIL) platform is developed to evaluate the control performance of the HoV engine. The experimental results corroborates the efficacy in maintaining the viability of the CI units after a grid interruption event. Further, the proposed HoV optimization scheme performs better compared to existing net-load management schemes in the literature.
Here, we present a scalable design of an experiments framework for sensor placement in systems described by partial differential equations (PDEs). In particular, we aim to compute optimal sensor locations by minimizing the uncertainty of parameters estimated from Bayesian inverse problems and where the system. The resulting problem is a computationally intractable mixed-integer nonlinear program constrained by PDEs. We approach this problem with two heuristics used in compressed sensing and optimal control literature: a sparsity-inducing approach and a sum-up rounding approach. We also investigate metrics to guide the design of experiments (the total flow variance and the A-optimal design criterion) and analyze the effect of different noise structures (white and colored). Using an application in natural gas pipelines, we conclude that the sum-up rounding approach approach gives the best results and produces shrinking gaps with increasing mesh resolution. We also observe that convergence for the white noise measurement error case is slower than for the colored noise case. For A-optimal design, the solution is close to a uniform distribution of sensors along the pipeline while for the flow variance design the distribution is unstructured.
Unmanned vehicles, both aerial and ground, are being used in several monitoring applications to collect data from a set of targets. This article addresses a problem where a group of heterogeneous aerial or ground vehicles with different motion constraints located at distinct depots visit a set of targets. The vehicles also may be equipped with different sensors, and therefore, a target may not be visited by any vehicle. The objective is to find an optimal path for each vehicle starting and ending at its respective depot such that each target is visited at least once by some vehicle, the vehicle–target constraints are satisfied, and the sum of the length of the paths for all the vehicles is minimized. Two variants of this problem are formulated (one for ground vehicles and another for aerial vehicles) as mixed-integer linear programs and a branchand- cut algorithm is developed to compute an optimal solution to each of the variants. Computational results show that optimal solutions for problems involving 100 targets and 5 vehicles can be obtained within 300 seconds on average, further corroborating the effectiveness of the proposed approach.
An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.
Revenue estimation for integrated renewable energy and energy storage systems is important to support plant owners or operators’ decisions in battery sizing selection that leads to maximized financial performances. A common approach to optimizing revenues of a hybrid hydro and energy storage system is using mixed-integer linear programming (MILP). Although MILP models can provide accurate production cost estimations, they are typically very computationally expensive. To provide a fast yet accurate first-step information to hydropower plant owners or operators who consider integrating energy storage systems, we propose an innovative approach to predicting optimal revenues of an integrated energy generation and storage system. In this study, we examined the performance of two prediction techniques: Generalized Additive Models (GAMs) and machine learning (ML) models developed based on artificial neural networks (ANN). Predictive equations and models are generated based on optimized solutions from a market participation optimization model, the Conventional Hydropower Energy and Environmental Resource System (CHEERS) model. The two predicting techniques reduce the computational time to evaluate annual revenue for one set of battery configurations from 3 h to 1 to 4 min per run while also being implementable with significantly less data. The model validation prediction errors of developed GAMs and ML models are generally below 5%; for model testing predictions, the ML models consistently outperform the regression equations in terms of root mean square errors. This new approach allows plant owners, operators, or potential investors to quickly access multiple battery configurations under different energy generation and market scenarios. This new revenue prediction method will therefore help reduce the barriers, and thereby promoting the deployment of battery hybridization with existing renewable energy sources.
Not Available