Search NASA⌕ Search

SEARCH · Search NASA

Results for “mixed-integer”

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 37 records · Page 2

A multi-objective optimization model for cropland design considering profit, biodiversity, and ecosystem services

More sustainable agricultural methods are needed to alleviate the decreases in biodiversity and ecosystem services that have occurred because of industrial agriculture. One such method is the inclusion of alternative crops into croplands that can support biodiversity, reduce erosion and chemical runoff, and sequester carbon in the soil. However, the question of where such crops should be planted to balance competing economic and environmental objectives remains open. To this end, we develop a mixed-integer quadratically constrained program to optimize the layout of a cropland considering economic, biodiversity, greenhouse gas emissions, and water quality objectives. We include spatially varying fertilization as a decision variable in addition to crop establishment location. We further include the effect of core area and edges between different crops on biodiversity. To demonstrate the applicability of the model, we apply it to an example field, showing how the optimal cropland design changes as a decision-maker prioritizes different objectives and as edges have different impacts on biodiversity.

54 ENVIRONMENTAL SCIENCES↗

Joint scheduling of energy, fast and primary frequency response reserves in integrated transmission–distribution networks

Inverter-based distributed energy resources (DERs) connected to distribution networks (DNs) can provide fast frequency support, but their reserve deliverability depends on feeder constraints and differs from synchronous primary frequency response (PFR). Existing transmission–distribution coordination studies usually treat reserve generically or neglect feeder-level feasibility, while frequency-security scheduling studies rarely represent distribution feeders explicitly. This paper develops a bi-level day-ahead scheduling framework for integrated transmission–distribution networks that jointly clears energy, transmission-side PFR, and distribution-side fast frequency response (FFR) under exogenous hourly inertia and largest-loss inputs from an external unit commitment (UC) schedule. The transmission problem is modeled with DC-optimal power flow (OPF) and closed-form second-order cone (SOC) frequency-security constraints, whereas each DN is represented by a reserve-aware branch-flow AC-OPF so that scheduled fast reserves remain deliverable during activation. The bi-level problem is reformulated through Karush–Kuhn–Tucker (KKT) conditions into a mixed-integer SOC program, and a penalty term is used to tighten the distribution-network relaxation. In the reduced test system, lower exogenous inertia increased the required primary response from 179.64 MW to 191.08 MW, distribution-side fast response reduced total frequency-response procurement by up to 4.9%, and neglecting distribution constraints overstated the combined distribution-side energy and reserve award by up to 18%. In the expanded study, the largest case was solved in 2.02 s with a 0.00% optimality gap. Time-domain simulations kept the frequency nadir above 59.0 Hz in all tested hours. These results demonstrate the value of fast-response modeling and distribution-feasible reserve delivery in coordinated market clearing.

Noh, Seung-Gil↗

Techno-economic analysis and network design for CO 2 conversion to jet fuels in the United States

The conversion of carbon dioxide (CO 2 ) into jet fuel holds significant potential for reducing CO 2 emissions, providing an alternative to carbon-based resources, and offering a renewable means of energy storage. The objective of this study is to conduct a techno-economic analysis and optimize the supply chain network for converting CO 2 to jet fuel in the United States, aiming to minimize total costs while assessing the environmental and economic feasibility of two CO 2 conversion pathways. This first pathway is based on Fischer-Tropsch synthesis (FTS), and the other one is based on the valorization and upgrading of light methanol (MeOH). Incorporating spatial and techno-economic data, a mixed-integer linear programming model was developed to select source plants and conversion pathways, locations of conversion refinery sites, and the amount of captured CO 2 across the United States. The optimal results indicate that the FTS pathway is adopted at all selected refineries when the hydrogen price is 1000 dollars/t and the operating cost, mainly electricity used in conversion, is reduced to 5 % of its current level. Under this scenario, the total annual profit is 8 billion dollars, and the net carbon emissions are -88,783,284 tons. The sensitivity analyses reveal that the prices of electricity and hydrogen significantly contribute to total production costs. The CO 2 recycle percentage of the FTS pathway influences the choice of applied pathways at refineries. Additionally, a higher conversion rate holds a substantial promise for reducing the total production cost and can make the MeOH pathway a viable choice.

10 SYNTHETIC FUELS↗

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal Economic Dispatch and Load-Following Strategies for Nuclear Integrated Energy Systems

