Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mixed Integer Linear 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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Impact of model predictive control-enabled home energy management on large-scale distribution systems with photovoltaics

Residential customers use more than one-quarter of the electricity in the world. Optimally managing home energy consumption is an effective way of easing the operational challenges facing the electric grid with increasing solar photovoltaics (PV). This paper studies the impact of the future proliferation of home energy management systems (HEMS) in the presence of PV on large-scale distribution systems. First, we present a stochastic HEMS model that minimizes residential customers' thermal discomfort and energy costs under uncertainty. The HEMS model schedules the optimal operations of residential appliances in the presence of PV within a mixed-integer linear programming-based model predictive control framework that links the proposed HEMS to a quasi-steady-state time-series simulation tool. Additionally, extensive simulations are conducted for a stand-alone residential home using two tariff structures and for 1977 homes on an 8,500-node distribution feeder. Simulation results quantify the impact of the future proliferation of HEMS on the large-scale distribution system with PV.

14 SOLAR ENERGY↗
DOE OSTI2024

Measure this, not that: Optimizing the cost and model-based information content of measurements

Model-based design of experiments (MBDoE) is a powerful framework for selecting and calibrating science-based mathematical models from data. Here, this work extends popular MBDoE workflows by proposing a convex mixed integer (non)linear programming (MINLP) to optimize the selection of measurements. The solver MindtPy is modified to support calculating the D-optimality objective and its gradient via an external package, scipy, using the grey-box module in Pyomo. The new approach is demonstrated in two case studies: estimating highly correlated kinetics from a batch reactor and estimating transport parameters in a large-scale rotary packed bed for CO 2 capture. Both case studies show how examining the Pareto optimal trade-offs between information content measured by A- and D-optimality versus measurement budget offers practical guidance for selecting measurements for scientific experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Optimizing mixed cool thermal storage systems across a connected community

A high level of electric demand flexibility must be integrated into our building infrastructure to enable greater renewable energy penetration in the grid. In the U.S., 9% of electricity generated is used to cool buildings in a periodic manner, making this end-use an ideal target for active management through cool thermal energy storage (CTES) technologies. Historic uses for CTES are designed around central chilled water plants, but these systems cool less than 25% of U.S. commercial floorspace. Emerging technologies are under development to serve the many smaller distributed cooling systems, such as rooftop units (RTUs), and have the potential to add CTES to an additional 66% of cooled commercial floorspace. However, these unitary thermal storage systems (UTSS) lack the modeling and analysis tools to evaluate them in the future interactive grid context. Here, this study develops the modeling and optimization tools necessary to simultaneously examine central and distributed ice storage systems within the multi-building, connected community context. An integrated simulation-optimization workflow is created to allow for rapid customized analysis. Results demonstrate the energy and flexibility tradeoffs of various implementations.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

An interregional optimization approach for time series aggregation in continent-scale electricity system models

Modeling electric power systems with high shares of weather-dependent resources requires tradeoffs between temporal, spatial, and operational resolution. Many studies perform time series aggregation using clustering algorithms to reduce the temporal dimension, but when modeling continent-scale electricity systems that are large enough to contain multiple independent weather systems, this approach requires large numbers of representative periods to minimize errors in regional wind and solar capacity factors. Here, a new optimization-based approach for representative period selection and weighting is introduced that minimizes regional errors in average renewable capacity factors and electricity demand. The method delivers higher regional fidelity with fewer representative periods than alternative clustering methods when applied to wind, solar, and demand profiles for the contiguous United States. When representative periods are selected from multiple weather years, the optimized method reproduces regional averages with lower error than a complete 365-day time series from any single weather year. The method identifies only representative (as opposed to outlying) periods but can be combined with an iterative "stress period" identification approach to guide efficient decision-making considering both average and high-risk weather conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Transmission Constraint Filtering in Large-Scale Security-Constrained Unit Commitment

