Search NASA⌕ Search

SEARCH · Search NASA

Results for “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.

At least 253 records · Page 14

Fuzzy Energy and Reserve Co-optimization With High Penetration of Renewable Energy

In this study, we propose a fuzzy-based energy and reserve co-optimization model with consideration of high penetration of renewable energy. Under the assumption of a fixed uncertainty set of renewables, a two-stage robust model is proposed for clearing energy and reserves in the first stage and checking the feasibility and robustness of re-dispatches in the second stage. Fuzzy sets and their membership functions are introduced into the optimization model to represent the satisfaction degree of the variable uncertainty sets. The lower bound of the uncertainty set is expressed as fuzzy membership functions. The solutions are obtained by transforming the fuzzy mathematical programming formulation into traditional mixed integer linear programming problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Modeling Electric Vehicle Benefits Connected to Smart Grids

Connecting electric storage technologies to smartgrids will have substantial implications in building energy systems. Local storage will enable demand response. Mobile storage devices in electric vehicles (EVs) are in direct competition with conventional stationary sources at the building. EVs will change the financial as well as environmental attractiveness of on-site generation (e.g. PV, or fuel cells). In order to examine the impact of EVs on building energy costs and CO2 emissions in 2020, a distributed-energy-resources adoption problem is formulated as a mixed-integer linear program with minimization of annual building energy costs or CO2 emissions. The mixed-integer linear program is applied to a set of 139 different commercial buildings in California and example results as well as the aggregated economic and environmental benefits are reported. The research shows that considering second life of EV batteries might be very beneficial for commercial buildings.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations. Most NTO problems are formulated based on the bus-branch model in which it is challenging to represent a realistic picture of all substation configurations. In this paper, we explore advantages of substation reconfiguration modeling based on node-breaker representations for NTO problem with full nonlinear alternating current power flow. It also proposes a tailored solution algorithm to solve this nonconvex mixed-integer nonlinear programming through the outer approximation method. The proposed solution approach iterates between a mixed-integer linear programming and a nonlinear subproblem. Additional enhancements to further accelerate the iteration process are illustrated. Numerical case studies demonstrate the relative economic and operational impact of optimal network topology with node-breaker representations.

42 ENGINEERING↗

An MINLP formulation for the optimization of multicomponent distillation configurations

Designing configurations for multicomponent distillation, a ubiquitous process in chemical and petrochemical industries, is often challenging. This is because, as the number of components increases, the number of admissible distillation configurations grows rapidly and these configurations vary substantially in their energy needs. Consequently, if a method could identify a few energy-efficient choices from this large set of alternatives, it would be extremely attractive to process designers. This paper develops here such a method by solving a Mixed Integer Nonlinear Program (MINLP) that is formulated to pick, among the regular-column configurations of Shah and Agrawal (2010b), those configurations that have a low vapor-duty requirement. To compute the minimum vapor-duty requirement for each column within the configuration, we use techniques that rely on the Underwood’s method. The combined difficulty arising from the nonlinearity of Underwood equations and the combinatorial explosion of the choice-set of alternatives poses unmistakable challenges for the branch-and-bound algorithm, the current method of choice to globally solve MINLPs. To address this difficulty, we exploit the structure of Underwood equations and derive valid cuts that expedite the convergence of branch-and-bound by enabling global solvers, such as BARON, infer tighter bounds on Underwood roots. This provides a quick way to identify a few lucrative alternative configurations for separation of a given non-azeotropic mixture. We illustrate the practicality of our approach on a case-study concerning heavy-crude distillation and on various other examples from the literature.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dispatch optimization of electric thermal energy storage within System Advisor Model

A stand-alone electric thermal energy storage (ETES) system converts low-value electricity into heat using resistance heating elements. During periods of high-value electricity, an ETES system uses a thermodynamic power cycle to convert stored thermal energy back to electricity. These dispatchable systems derive value from their ability to store energy when prices are low and generate electricity when prices are favorable, i.e., energy arbitrage. Consequently, dispatch optimization of system operations, through maximizing revenue subject to system constraints, is essential to evaluate the economic value of a particular system design. While stand-alone ETES systems offer potential advantages as dispatchable grid storage technologies, there is a lack of a neutral third-party, publicly available, open-source model to evaluate the performance, dispatch, and financial viability of these systems. To address this problem, we have developed a techno-economic model for stand-alone ETES systems, within National Renewable Energy Laboratory's (NREL's) System Advisor Model (SAM). We implement a mixed-integer linear program to determine an ETES optimal operating schedule that maximizes electricity sales less maintenance costs caused by operation and cycling given temporal-varying grid electricity prices. Our contributions include a mixed-integer linear program for energy arbitrage of an ETES system, an ETES performance model through a publicly-available software (i.e., SAM), and an exercise of our model through case studies that compare ETES operational strategies and annual financial metrics. With our dispatch optimization model, we were able to improve revenue by 20% compared to a myopic heuristic while reducing the operational cost of the ETES system through decreases in cycle starts, cycles per day, and heater starts.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The allocation of a variable series reactor considering AC constraints and contingencies

