GALINI: An extensible mixed-integer quadratically-constrained optimization solver.
Abstract not provided.
SEARCH · Engineering Papers
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.
Abstract not provided.
In this project, we developed new, tighter Mixed-Integer Programming (MIP) formulations for the combined Alternating Current (AC) Security-Constrained Unit Commitment (SCUC) and Security-Constrained Optimal Power Flow (SCOPF). The work addresses a critical challenge in power system operations: efficiently determining which generation units to commit and how to optimally dispatch them while maintaining network reliability constraints for both normal and contingency scenarios. Our efforts: 1. Advance the Understanding of SCUC/SCOPF Modeling: By introducing tighter MIP formulations and leveraging cutting-edge optimization tools (Julia/JuMP, PowerModels.jl), this project has pushed forward the state of the art in efficient power systems scheduling. 2. Enhance Technical and Economic Feasibility: The methods developed provide more accurate and potentially faster solutions to large-scale, realistic scheduling and dispatch problems in electric power systems, which can translate into improved reliability and potentially lower costs for grid operations. 3. Benefit to the Public: Greater efficiency in power system operations leads to cost savings for utilities and end-users. Improved reliability and integration of advanced modeling approaches can facilitate the adoption of clean energy resources and better accommodate uncertainties in renewable generation. Because this technology could impact bulk power markets and reliability, these innovations have far-reaching public benefits in terms of cost savings, reliability, and sustainability.
We propose to use the heuristic static loadbalancing (HSLB) algorithm for solving load-balancing problems in the Community Earth System Model (CESM), a climate model, using fitted benchmark data as an alternative to the current manual approach. The problem of allocating the optimal number of CPU cores to CESM components is formulated as a mixed-integer nonlinear optimization problem which is solved by using an optimization branch-and-bound solver implemented in the MINLP package MINOTAUR. The key feature of the branch-and- bound method is that it guarantees to provide an optimal solution or show that none exists. Our algorithm was tested for the 1 degrees and 1/8 degrees resolution simulations on 32,768 nodes (131,072 cores) of IBM Blue Gene/P where we consistently achieved well load-balanced results. This work is a part of a broader effort to eliminate the need for manual tuning of the code for each platform and simulation type, improve the performance and scalability of CESM, and develop automated tools to achieve these goals.
Road vehicle lane changes often initiate traffic disturbances and can therefore impact road networks’ energy and time efficiency. Furthermore, unexpected changes in traffic conditions may also render lane changes counterproductive for the lane-changing vehicle. Vehicle-to-vehicle connectivity combined with anticipative control could address these challenges via improved lane change decisions by automated vehicles. In a move toward this objective, receding horizon control cast as a mixed-integer quadratic program is used to plan lane changing and acceleration in a coupled optimization. A long-term pacing module, based on Pontryagin’s minimum principle from optimal control theory, sets terminal and input references for receding horizon control to target a user’s expected travel time. To remove nonlinear vehicle dynamics from the receding horizon controller, lane change commands are passed to a pure pursuit steering module whose response is approximated by a second-order linear model. Here, comparison against a rule-based reactive algorithm in arterial and highway scenarios shows an 8.9%–13.7% reduction in energy consumption and a 5.2%–10.3% reduction in the travel time, along with navigational improvements.
We present SUSPECT, an open source toolkit that symbolically analyzes mixed-integer nonlinear optimization problems formulated using the Python algebraic modeling library Pyomo. We present the data structures and algorithms used to implement SUSPECT. SUSPECT works on a directed acyclic graph representation of the optimization problem to perform: bounds tightening, bound propagation, monotonicity detection, and convexity detection. We show how the tree-walking rules in SUSPECT balance the need for lightweight computation with effective special structure detection. SUSPECT can be used as a standalone tool or as a Python library to be integrated in other tools or solvers. Here, we highlight the easy extensibility of SUSPECT with several recent convexity detection tricks from the literature. We also report experimental results on the MINLPLib 2 dataset.
A total of 81 optimal logic circuits based on four-gate field-effect transistors (G(sup 4)4FETs) have been designed to implement all Boolean functions of up to three variables. The purpose of this development was to lend credence to the expectation that logic circuits based on G(sup 4)FETs could be more efficient (in the sense that they could contain fewer transistors), relative to functionally equivalent logic circuits based on conventional transistors. A G(sup 4)FET a combination of a junction field-effect transistor (JFET) and a metal oxide/semiconductor field-effect transistor (MOSFET) superimposed in a single silicon island and can therefore be regarded as two transistors sharing the same body. A G(sup 4)FET can also be regarded as a single device having four gates: two side junction-based gates, a top MOS gate, and a back gate activated by biasing of a silicon-on-insulator substrate. Each of these gates can be used to control the conduction characteristics of the transistor; this possibility creates new options for designing analog, radio-frequency, mixed-signal, and digital circuitry. One such option is to design a G(sup 4)FET to function as a three-input NOT-majority gate, which has been shown to be a universal and programmable logic gate. Optimal NOT-majority-gate, G(sup 4)FET-based logic-circuit designs were obtained in a comparative study that also included formulation of functionally equivalent logic circuits based on NOR and NAND gates implemented by use of conventional transistors. In the study, the problem of finding the optimal design for each logic function and each transistor type was solved as an integer-programming optimization problem. Considering all 81 non-equivalent Boolean functions included in the study, it was found that in 63% of the cases, fewer logic gates (and, hence, fewer transistors) would be needed in the G(sup 4)FET-based implementations.
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.
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a mixed integer programming formulation to construct optimal decision trees of a prespecified size. We take the special structure of categorical features into account and allow combinatorial decisions (based on subsets of values of features) at each node. Our approach can also handle numerical features via thresholding. Here we show that very good accuracy can be achieved with small trees using moderately-sized training sets. The optimization problems we solve are tractable with modern solvers.
SAND2023-06672O The Protection Settings Optimizer (PSO) uses system and fault data as inputs to formulate the problem of calculating relay settings as a mixed integer, nonlinear optimization problem (MINLP). The MINLP is solved using a genetic algorithm-based optimizer that attempts to find settings to reduce the relay operating times. The PSO protects the power system by using the steady-state fault voltages and currents, which then calculates the optimal device setting to protect the power system. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
Abstract The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing’s performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.
This paper first studies the estimated distributed PV hosting capacities of seventeen utility distribution feeders using the Monte Carlo simulation based stochastic analysis, and then analyzes the sensitivity of PV hosting capacity to both feeder and photovoltaic system characteristics. Furthermore, an active distribution network management approach is proposed to maximize PV hosting capacity by optimally switching capacitors, adjusting voltage regulator taps, managing controllable branch switches and controlling smart PV inverters. The approach is formulated as a mixed-integer nonlinear optimization problem and a genetic algorithm is developed to obtain the solution. Multiple simulation cases are studied and the effectiveness of the proposed approach on increasing PV hosting capacity is demonstrated.
This report presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably Benders decomposition and column-and-constraint generation, compute worst-case parameter realizations by solving mixed-integer bilinear optimization subproblems. However, their numerical solution can be computationally expensive not only due to their resulting large size after reformulating the bilinear terms, but also because decision-independent bounds on their variables are typically unknown. We propose an alternative Lagrangian dual method that circumvents these difficulties and is readily integrated in either algorithm. We specialize the method to problems where the binary parameters switch on or off constraints as these are commonly encountered in applications, and discuss extensions to problems that lack relatively complete recourse and to those with integer recourse. Numerical experiments provide evidence of significant computational improvements over existing methods.
Optimal design applications are often modeled by using categorical variables to express discrete design decisions, such as material types. A disadvantage of using categorical variables is the lack of continuous relaxations, which precludes the use of modern integer programming techniques. We show how to express categorical variables with standard integer modeling techniques, and we illustrate this approach on a load-bearing thermal insulation system. The system consists of a number of insulators of different materials and intercepts that minimize the heat flow from a hot surface to a cold surface. Our new model allows us to employ black-box modeling languages and solvers and illustrates the interplay between integer and nonlinear modeling techniques. We present numerical experience that illustrates the advantage of the standard integer model.
The use of stationary electrochemical energy storage systems utilizing lithium-ion batteries has increased rapidly as the production scale and price for lithium-ion batteries has decreased. These energy storage systems are crucial for maintaining grid resiliency, especially for grids operating with high penetration of renewable energy generation assets or for with a variety of distributed energy generation and storage systems. One challenging factor for the development of battery energy storage systems is estimating the proper sizing, in terms of both power and energy, that minimizes total costs over the lifetime of the systems; this calculation is difficult in simple cases, where a battery is costed independently, but is extremely challenging when building loads and electrical generation by photovoltaic resources are also considered. REopt is a techoeconomic optimization tool developed by NREL to address these challenges. Previously, battery degradation has been priced by simply assuming a 10-year replacement schedule for battery systems. However, this does not account for varying degradation trends observed across real-world batteries, or allow for batteries to be operated in a degradation-aware manner that optimizes battery dispatch based on operating costs. This work incorporates a battery life model into REopt. This battery life model is simple, so that it may be solvable within the constrains of a mixed-integer linear optimization problem, but is fit to accelerated aging data recorded in the lab. To achieve the best possible accuracy for lifetime estimates given these constraints, parameters for the battery life model in REopt are estimated by fitting 20-year simulations of battery life after identifying state-space battery degradation model from accelerated aging data. Comparisons of battery life predicted in REopt and from the state-space battery degradation model to ensure validity of lifetime estimates made by REopt. Battery life and cost is optimized by controlling three decision to minimize system life cost: battery sizing, daily state-of-charge, and daily energy-throughput. The cost of battery degradation as a function of these control variables is then estimated assuming two possible maintenance strategies: replacement, where the entire battery system is replaced if cell reach an end-of-life capacity threshold; and augmentation, which establishes a fund to pay for continual purchase of new batteries to maintain the initial energy capacity of the system. These two strategies offer conservative (for replacement) and optimistic (for augmentation) bounds for total system cost. The degradation cost incurred by these strategies is then used to control battery dispatch decisions, operating the battery in a degradation-aware manner that maximizes battery lifetime while also providing energy when favorable. Because the mixed-integer linear program has perfect foresight of future energy needs, batteries with degradation costs are always operated using 'just-in-time' charging, which is unrealistic, as no energy is left in the storage system to perform other energy services or to serve as emergency back-up power. To combat this, an inequality constraint on the average annual state-of-charge is imposed, and the sensitivity of system cost to average stored energy, e.g., the cost of system resiliency, can be quantified. Analysis of results has several conclusions, for instance, oversizing of battery storage systems is not a cost burden when battery storage is an optimal solution, as any additional battery capacity can simply be utilized to avoid costs of purchasing energy from a utility.
Purpose: The ultimate goal of radiotherapy treatment planning is to find a treatment that will yield a high tumor-control-probability(TCP) with an acceptable normal-tissue-complication probability(NTCP). Yet most treatment planning today is not based upon optimization of TCPs and NTCPs, but rather upon meeting physical dose and volume constraints defined by the planner. We design treatment plans that optimize TCP directly and contrast them with the clinical dose-based plans. PET image is incorporated to evaluate gain in TCP for dose escalation. Methods: We build a nonlinear mixed integer programming optimization model that maximizes TCP directly while satisfying the dose requirements on the targeted organ and healthy tissues. The solution strategy first fits the TCP function with a piecewise-linear approximation, then solves the problem that maximizes the piecewise linear approximation of TCP, and finally performs a local neighborhood search to improve the TCP value. To gauge the feasibility, characteristics, and potential benefit of PET-image guided dose escalation, initial validation consists of fifteen cervical cancer HDR patient cases. These patients have all received prior 45Gy of external radiation dose. For both escalated strategies, we consider 35Gy PTV-dose, and two variations (37Gy-boost to BTV vs 40Gy-boost) to PET-image-pockets. Results: TCP for standard clinical plans range from 59.4% - 63.6%. TCP for dose-based PET-guided escalated-dose-plan ranges from 63.8%–98.6% for all patients; whereas TCP-optimized plans achieves over 91% for all patients. There is marginal difference in TCP among those with 37Gy-boosted vs 40Gy-boosted. There is no increase in rectum and bladder dose among all plans. Conclusion: Optimizing TCP directly results in highly conformed treatment plans. The TCP-optimized plan is individualized based on the biological PET-image of the patients. The TCP-optimization framework is generalizable and has been applied successfully to other external-beam delivery modalities. A clinical trial is on-going to gauge the clinical significance. Partially supported by the National Science Foundation.
A space program that spans several decades will be comprised of a collection of missions such as low earth orbital space station, a polar platform, geosynchronous space station, lunar base, Mars astronaut mission, and Mars base. The optimal selection of a fleet of several recoverable and expendable launch vehicles, upper stages, and interplanetary spacecraft necessary to logistically establish and support these space missions can be examined by means of a linear integer programming optimization model. Such a selection must be made because the economies of scale which comes from producing large quantities of a few standard vehicle types, rather than many, will be needed to provide learning curve effects to reduce the overall cost of space transportation if these future missions are to be affordable. Optimization model inputs come from data and from vehicle designs. Each launch vehicle currently in existence has a launch history, giving rise to statistical estimates of launch reliability. For future, not-yet-developed launch vehicles, theoretical reliabilities corresponding to the maturity of the launch vehicles' technology and the degree of design redundancy must be estimated. Also, each such launch vehicle has a certain historical or estimated development cost, tooling cost, and a variable cost. The cost of a launch used in this paper includes the variable cost plus an amortized portion of the fixed and development costs. The integer linear programming model will have several constraint equations based on assumptions of mission mass requirements, volume requirements, and number of astronauts needed. The model will minimize launch vehicle logistic support cost and will select the most desirable launch vehicle fleet.
An approach is shown for using the Huffman algorithm indirectly to prove the optimality of a code for an infinite alphabet if an estimate concerning the nature of the code can be made. Attention is given to nonnegative integers with a geometric probability assignment. The particular distribution considered arises in run-length coding and in encoding protocol information in data networks. Questions of redundancy of the optimal code are also investigated.
Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.