When solving the security-constrained unit commitment problem, one of the most complicating factors is handling the large number of transmission constraints, corresponding to both base case and N - 1 line contingency scenarios. Although it is well known that only a few of these constraints need to be enforced, identifying this critical subset of constraints efficiently remains a challenge. In this letter, we propose a novel and simple iterative contingency-screening procedure that is able to eliminate 99.4% of the constraints selected by existing iterative methods, allowing for the solution of much larger-scale problems. We report computational results in realistic instances with up to 6468 buses and 9000 transmission lines. Furthermore, the method was also independently implemented and evaluated at MISO, where it performed faster than alternative methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

A Flexible Operation of Distributed Generation in Distribution Networks With Dynamic Boundaries

Distributed generators performing black start to form isolated microgrids offer a flexible and resilient solution to service restoration in distribution systems. Employing the dynamic microgrid concept, distributed generators can form isolated microgrids by changing their physical boundaries through smart switches and conventional circuit breakers. However, the flexibility of distributed generators has not been thoroughly investigated and utilised in existing works. To address this issue, this letter presents a new model to the reconfiguration formulation in active distribution networks considering different operation modes of distributed generators. Compared with the existing models, this study provides a new formulation supporting different DGs' operation modes and fully making use of their flexibility. Illustrative results on IEEE 34-test systems verify the effectiveness of the proposed model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

A Fixed-Flexible BESS Allocation Scheme for Transmission Networks Considering Uncertainties

Battery energy storage systems (BESSs) can play a key role in mitigating the intermittency and uncertainty associated with adding large amounts of renewable energy to the bulk power system (BPS). Two BESS technologies that have gained prominence in this regard are Lithium-ion (LI) BESS and Vanadium redox flow (VRF) BESS. Here, this paper proposes a fixed-flexible BESS allocation scheme that exploits the complementary characteristics of LI and VRF BESSs to attain optimal techno-economic benefits in a wind-integrated BPS. Studies carried out on relatively large transmission networks demonstrate that benefits such as reduction in system operation cost, wind spillage, voltage fluctuations, and discounted payback period, can be realized by using the proposed scheme.

42 ENGINEERING↗
DOE OSTI2019

RetSynth: determining all optimal and sub-optimal synthetic pathways that facilitate synthesis of target compounds in chassis organisms

The efficient biological production of industrially and economically important compounds is a challenging problem. Brute-force determination of the optimal pathways to efficient production of a target chemical in a chassis organism is computationally intractable. Many current methods provide a single solution to this problem, but fail to provide all optimal pathways, optional sub-optimal solutions or hybrid biological/non-biological solutions. Here we present RetSynth, software with a novel algorithm for determining all optimal biological pathways given a starting biological chassis and target chemical. By dynamically selecting constraints, the number of potential pathways scales by the number of fully independent pathways and not by the number of overall reactions or size of the metabolic network. This feature allows all optimal pathways to be determined for a large number of chemicals and for a large corpus of potential chassis organisms. Additionally, this software contains other features including the ability to collect data from metabolic repositories, perform flux balance analysis, and to view optimal pathways identified by our algorithm using a built-in visualization module. This software also identifies sub-optimal pathways and allows incorporation of non-biological chemical reactions, which may be performed after metabolic production of precursor molecules. The novel algorithm designed for RetSynth streamlines an arduous and complex process in metabolic engineering. Our stand-alone software allows the identification of candidate optimal and additional sub-optimal pathways, and provides the user with necessary ranking criteria such as target yield to decide which route to select for target production. Furthermore, the ability to incorporate non-biological reactions into the final steps allows determination of pathways to production for targets that cannot be solely produced biologically. With this comprehensive suite of features RetSynth exceeds any open-source software or webservice currently available for identifying optimal pathways for target production.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Methods for Computing Physically Realistic Estimates of Electric Water Heater Demand Response Resource Suitable for Bulk Power System Planning Models