The Variable Series Reactors (VSRs) can efficiently control the power flow through the adjustment of the line reactance. When they are appropriately allocated in the power network, the transmission congestion and generation cost can be reduced. Our work proposes a planning model to optimally allocate VSRs considering AC constraints and multi-scenarios including base case and contingencies. The planning model is originally a non-convex large scale mixed integer nonlinear program (MINLP), which is generally intractable. The proposed Benders approach decomposes the MINLP model into a mixed integer linear program (MILP) master problem and a number of nonlinear subproblems. Numerical case studies based on IEEE 118-bus demonstrate the high performance of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ADP-Based Home Energy Management System: A Case Study Using Dynamo: Preprint

This paper explores Home Energy Management System (HEMS) algorithms to minimize household cost while maintaining comfort when faced with uncertain weather, and demand. Specifically, we consider a HEMS that optimizes forward looking schedules for a home's heating, ventilation, and air conditioning (HVAC); water heater (WH); and electric vehicle (EV) charging while considering uncertainty in outside temperature, hot water usage, and non-controllable load (NCL). We adopt a Dynamic Programming (DP) formulation and utilize the Dynamic programming for Adaptive Modeling and Optimization (DYNAMO) toolkit to implement DP and approximate dynamic programming (ADP) algorithms. Simulation results under a single tariff plan compare the quality of the solution generated by ADP to that of DP, and show significant improvement in computation time while maintaining acceptable solution accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Microgrid Optimal Scheduling With Chance-Constrained Islanding Capability

To facilitate the integration of variable renewable generation and improve the resilience of electricity sup-ply in a microgrid, this paper proposes an optimal scheduling strategy for microgrid operation considering constraints of islanding capability. A new concept, probability of successful islanding (PSI), indicating the probability that a microgrid maintains enough spinning reserve (both up and down) to meet local demand and accommodate local renewable generation after instantaneously islanding from the main grid, is developed. The PSI is formulated as mixed-integer linear program using multi-interval approximation taking into account the probability distributions of forecast errors of wind, PV and load. With the goal of minimizing the total operating cost while preserving user specified PSI, a chance-constrained optimization problem is formulated for the optimal scheduling of mirogrids and solved by mixed integer linear programming (MILP). Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator and a battery demonstrate the effectiveness of the proposed scheduling strategy. Lastly, we verify the relationship between PSI and various factors.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs

We develop an adaptive, multivariate partitioning algorithm for solving nonconvex, Mixed-Integer Nonlinear Programs (MINLPs) with polynomial functions to global optimality. In particular, we present an iterative algorithm that exploits piecewise, convex relaxation approaches via disjunctive formulations to solve MINLPs that is different than conventional spatial branch-and-bound approaches. The algorithm partitions the domains of variables in an adaptive and non-uniform manner at every iteration to focus on productive areas of the search space. Furthermore, domain reduction techniques based on sequential, optimization-based bound-tightening and piecewise relaxation techniques, as a part of a presolve step, are integrated into the main algorithm. Finally, we demonstrate the effectiveness of the algorithm on well-known benchmark problems (including Pooling and Blending instances) from MINLPLib and compare our algorithm with state-of-the-art global optimization solvers. With our novel approach, we solve several large-scale instances, some of which are not solvable by state-of-the-art solvers. We also succeed in reducing the best known optimality gap for a hard, generalized pooling problem instance.

97 MATHEMATICS AND COMPUTING↗

Joint Topology Identification and State Estimation in Unobservable Distribution Grids

Many distribution system operations (e.g., state estimation, control, fault detection/localization) rely on the assumption that the underlying topology is accurately defined. In general, topology identification is a challenging problem in distribution systems as these systems are unobservable with a very limited number of available measurements. In this paper, we tackle this problem by designing a compressive sensing framework that jointly estimates the systems states and network topology via an integrated mixed integer nonlinear program (MINLP) formulation. Here, two reformulations of the original MINLP problems are investigated. Firstly, in order to remove the nonlinearity in the MINLP formulation, a mixed integer linear programming (MILP) problem that employs auxiliary variables is derived. Furthermore, to achieve a faster solution, convex relaxation of the original formulation is derived. Finally, using a Markovian model for topology changes, prior information about system topology is used to improve topology identification particularly when a limited amount of measurements is available. Simulation results on IEEE 37-bus test feeder and IEEE 123-bus test feeder illustrate the efficiency and scalability of the proposed approaches from both state estimation and topology identification point of view (even with 30% of available data).

