Dynamic Programming Method to Optimally Select Power Distribution System Reliability Upgrades
Not Available
42 ENGINEERING↗
SEARCH · Search NASA
Results for “Mixed Integer Programming”
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.
Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets
With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.
active distribution network↗
Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets
With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.
Xue, Yaosuo↗
Robust Distribution Network Reconfiguration
We propose a two-stage robust optimization model for the distribution network reconfiguration problem with load uncertainty. The first-stage decision is to configure the radial distribution network and the second-stage decision is to find the optimal a/c power flow of the reconfigured network for given demand realization. We solve the two-stage robust model by using a column-and-constraint generation algorithm, where the master problem and subproblem are formulated as mixed-integer second-order cone programs. Computational results for 16, 33, 70, and 94-bus test cases are reported. We find that the configuration from the robust model does not compromise much the power loss under the nominal load scenario compared to the configuration from the deterministic model, yet it provides the reliability of the distribution system for all scenarios in the uncertainty set.
distribution network↗
Optimizing design and dispatch of a renewable energy system
Renewable energy technologies are becoming increasingly important due to their cost-competitiveness, and because of enhanced climate concerns. We demonstrate the capabilities of an integer-programming optimization model that minimizes capital (investment) and operational costs, and utility charges, while adhering to system sizing constraints, demand requirements, and interoperability characteristics of the systems chosen. Furthermore, the model recommends an optimally sized mix of renewable energy, conventional generation, and energy storage technologies, while simultaneously optimizing the corresponding dispatch strategy. Our case studies explore several venues, i.e., a small campus and a local hospital, with complex utility rate tariffs, multi-technology integration opportunities, and incentives for renewable power production. Using an optimization model, versus applying rules of thumb, can produce millions of dollars in savings over a 25-year time horizon and result in thousands of kilowatts of installed renewable energy.
25 ENERGY STORAGE↗
Modeling design and control problems involving neural network surrogates
Here, we consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence, and then characterize stationarity of such models. We then present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation: as a mixed-integer optimization problem and as a mathematical program with complementarity constraints. For the latter formulation we prove that stationarity at a point for this problem corresponds to stationarity of the embedded formulation. Each of these formulations may be solved with state-of-the-art optimization methods, and we show how to obtain good initial feasible solutions for these methods. We compare our formulations on three practical applications arising in the design and control of combustion engines, in the generation of adversarial attacks on classifier networks, and in the determination of optimal flows in an oil well network.
97 MATHEMATICS AND COMPUTING↗
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty
Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.
97 MATHEMATICS AND COMPUTING↗
Stochastic Strategic Participation of Active Distribution Networks With High-Penetration DERs in Wholesale Electricity Markets
With the increasing penetration of distributed energy resources (DERs), traditional distribution networks as load-serving entities in wholesale electricity markets, now evolve towards active distribution networks (ADNs) which can proactively participate in wholesale markets by optimally controlling the DERs in their networks. A stochastic bilevel optimization model is proposed in this paper for the strategic participation of ADNs and DERs to provide energy and grid services in wholesale electricity markets. The bilevel optimization model can capture the interactions between the ADN and the wholesale energy and ancillary service markets, considering the uncertainties of DERs in the ADN. In the upper-level model, the ADN makes optimal decisions on energy and reserve bidding considering the availability, uncertainties, and flexibility of DERs. The joint energy and reserve market-clearing of the independent system operator (ISO) is modeled as the lower-level problem. Using strong duality theory and Karush-Kuhn Tucker (KKT) conditions, the proposed bilevel optimization problem is reformulated as mathematical programming with equilibrium constraints (MPEC) problem and further converted into a computationally-solvable mixed-integer second-order-cone programming (MISOCP) model. The simulation results demonstrate the effectiveness of the model and the interactions between an ADN and wholesale electricity markets.
active distribution network↗
A Stochastic Charging Station Deployment Model for Electrified Taxi Fleets in Coupled Urban Transportation and Power Distribution Networks
Metropolitansworldwide are increasingly adopting electric taxis (ET) to address concerns about transportation-related emissions. However, the widespread deployment of electric taxis presents challenges in terms of increased electricity demand and changing demand profiles. This transition impacts both the urban transportation network (TN) and the electricity power distribution network (PDN), highlighting the interdependence between these two systems. Here, in this paper, we propose a two-stage stochastic programming planning model that aims to optimize both the TN and PDN, enabling efficient deployment of charging stations and grid upgrades. Our model seeks to strike a balance between meeting ET drivers' charging preferences, minimizing the costs associated with infrastructure deployment and grid expansion, and harmonizing the coordination between the TN and PDN. Additionally, we explore the potential benefits of utilizing an autonomous ET fleet to enhance overall system performance.
33 ADVANCED PROPULSION SYSTEMS↗
A novel matching formulation for startup costs in unit commitment
Here we present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.
97 MATHEMATICS AND COMPUTING↗
A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems
We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.
97 MATHEMATICS AND COMPUTING↗
Stochastic Unit Commitment: Model Reduction via Learning
As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.
42 ENGINEERING↗
Enhancing power grid resilience to winter storms via generator winterization with equity considerations
Here we develop two-stage stochastic programming models for generator winterization that enhance power grid resilience while incorporating social equity. The first stage in our models captures the investment decisions for generator winterization, and the second stage captures the operation of a degraded power grid, with the objective of minimizing load shed and social inequity. To incorporate equity into our models, we propose a concept called adverse effect probability that captures the disproportionate effects of power outages on communities with varying vulnerability levels. Grid operations are modeled using DC power flow, and equity is captured through mean or maximum adverse effects experienced by communities. We apply our models to a synthetic Texas power grid, using winter storm scenarios created from the generator outage data from the 2021 Texas winter storm. Our extensive numerical experiments show that more equitable outcomes, in the sense of reducing adverse effects experienced by vulnerable communities during power outages, are achievable with no impact on total load shed through investing in winterization of generators in different locations and capacities.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Computational framework for behind-the-meter DER techno-economic modeling and optimization: REopt Lite
The energy system is undergoing a major transformation with the global emphasis on decarbonization. Distributed generation is projected to play a significant role in the new energy system, and energy models are informing how distributed generation can be integrated reliably and economically. In this work, we present an end-to-end computational framework for distributed energy resource (DER) modeling, REopt Lite™, which captures the interface of technology, economics, and policy in the energy modeling process. We describe the problem space, the building blocks of the model, the scaling capabilities of the design, the optimization formulation, and the extensibility of the model. We present a framework for accelerating the techno-economic analysis of behind-the-meter distributed energy resources to enable rapid planning and decision-making, thereby enabling greater renewable energy deployment. This computation framework is open-sourced to facilitate transparency, flexibility, and wider collaboration opportunities within the worldwide energy modeling community.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
Optimizing Distributed Energy Resources and building retrofits with the strategic DER-CAModel
The pressuring need to reduce the import of fossil fuels as well as the need to dramatically reduce CO 2 emissions in Europe motivated the European Commission (EC) to implement several regulations directed to building owners. Most of these regulations focus on increasing the number of energy efficient buildings, both new and retrofitted, since retrofits play an important role in energy efficiency. Overall, this initiative results from the realization that buildings will have a significant impact in fulfilling the 20/20/20-goals of reducing the greenhouse gas emissions by 20%, increasing energy efficiency by 20%, and increasing the share of renewables to 20%, all by 2020. The Distributed Energy Resources Customer Adoption Model (DER-CAM) is an optimization tool used to support DER investment decisions, typically by minimizing total annual costs or CO 2 emissions while providing energy services to a given building or microgrid site. This document shows enhancements made to DER-CAM to consider building retrofit measures along with DER investment options. Specifically, building shell improvement options have been added to DER-CAM as alternative or complementary options to investments in other DER such as PV, solar thermal, combined heat and power, or energy storage. The extension of the mathematical formulation required by the new features introduced in DER-CAM is presented and the resulting model is demonstrated at an Austrian Campus building by comparing DER-CAM results with and without building shell improvement options. Strategic investment results are presented and compared to the observed investment decision at the test site. Results obtained considering building shell improvement options suggest an optimal weighted average U value of about 0.53 W/(m 2 K) for the test site. This result is approximately 25% higher than what is currently observed in the building, suggesting that the retrofits made in 2002 were not optimal. Furthermore, the results obtained with DER-CAM illustrate the complexity of interactions between DER and passive measure options, showcasing the need for a holistic optimization approach to effectively optimize energy costs and CO 2 emissions. Lastly, the simultaneous optimization of building shell improvements and DER investments enables building owners to take one step further towards nearly zero energy buildings (nZEB) or nearly zero carbon emission buildings (nZCEB), and therefore support the 20/20/20 goals.
25 ENERGY STORAGE↗
A superstructure-based framework for bio-separation network synthesis
Modern biotechnologies enable the production of chemicals using engineered microorganisms. However, the cost of downstream recovery and purification steps is high, which means that the feasibility of bio-based chemicals production depends heavily on the synthesis of cost-effective separation networks. To this end, we develop a superstructure-based framework for bio-separation network synthesis. Based on general separation principles and insights obtained from industrial processes for specific products, we first identify four separation stages: cell treatment, product phase isolation, concentration and purification, and refinement. For each stage, we systematically implement a set of connectivity rules to develop stage-superstructures, all of which are then integrated to generate a general superstructure that accounts for all types of chemicals that can be produced using microorganisms. Here we further develop a superstructure reduction method to solve specific instances, based on product attributes, technology availability, case-specific considerations, and final product stream specifications. A general optimization model, including short-cut models for all technologies, is formulated. The proposed framework enables preliminary synthesis and analysis of bio-separation networks, and thus estimation of separation costs.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
A generalized superstructure-based framework for process synthesis
We propose a general framework for the formulation of superstructure-based optimization models for holistic process synthesis. First, we redefine the fundamental problems of reactor, separation, and heat exchanger network synthesis, by presenting generalized problem statements, to make them amenable to seamless integration with each other. Second, we describe the general forms of models that can be developed to address these generalized problems and identify some key characteristics. Notably, for each system, we identify internal variables used only within the system, cost variables used in the objective function, and, importantly, coupling variables for the coupling between systems. Third, we outline some literature models that can be used to address the generalized problems and present new models to couple the three systems. Finally, we show how the individual components (systems and coupling models) can be integrated to formulate a single simultaneous reactor, separation, and heat exchanger network synthesis.
97 MATHEMATICS AND COMPUTING↗
Integration of graphical approaches into optimization-based design of multistage liquid extraction
We propose two optimization models for designing two liquid extraction systems: simple multistage liquid extractors and extractors with extract reflux. Both models are motivated by the concepts of the modified McCabe-Thiele graphical method for multistage extractor design. The operating and equilibrium curves in the McCabe-Thiele method are represented by material balances and piece-wise linearized thermodynamics properties. The use of piece-wise approximations improves computational tractability of both optimization models. In addition, we consider some extensions such as dilute systems, insoluble solvents, and non-ideal stages. In conclusion, the applicability of the proposed models is demonstrated with four illustrative examples.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