The need for distributed and adaptable energy resources that can handle the growing unpredictability in both supply and demand is rising as the power system continues to modernize. In order to satisfy those needs and maintain grid resilience, nuclear power plants can dynamically control their output, despite typically being used as baseload generators. By incorporating energy storage and renewable energy sources, nuclear integrated energy systems are designed to satisfy the electrical and thermal demands of different end-user applications while ensuring flexible power operation. These systems generate revenue by participating in both wholesale and ancillary services electricity markets, as well as commodity markets for various byproducts generated from coupled industrial processes. This study addresses the economic dispatch efficiency of a tightly coupled nuclear integrated energy system comprising a gigawatt-scale light water reactor, commercialized in the U.S., a high-temperature steam electrolysis unit, a district heating network, and specified electrical loads. To demonstrate the nuclear power plant’s flexibility within the day-ahead unit commitment and economic dispatch framework, while maintaining equilibrium even during periods of refueling outages, this paper develops a mixed-integer linear programming framework that models the subsystems and components of its nuclear steam supply system. A systematic comparative analysis of flexible versus baseload nuclear power plant operation under varying levels of renewable energy integration indicates that flexible operation enhances system profitability by more than 18% while also increasing energy storage utilization, improving reactor responsiveness to load fluctuations, and allowing for greater participation across numerous electricity markets.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Strategic Placement and Sizing of Distributed Generation for Resilience Enhancement of Distribution Grids With Microgrid Formation

The rise in frequency and severity of extreme weather events highlights the need for resilient power distribution networks. Microgrids can help improve the resilience of distribution grids by providing continuous power supply using local distribution generation (DG) when the distribution grid fails. In this paper, we propose an approach for optimal placement and sizing of DG to form multiple microgrids throughout the distribution network by restoration actions such as switching operations in case of distribution grid outages caused by extreme weather events. Considering the randomness of damaged distribution lines, the DG placement and sizing problem is formulated as a two-stage stochastic mixed-integer program, with the first stage determining the placement and size of DG, and the second stage focusing on minimizing the amount of load shedding through network restoration and microgrid formations for each scenario. Due to the large number of scenarios, the sample average approximation (SAA) method is employed to solve the problem. The results of case studies on a modified IEEE 33 bus distribution grid demonstrate the effectiveness of the proposed DG placement and sizing strategy in improving the resilience of distribution grids by allowing the formation of multiple microgrids. In addition, the robustness and accuracy of the SAA method are validated through various case studies.

Distributed generation planning↗

Endogenous Interface Pricing for Consistent Transmission–Distribution Co-Optimization With Discrete Distribution Controls

This paper proposes an endogenous interface pricing model for day-ahead transmission–distribution co-optimization that co-determines the interface locational marginal price (LMP) and the transmission–distribution exchange, ensuring price–dispatch consistency while optimally scheduling discrete distribution controls. The formulation couples a DC optimal power flow (OPF) with a branch-flow AC OPF that schedules distributed energy resources (DERs), tap-changer settings, capacitor banks (CBs), and multi-period energy storage systems (ESSs) under feeder voltage and current limits, and is solved as a mixed-integer second-order cone program (MISOCP). In a T14–D33 system, coordinated device scheduling recovers about 90% of the distribution-to-transmission export achievable in a reference case that ignores distribution network (DN) limits, while satisfying a 1.05 p.u. voltage upper bound. In a T39–D34/D37/D123 system, a sequential decoupled benchmark produces interface LMP distortions up to 12.5% and a 7.28% mismatch in net export energy, whereas the proposed model removes these distortions and the associated settlement mismatches. Second-order cone (SOC) relaxation gaps remain below $10^{-3}$ in all cases.

Noh, Seung-Gil↗

Improving Resiliency in Planning MW-Scale Medium and Heavy Duty EV Charging Stations Considering TSCOTS Optimization

Electrification of heavy-duty (HD) vehicles marks an important milestone and technical challenge in the electric vehicle (EV) industry and the public grid. However, implementing EV charging at this scale will necessitate that traditional truck stops be updated with EV charging infrastructure that could represent 10's of MW in electricity consumption. Furthermore, as the transportation sector is represented as critical infrastructure, supporting resiliency considerations in EV charging infrastructure will be critical. This paper proposes an optimization-based approach for optimally designing a MW-scale microgrid charging network. This approach transforms conventional designed truck stops into a reliable HDEV charging stations capable of overnight slow charging and 30-minute to 1 hour fast charging. Using a mixed-integer linear program formulation blending capacity planning and reliability constraints, an optimal network configuration can be solved for a proposed EV charging station that includes photovoltaic and battery energy storage capabilities.