42 ENGINEERING↗

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗

Planning Amidst Uncertainty: Identifying Core CCS Infrastructure Robust to Storage Uncertainty

Carbon Capture and Storage (CCS) is a critical technology for reducing anthropogenic CO2 emissions, but its large-scale deployment is complicated by uncertainties in geological storage performance. These uncertainties pose significant financial and operational risks, as underperforming storage sites can lead to costly infrastructure modifications, inefficient pipeline routing, and economic shortfalls. To address this challenge, we propose a novel optimization workflow that is based on mixed-integer linear programming and explicitly integrates probabilistic modeling of storage uncertainty into CCS infrastructure design. This workflow generates multiple infrastructure scenarios by sampling storage capacity distributions, optimally solving each scenario using a mixed-integer linear programming model, and aggregating results into a heatmap to identify core infrastructure components that have a low likelihood of underperforming. A risk index parameter is introduced to balance trade-offs between cost, CO2 processing capacity, and risk of underperformance, allowing stakeholders to quantify and mitigate uncertainty in CCS planning. Applying this workflow to a CCS dataset from the US Department of Energy’s Carbon Utilization and Storage Partnership project reveals key insights into infrastructure resilience. Reducing the risk index from 15% to 0% is observed to lead to an 83.7% reduction in CO2 processing capacity and a 77.1% decrease in project profit, quantifying the trade-off between risk tolerance and project performance. Furthermore, our results highlight critical breakpoints, where small adjustments in the risk index produce disproportionate shifts in infrastructure performance, providing actionable guidance for decision-makers. Unlike prior approaches that aimed to cheaply repair underperforming infrastructure, our workflow constructs robust CCS networks from the ground up, ensuring cost-effective infrastructure under storage uncertainty. These findings demonstrate the practical relevance of incorporating uncertainty-aware optimization into CCS planning, equipping decision-makers with a tool to make informed project planning decisions.

Olson, Daniel↗

The nth-plant scenario for blended feedstock conversion and preprocessing nationwide: biorefineries and depots

The sustainability of the biofuel industry depends on the development of a mature conversion technology on a national level that can take advantage of the economies of scale: the nth-plant. Defining the future location and supply logistics of conversion plants is imperative to ultimately transform the nation’s renewable biomass resources into cost-competitive, high-performance feedstock for production of biofuels and bioproducts. Since the US has put restrictions on production levels of conventional biofuels from edible resources, the nation needs to plan for the widespread accessibility and development of the cellulosic biofuel scenario. Conventional feedstock supply systems will be unable to handle cellulosic biomass nationwide, making it essential to expand the industry with an advanced feedstock supply system incorporating a distributed network of preprocessing depots and conversion plants, or biorefineries. Current studies are mostly limited to designing supply systems for specific regions of the country. We developed a national database with potential locations for depots and biorefineries to meet the nation’s target demand of cellulosic biofuel. Blended feedstock with switchgrass and corn stover (harvested by either a two- or three-pass method) are considered in a Mixed Integer Linear Programming model to deliver on-spec biomass that considers both, a desired quantity and quality at the biorefinery. A total delivered feedstock cost that is less than $79.07/dt (2016$) is evaluated for years 2022, 2030, and 2040. In 2022, 124 depots and 59 biorefineries could be supplied with 42.8 million dt of corn stover and switchgrass. In 2030 and 2040, the total accessible biomass could increase to 215% and 393% respectively when compared to 2022. However, an $8/dry tons reduction in targeted delivery cost could reduce total accessible biomass by 67%. Kansas, Nebraska, South Dakota and Texas were identified as potential states with a strong biofuel economy given that they had six or more biorefineries located in all scenarios. In some scenarios, Colorado, Alabama, Georgia, Minnesota, Mississippi and South Carolina would greatly benefit from a depot network as these could only deliver to a biorefinery in a nearby state. To elaborate the impact of a nationwide consideration, the findings were compared with existing literature for different US regions. We also present results for biorefinery capacities that are double, triple, and quadruple in size.

09 BIOMASS FUELS↗

A centralized-based method to determine the local voltage control strategies of distributed generator operation in active distribution networks