Demand response is commonly called on to reduce load during system peak times or to respond to contingency events. In future power systems with higher shares of wind and solar generation (which we describe together as variable generation [VG]), demand response could have more opportunities to provide energy shifting or operating reserve services. This report evaluates the ability of residential electric water heaters, both electric resistance water heaters (ERWHs) and heat pump water heaters (HPWHs), to provide such services starting from detailed whole-building energy models that realistically represent New England single family home stock. We use a parsimonious surrogate model to represent operational flexibility in a form suitable for linear and mixed integer programming. This enables relatively fast determination of aggregate contingency reserve resource, price-taking energy shifting outcomes, and in some cases the determination of aggregate models at the megawatt (MW) scale that can be directly included in large-scale grid models. After selecting modeling methods and parameters through various computational experiments, we find interquartile ranges of contingency reserve resource in ISO-NE for about 603,400 ERWHs of 45 MW - 69 MW for Claim10 (50 minute responses provided with 10 minutes of advanced notification) and 65 MW - 102 MW for Claim30 (30 minute responses provided with 30 minutes of advanced notification), and for about 619,000 HPWHs of 48 MW - 88 MW for Claim10 and 52 MW - 90 MW for Claim30. The overall reserve resource is up to 32% of total load for ERWHs providing Claim10 service, 47% for ERWHs providing Claim30 service, 93% for HPWHs providing Claim10 service, and 97% for HPWHs providing Claim30 service. More work is required to determine if HPWHs are inherently more suitable than ERWHs for providing contingency reserve or if these results reflect idiosyncrasies of the single family home stock model used in this study. The value of this contingency resource in a Near-term VG model of ISO-NE is $\$ 0.40$ to $\$1.20$ per water heater-year, and significantly larger, $\$ 3.80$ to $\$ 5.30$ per water heater-year in a Mid-term VG model of ISONE. Aggregating surrogate models to the MW-scale for energy shifting service is more challenging than for contingency service and we only present such results for ERWHs, because we were unable to determine satisfactory ways to deal with HPWHs' time-varying and path dependent operational characteristics. Individual surrogate models suitable for evaluating the energy shifting resource from both ERWHs and HPWHs are created, however, and dispatched against day-ahead prices from the Near-Term VG and Mid-Term VG models of ISO-NE. The individual surrogate models are able to access and potentially shift all 640 GWh of HPWH load and 1,547 GWh of ERWH load we modeled in two different single family home stock models. In contrast, the most effective model of aggregate ERWH shifting resource we created only captured 34.7% of the total ERWH load. Energy shifting affected by price-taking dispatch against modeled day-ahead energy prices produces per water heater year profits of $\$19.44$ - $\$22.93$ for individual HPWHs, $\$39.11$ - $\$40.54$ for individual ERWHs, and up to $\$4.00$ - $\$4.24$ for aggregated ERWHs, with the variations mainly due to grid conditions (more or less VG). When the supply-side response to these changes is accounted for, the per water heater year production cost savings for ISO-NE are $\$7.50$ to $\$17.70$ for the most effective set of endogenously dispatched aggregate ERWHs, $\$15.60$ to $\$15.70$ for individual ERWHs dispatched against the DA prices, and $\$10.70$ to $\$11.20$ for individual HPWHs dispatched against DA prices. Those ranges primarily represent the difference between Near-Term VG and Mid-Term VG grid conditions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Optimal Renewable Resource Allocation and Load Scheduling of Resilient Communities

This paper presents a methodology for enhancing community resilience through optimal renewable resource allocation and load scheduling in order to minimize unserved load and thermal discomfort. The proposed control architecture distributes the computational effort and is easier to be scaled up than traditional centralized control. The decentralized control architecture consists of two layers: The community operator layer (COL) allocates the limited amount of renewable energy resource according to the power flexibility of each building. The building agent layer (BAL) addresses the optimal load scheduling problem for each building with the allowable load determined by the COL. Both layers are formulated as a model predictive control (MPC) based optimization. Simulation scenarios are designed to compare different combinations of building weighting methods and objective functions to provide guidance for real-world deployment by community and microgrid operators. The results indicate that the impact of power flexibility is more prominent than the weighting factor to the resource allocation process. Allocation based purely on occupancy status could lead to an increase of PV curtailment. Further, it is necessary for the building agent to have multi-objective optimization to minimize unserved load ratio and maximize comfort simultaneously.

model predictive control↗
NASA NTRS1987