Ponce, Moises [University of Tennessee, Knoxville ↗

Paired Hydro-Battery Hybrid System Operations Using MIQP Based Multi-Objective Optimization

Hybridizing a hydropower plant with a battery energy storage system is often a very expensive decision. So to make the case for feasibility of hybridization the cost benefit analysis must be comprehensive. Most literature found on this subject only uses one out of many different available value streams to carry out a feasibility analysis. To that end, in this study we propose a multi-objective optimization formulation and a mixed-integer quadratic programming optimization engine that considers multiple different value streams and optimizes hydro-battery hybrid system paired operations to maximize revenue generated from energy arbitrage while simultaneously minimizing the total hydro turbine mileage thus reducing turbine starts and stops and improving turbines life all while following all environmental constraints and not violating any limitations either regulatory or preferential (i.e., to support recreational activities like white water rafting, etc.). In this study we also implemented the developed optimization methodology to a real-world case study of Bagnell dam hydropower facility (8 units totaling 240 MW rated power capacity) which is owned and operated by our industry partner Ameren Energy Inc. The case study outcomes shows that by hybridizing the Bagnell dam hydropower facility with a 60 MW x 2-hr battery energy storage system, the annual benefits can be increased over \$6 million while reducing the annual mileage averaged per turbine and number of start/stops by over 98\% and 85\% respectively.

Chalishazar, Vishvas H.↗

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

Physics-Informed Graph Neural Networks for Collaborative Dynamic Reconfiguration and Voltage Regulation in Unbalanced Distribution Systems

Network reconfiguration has long been employed as a strategic approach to minimize power distribution system losses and effectively regulate voltage levels. Tap-changing voltage regulators are also critical for controlling bus voltages, especially in accommodating the increasing integration of distributed energy resources (DERs) with intermittent outputs. This paper introduces novel methodologies to address the challenges of dynamic reconfiguration and optimal tap setting in unbalanced three-phase distribution systems. We propose an approximated mixed-integer quadratically constrained program (MIQCP) to model dynamic reconfiguration, along with a pioneering formulation for voltage regulator (VR) tap-setting based on Special Ordered Set type 1 (SOS1). To mitigate computational complexity, we propose a physics-informed spatial-temporal graph convolutional network (STGCN) with an integrated link classifier. The proposed approach enables efficient solution generation by fixing specific variables in the MIQCP instance and solving the simplified sub-MIP using an MIP solver. Numerical studies demonstrate the superior prediction accuracy of our STGCN model compared to baseline neural network models, resulting in reduced DER curtailment and voltage deviation with shorter computation time.

dynamic reconfiguration↗

Distributionally Robust Bilevel Optimization Model for Distribution Network With Demand Response Under Uncertain Renewables Using Wasserstein Metrics

Here, we consider a distribution network integrating demand response (DR) participants in the presence of uncertain renewable suppliers and outdoor temperatures. A bilevel optimization model is proposed to capture the intricate dynamics between price-incentivized DR participants and distribution system operations, including energy procurement and active/reactive power flows. The model is formulated as a distributional robust bilevel optimization using Wasserstein metrics. We show favorable data-driven properties including out-of-sample guarantee and asymptotic consistency. Furthermore, we present a tractable mixed-integer linear programming reformulation and characterize the worst-case distribution. Computational experiments are conducted on a modified 33-bus system. Our findings underscore the efficacy of the pricing strategies derived from the proposed bilevel optimization model. These strategies not only effectively manage DR participants' behavior but also bring equity considerations among households with various characteristics to light. The results contribute to a deeper understanding of the interplay between distribution system operators and DR participants.

24 POWER TRANSMISSION AND DISTRIBUTION↗

PDPTW-DB: MILP-Based Offline Route Planning for PDPTW with Driver Breaks

The Pickup and Delivery Problem with Time Windows (PDPTW) involves optimizing routes for vehicles to meet pickup and delivery requests within specific time constraints, a challenge commonly faced in logistics and transportation. Microtransit, a flexible and demand-responsive service using smaller vehicles within defined zones, can be effectively modeled as a PDPTW. Yet, the need for driver breaks—a key human constraint—is frequently overlooked in PDPTW solutions, despite being necessary for regulatory compliance. This study presents a novel mixed-integer linear programming formulation for the Pickup and Delivery Problem with Time Windows and Driver Breaks (PDPTW-DB). To the best of our knowledge this formulation is the first to consider mandatory periodic driver breaks within optimized Microtransit routes. The proposed model incorporates regulatory compliant break scheduling directly within the vehicle routing optimization framework. By considering driver break requirements as an integral component of the optimization process, rather than as a post-processing step, the model enables the generation of routes that respect hours of service regulations while minimizing operational costs. This integrated approach facilitates the generation of schedules that are operationally efficient and prioritize driver welfare through driver breaks. We work with a public transit agency from the southern USA, and highlight the specific nuances of driver break optimization, and present a Pickup and Delivery Problem with Time Windows formulation for optimizing Microtransit operations and scheduling driver breaks. We validate our approach using real-world data from the transit agency. Our results validate our formulation in producing cost-effective, and regulation-compliant solutions.

Applied Computing, Transportation↗

New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms

While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.

97 MATHEMATICS AND COMPUTING↗

IM3 Projected U.S. Western Interconnection Grid Stress Dataset

This dataset provides projected grid stress and reliability results (including all model inputs and outputs from GO WEST and TEP) for Integrated Multisector, Multiscale Modeling (IM3) Phase 2 simulations across eight different scenarios for the U.S. Western Interconnection through 2055. The scenarios include combinations of two Shared Socioeconomic Pathways (SSP3 and SSP5) with four high-resolution climate projections specific to the United States from a set of Thermodynamic Global Warming (TGW) simulations. These climate projections include "hotter" and "cooler" variants for two Representative Concentration Pathways (RCP4.5 and RCP8.5). The resulting eight simulations are: rcp45cooler_ssp3 rcp45cooler_ssp5 rcp45hotter_ssp3 rcp45hotter_ssp5 rcp85cooler_ssp3 rcp85cooler_ssp5 rcp85hotter_ssp3 rcp85hotter_ssp5 GO WEST is an open-source power grid modeling framework for the U.S. Western Interconnection, which allows users to tailor the model depending on their research study and science questions. It covers 28 balancing authorities (BAs) and 12 states in U.S. Western Interconnection. GO WEST allows users to select different number of nodes and come up with a simplified network by utilizing 10,000 nodal topology of the U.S. Western Interconnection (ACTIVSg10k). Users can select different number of nodes, mathematical formulations (linear programming vs. mixed-integer linear programming), transmission line limit scaling factors, and hurdle rate scaling factors. GO WEST offers a unit commitment and economic dispatch (UC/ED) module to simulate grid operations on an hourly scale. In this sense, users can calibrate and validate their model versions by comparing model outputs to historical datasets. TEP is an open-source transmission capacity expansion model, built on the GO WEST framework. It utilizes linear programming to optimize transmission capacity addition investment on existing lines within the GO WEST framework. The TEP model only increases the thermal capacity of existing transmission lines and does not add new lines to the system, which leaves the topology preserved. In order to use TEP model, users need to create scenarios with the GO WEST framework. Please refer to README file for a detailed description of the dataset including individual files and references.

Capacity Expansion Model↗

An optimization model for energy generation and distribution in a dynamic facility

An analytical model is described using linear programming for the optimum generation and distribution of energy demands among competing energy resources and different economic criteria. The model, which will be used as a general engineering tool in the analysis of the Deep Space Network ground facility, considers several essential decisions for better design and operation. The decisions sought for the particular energy application include: the optimum time to build an assembly of elements, inclusion of a storage medium of some type, and the size or capacity of the elements that will minimize the total life-cycle cost over a given number of years. The model, which is structured in multiple time divisions, employ the decomposition principle for large-size matrices, the branch-and-bound method in mixed-integer programming, and the revised simplex technique for efficient and economic computer use.

Lansing, F. L.↗

A DSN optimal spacecraft scheduling model

A computer model is described which uses mixed-integer linear programming to provide optimal DSN spacecraft schedules given a mission set and specified scheduling requirements. A solution technique is proposed which uses Bender's Method and a heuristic starting algorithm.

Webb, W. A.↗

An optimal spacecraft scheduling model for the NASA deep space network

A computer model is described which uses mixed-integer linear programming to provide optimal DSN spacecraft schedules given a mission set and specified scheduling requirements. A solution technique is proposed which uses Bender's method and a heuristic starting algorithm.

Webb, W. A.↗