The increasing penetration of distributed generators (DGs) exacerbates the risk of voltage violations in active distribution networks (ADNs). The var capacity provided by DG inverters is a potential solution for voltage regulation. The conventional centralized control strategies limited by computation and communication burdens are difficult to meet the requirement of rapid voltage control. However, the local control strategies based on real-time measurements have a fast response to the frequent fluctuations of DG outputs. The performance of these local controllers depends on the tuning of the control parameters. This paper proposes a centralized-based method to determine the local voltage control strategies for DGs. A centralized parameter tuning model of control curves is built, in which and curves of DG inverters are mathematically formulated based on piecewise linearization. The original mixed-integer nonlinear programming (MINLP) model is converted into an effectively solved mixed-integer second-order cone programming (MISOCP) model using convex relaxation. The potential benefits of DG inverters are explored to regulate both reactive and curtailed active power, based on local voltage measurements. Case studies on a modified PG&E 69-node distribution system are carried out to verify the effectiveness of the proposed method. Results show that power losses of ADNs are significantly reduced and voltage profiles are also improved.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Bi-Level Adaptive Storage Expansion Strategy for Microgrids Using Deep Reinforcement Learning

Battery energy storage (BES) is a versatile resource for the secure and economic operation of microgrids (MGs). Prevailing stochastic optimization-based approaches for BES expansion planning for MGs are computationally complicated. This work proposes a data-driven bi-level multi-period BES expansion planning framework to determine the siting, sizing, and timing of BES installations. The proposed planning framework unifies deep reinforcement learning (DRL) and linear programming, thereby decoupling the determinations for the integer and continuous decision variables in two time scales, respectively. In the upper level, a rainbow DRL agent with quantile regression is trained to provide dynamic planning policies to accommodate stochastic renewable energy resources (RESs), load, and battery price changes efficiently. Further, the lower level computes the optimal operation of MGs with frequency constraints to hedge the islanding contingency. The two levels communicate with one another by exchanging storage configuration and operating expenses in order to accomplish the shared goal of minimizing investment and operation costs. Comparative case studies on an MG are carried out to demonstrate the superiority of the proposed DRL-based solution to the mixed-integer linear programming counterpart on efficiency, scalability, and adaptability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Solar Field Layout and Aimpoint Strategy Optimization

The existing methods that determine heliostat aiming strategies for concentrating solar power (CSP) central receiver plants typically use heuristics and/or are computationally expensive, and they lack flexibility for different desired flux profiles and receiver geometries. Because of the interaction between layout and aimpoint strategy, considering the former without accounting for the latter may yield solutions with superfluous heliostats that cannot be used efficiently without compromising receiver flux constraints. To that end, we develop a software decision tool that uses innovative optimization methods to both optimize aimpoint strategies and improve candidate layouts for the solar collection field of a CSP central receiver plant. A CSP plant’s effectiveness relies on the optical efficiency of the solar field, which may be limited by losses due to (i) the cosine effect, (ii) atmospheric attenuation, (iii) interference (i.e., shading and blocking) between heliostats, (iv) spillage as a result of heliostat positioning and geometry, and (iv) some heliostats’ inability to direct irradiance to the receiver without damage due to excessive thermal flux. The goal of this work is to obtain optimized aiming strategies and improved solar field layouts that reduce capital cost and increase field optical efficiency and utilization, while meeting the power requirements of a given CSP receiver design. We formulate the aimpoint optimization problem as a mixed-integer linear programming model, which we then decompose into submodels that we solve in parallel. The decomposition subdivides the solar field into sections, and aimpoint strategies for each section are obtained independently of the others. To improve existing layouts, we develop a utilization-weighted efficiency metric that we use to relocate heliostats to sections of the solar field with similar efficiency and higher utilization. Finally, to connect our software to high-fidelity flux models, we develop a Python application programming interface for SolarPILOT, a mature software package that characterizes solar field performance and generates the heliostat layouts and flux maps that serve as input to our models.

14 SOLAR ENERGY↗

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer

Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a minimum-energy state of the quantum system. While many NP-hard problems can be easily formulated as binary quadratic optimization problems, such formulations almost always contain one or more constraints, which are not allowed in a QUBO. Embedding such constraints as quadratic penalties is the standard approach for addressing this issue, but it has drawbacks such as the introduction of large coefficients and using too many additional qubits. In this paper, we propose an alternative approach for implementing constraints based on a combinatorial design and solving mixed-integer linear programming (MILP) problems in order to find better embeddings of constraints of the type Σ x i = k for binary variables x i . Our approach is scalable to any number of variables and uses a linear number of ancillary variables for a fixed k.

97 MATHEMATICS AND COMPUTING↗