A method for nonlinear optimization with discrete design variables

A numerical method is presented for the solution of nonlinear discrete optimization problems. The applicability of discrete optimization to engineering design is discussed, and several standard structural optimization problems are solved using discrete design variables. The method uses approximation techniques to create subproblems suitable for linear mixed-integer programming methods. The method employs existing software for continuous optimization and integer programming.

Olsen, Gregory R.↗
NASA NTRS1988

A k-permutation algorithm for Fixed Satellite Service orbital allotments

A satellite system synthesis problem, the satellite location problem (SLP), is addressed in this paper. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the Fixed Satellite Service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: (1) the problem of ordering the satellites and (2) the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, that has been developed to find solutions to SLPs formulated in the manner suggested is described. Solutions to small example problems are presented and analyzed.

Reilly, Charles H.↗
NASA NTRS1990

Finding fixed satellite service orbital allotments with a k-permutation algorithm

A satellite system synthesis problem, the satellite location problem (SLP), is addressed. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the fixed satellite service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: the problem of ordering the satellites and the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, has been developed to find solutions to SLPs. Solutions to small sample problems are presented and analyzed on the basis of calculated interferences.

Reilly, Charles H.↗
NASA NTRSDate not supplied

Scheduling Position, Navigation and Time Service Requests from Non-dedicated Lunar Constellations

This paper presents a centralized scheduler that satisfies user requests for Position, Navigation, and Time (PNT) services from an ad-hoc, non-dedicated orbital constellation around the Moon. Traditional, dedicated GNSS networks provide service 24/7, which allows users to acquire localization services at-will. For ad-hoc networks, a coordinated schedule is needed to ensure Quality of Service (QoS) guarantees for user localization, while satisfying non-dedicated assets’ usage constraints. This scheduler bridges this coordination gap by leveraging Mixed Integer-Linear Programming (MILP) to schedule this “as-needed” localization service while respecting the constraints on each asset. In upcoming decades there is expected to be a substantial increase in Lunar missions. Many of these missions will feature low-cost surface assets near the moon’s polar regions and small-sat science missions in orbit. Most missions need PNT capabilities to ensure safe operations and meet their science objectives, but low-cost missions may not be able to support the large power, mass, and weight that a weak GNSS or DSN based navigation solution would entail. Asset localization has been demonstrated using a decentralized extended Kalman Filter (DEKF) in the previously presented Lunar Autonomous PNT System (LAPS). Within the LAPS simulation environment, a module has been developed to generate the coordinated user-asset schedules described above; this Service Scheduler Module (SSM) allows for complete end-to-end testing of the entire system. Within SSM, a user service request consists of a location on the Lunar surface, a cumulative service duration, and a window in which service must occur. SSM takes as input these requests and the LAPS-predicted positional degree of precision as the QoS for each available set of orbital assets. A simple, baseline MILP model is formulated to provide the highest-precision service balanced across all requests. To reflect the non-dedicated nature of the constellation, this baseline model is augmented with additional asset-specific load capacity constraints or availability constraints. The load capacity constraints limit total time spent providing service, and the availability constraints reflect blockout times or availability windows when the assets are not otherwise occupied. SSM outputs two schedules: the user schedule to indicate their service times and expected QoS, and a satellite schedule to be transmitted to the orbiting constellation, describing when each non-dedicated asset provides PNT service. SSM is predominantly implemented in MATLAB and allows the use of any MILP solver to generate the resulting schedules. This paper describes the SSM - LAPS interface, how the output of LAPS is used to construct the MILP, and how SSM provides user localization service while satisfying constraints. It will also demonstrate the tool’s flexibility for formulating schedules for the end user and the constellation, focusing on scenarios that match real-world proposed missions. It will detail how SSM can be used to compare the addition of load capacity constraints, satellite availability constraints, and QoS guarantees for the users. Finally, we describe how SSM can be used to support the design of the ad-hoc constellation itself. The resulting integrated capability will support the design of future ad-hoc Lunar PNT networks, enabling high-quality, low-cost Lunar exploration

Swarm↗