Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mixed Integer Programming”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

71 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

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↗
DOE OSTI2025

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↗
DOE OSTI2025

Hyperplane decision trees as piecewise linear surrogate models for chemical process design

Recent trends in chemical engineering research point towards an increasing reliance on data-driven modeling approaches. Neural networks, for instance, have proven to be accurate when data is plentiful and high-dimensional, but in many cases, they require computationally-intensive training procedures. Here, in this work, we describe hyperplane decision trees (HT) as a highly expressive and low-compute machine learning model architecture. These models are locally linear and have linear decision boundaries, resulting in a piecewise linear model of the data. This property allows them to be converted into mixed-integer linear constraints which can be globally optimized. Our open-source PyTorch implementation of this method is a fast, flexible, and accessible way to build accurate piecewise linear models of data.

Decision trees↗
DOE OSTI2026

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗
DOE OSTI2024

Enhancing power grid resilience to winter storms via generator winterization with equity considerations

Here we develop two-stage stochastic programming models for generator winterization that enhance power grid resilience while incorporating social equity. The first stage in our models captures the investment decisions for generator winterization, and the second stage captures the operation of a degraded power grid, with the objective of minimizing load shed and social inequity. To incorporate equity into our models, we propose a concept called adverse effect probability that captures the disproportionate effects of power outages on communities with varying vulnerability levels. Grid operations are modeled using DC power flow, and equity is captured through mean or maximum adverse effects experienced by communities. We apply our models to a synthetic Texas power grid, using winter storm scenarios created from the generator outage data from the 2021 Texas winter storm. Our extensive numerical experiments show that more equitable outcomes, in the sense of reducing adverse effects experienced by vulnerable communities during power outages, are achievable with no impact on total load shed through investing in winterization of generators in different locations and capacities.

24 POWER TRANSMISSION AND DISTRIBUTION↗
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 OSTI2024

ACOPF Transmission Switching Using Open-Source MINLP Solvers

The optimal transmission switching (OTS) problem with AC physics represents a mixed integer non-linear non-convex optimization problem which can provide benefits to transmission level power system operations. In this paper we benchmark a set of open-source mixed integer non-linear programming (MINLP) solvers on the OTS problem with AC physics using the pglib set of power system test cases. Results characterizing the performance of the different solvers are reported and discussed.

ACOPF↗
DOE OSTI2026

Integrated Transmission-Distribution Multi-Period Switching for Wildfire Risk Mitigation: Improving Speed and Scalability with Distributed Optimization: Preprint

With increasingly severe wildfire conditions driven by climate change, utilities must manage the risk of wildfire ignitions from electric power lines. During "public safety power shutoff'" events, utilities de-energize power lines to reduce wildfire ignition risk, which may result in load shedding. Distributed energy resources provide flexibility that can help support the system to reduce load shedding when lines are de-energized. We investigate a coordinated transmission-distribution optimization problem that balances wildfire risk mitigation and load shedding. We model distribution systems that include battery energy storage systems which may support loads when transmission lines are de-energized. This multi-period integrated transmission-distribution optimal switching problem jointly optimizes line switching decisions, the generators' setpoints, load shedding, and the batteries' states of charge, resulting in significant computational challenges. To improve scalability, we decompose the problem over both space and time and apply a distributed optimization algorithm. Using a large-scale synthetic California test case with realistic distribution models and real wildfire risk data, we show that distributed optimization can solve large-scale multi-period switching problems that are otherwise intractable for centralized solvers. We also discuss challenges and future directions for improving the distributed algorithm's convergence performance as the number of time periods increases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

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↗
DOE OSTI2025

A matheuristic for design and dispatch of a utility-connected distributed energy system

Modeling distributed power generation systems often requires complicated mathematical expressions that present challenges for commercial optimization solvers. Here, this paper presents a matheuristic to solve a mixed-integer optimization model that informs decisions regarding the design and dispatch of a utility-connected microgrid. We deploy a genetic algorithm to search the system design space and a linear program to solve the economic dispatch problem. The model is a component of a web tool that requires solutions within a few minutes. Our method yields objective function values within 5% of an exogenously produced optimal in fewer than 30 seconds for 90% of our test cases compared to only 10% of our test cases by a traditional optimization solver in the same amount of time.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

A bilevel multistage stochastic self-scheduling model with indivisibilities for trading in the continuous intraday electricity market

In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.

Bilevel multistage stochastic programming problem↗
DOE OSTI2025

Mapping Spiking Neural Networks to Heterogeneous Crossbar Architectures using Integer Linear Programming

Advances in novel hardware devices and architectures allow Spiking Neural Network (SNN) evaluation using ultra-low power, mixed-signal, memristor crossbar arrays. As individual network sizes quickly scale beyond the dimensional capabilities of single crossbars, networks must be mapped onto multiple crossbars. Crossbar sizes within modern Memristor Crossbar Architectures (MCAs) are determined predominately not by device technology but by network topology; more, smaller crossbars consume less area thanks to the high structural sparsity found in larger, brain-inspired SNNs. Motivated by continuing increases in SNN sparsity due to improvements in training methods, we propose utilizing heterogeneous crossbar sizes to further reduce area consumption. This approach was previously unachievable as prior compiler studies only explored solutions targeting homogeneous MCAs. Our work improves on the state-of-the-art by providing Integer Linear Programming (ILP) formulations supporting arbitrarily heterogeneous architectures. By modeling axonal interactions between neurons, our methods produce better mappings while removing inhibitive a priori knowledge requirements. We first show a 16.7-27.6% reduction in area consumption for square-crossbar homogeneous architectures. Then, we demonstrate 66.9-72.7% further reduction when using a reasonable configuration of heterogeneous crossbar dimensions. Next, we present a new optimization formulation capable of minimizing the number of inter-crossbar routes. When applied to solutions already near-optimal in area, an 11.9-26.4% routing reduction is observed without impacting area consumption. Finally, we present a profile-guided optimization capable of minimizing the number of runtime spikes between crossbars. Compared to the best-area-then-route optimized solutions, we observe a further 0.5-14.8% inter-crossbar spike reduction while requiring 1–3 orders of magnitude less solver time.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗
DOE OSTI2025

Revenue-Maximizing Shared Parking and Electric Vehicle Charging Management in Multi-Unit Dwellings

In urban areas, searching for parking and electric vehicle (EV) charging can result in cruising, congestion, and environmental externalities. Recognizing the business opportunity of offering private parking and charging infrastructure access within multi-unit dwellings (MUDs) during daytime, we model a shared parking and EV charging management system. We maximize the revenue of MUD charging hubs in mixed land use, catering to public demand. Our approach accounts for the objectives of the two stakeholders involved: a demand model is fitted on the choices of EV charging users, and the supply model optimizes the allocation of parking and charging requests in an MUD parking lot. A binary integer linear programming model for the allocation of parking and charging spaces with a rolling horizon is integrated with matching rules that handle both parking and charging requests. In our numerical experiments in a neighborhood of Chicago, Illinois, we estimate the performance of the MUD parking and charging system with metrics that include revenue, number of matchings, and utilization rates. At any given time, MUDs with lower prices attract more charging requests, particularly those of longer duration, resulting in higher revenue and greater charging utilization. Dynamic pricing facilitates a more equitable distribution of requests; as MUD parking lots reach capacity and their fees increase, other MUDs become more competitive, attracting additional requests. Comparing our method against first-come-first-served and optimal-solution benchmarks, we demonstrate our model’s effectiveness in dynamically managing mixed parking and charging demand in MUD charging hubs.

electric vehicle, multi-unit dwelling, charging in↗
DOE OSTI2025

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]↗