Search NASA⌕ Search

SEARCH · Search NASA

Results for “Integer Optimization”

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

Optimal control to handle variations in moisture content and reactor in-feed rate

The variations in feedstock characteristics, such as moisture and particle size distribution, lead to an inconsistent flow of feedstock from the biomass pre-processing system to the reactor in-feed system. These inconsistencies result in low on-stream times at the reactor in-feed equipment. This research develops an optimal process control method for a biomass pre-processing system comprised of milling and densification operations to provide the consistent flow of feedstock to a reactor's throat. This method uses a mixed-integer optimization model to identify optimal bale sequencing, equipment in-feed rate, and buffer location and size in the biomass pre-processing system. This method, referred to as the hybrid process control (HPC), aims to maximize throughput over time. We compare HPC with a baseline feed forward process control. Our case study based on switchgrass finds that HPC reduces the variation of a reactor's feeding rate by up to 100% without increasing the operating cost of the biomass pre-processing system for biomass with moisture ranging from 10 to 25%. Additionally, HPC reduces the cost of processing biomass by 0.36%–2.22%, and reduces processing time by 0.35%-2.24%. Furthermore, a biorefinery can adapt HPC to achieve its design capacity.

09 BIOMASS FUELS↗

Coordination of Wind Farm and Pumped-Storage Hydro for a Self-Healing Power Grid

The increasing penetration of wind energy poses great challenges to the operation of power systems in normal and emergency states. However, energy storage technologies can help accommodate wind power uncertainty and variability due to their flexible characteristics. This paper focuses on the restoration phase, and provides a novel coordination strategy of wind and pumped-storage hydro (PSH) units for a faster and reliable self-healing process. The wind-PSH assisted power system restoration is formulated as a two-stage adaptive robust optimization problem. The first-stage problem determines the start-up sequence of generators and the energization times of transmission paths; and the second-stage problem decides load pickup sequences, wind power dispatch levels, and PSH units' operating modes. The column-and-constraint generation decomposition algorithm is applied to solve the two-stage adaptive robust optimization problem, which has a mixed-integer optimization in the inner-level problem. The developed coordination strategy is tested on the modified IEEE 39-bus system. Numerical results demonstrate that the coordinated wind and PSH units can increase the total energy served, enhance wind power dispatchability, and reduce wind power curtailment.

17 WIND ENERGY↗

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↗

OPTUM : Optimum Portfolio Tool for Utility Maximization documentation and user's guide.

The Optimum Portfolio Tool for Utility Maximization (OPTUM) is a versatile and powerful tool for selecting, optimizing, and analyzing portfolios. The software introduces a compact interface that facilitates problem definition, complex constraint specification, and portfolio analysis. The tool allows simple comparisons between user-preferred choices and optimized selections. OPTUM uses a portable, efficient, mixed-integer optimization engine (lp-solve) to derive the optimal mix of projects that satisfies the constraints and maximizes the total portfolio utility. OPTUM provides advanced features, such as convenient menus for specifying conditional constraints and specialized graphical displays of the optimal frontier and alternative solutions to assist in sensitivity visualization. OPTUM can be readily applied to other nonportfolio, resource-constrained optimization problems.

97 MATHEMATICS AND COMPUTING↗

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

CIPDSS-PST: CIPDSS portfolio slection tool documentation and user's guide.

The Critical Infrastructure Protection Decision Support System--Portfolio Support Tool (CIPDSS-PST) provides a versatile and powerful tool for selecting, optimizing, and analyzing portfolios. The software introduces a compact interface that facilitates problem definition, constraint specification, and portfolio analysis. The tool also provides a simple screen design for comparing user-preferred choices with optimized selections. CIPDSS-PST uses a portable, efficient, mixed-integer optimization engine (lp{_}solve) to derive the optimal mix of projects that satisfies the constraints and maximizes the total portfolio utility. The CIPDSS-PST software can be readily applied to other nonportfolio, resource-constrained optimization problems.

97 MATHEMATICS AND COMPUTING↗

Nodal capacity expansion planning with flexible large-scale load siting

We propose explicitly incorporating large-scale load siting into a stochastic nodal power system capacity expansion planning model that concurrently co-optimizes generation, transmission, and storage expansion. The potential operational flexibility of some of these large loads is also taken into account by considering them as consisting of a set of tranches with different reliability requirements, which are modeled as a constraint on expected served energy across operational scenarios. We implement our model as a two-stage stochastic mixed-integer optimization problem with cross-scenario expectation constraints. To overcome the challenge of scalability, we build upon existing work to implement this model on a high performance computing platform and exploit scenario parallelization using an augmented Progressive Hedging Algorithm. The algorithm is implemented using the bounding features of mpisppy, which have shown to provide satisfactory provable optimality gaps despite the absence of theoretical guarantees of convergence. We test our approach and assess the value of this proactive planning framework on total system cost and reliability metrics using realistic testcases geographically assigned to San Diego and South Carolina, with datacenter and direct air capture facilities as large loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal Integrated Design of Air Separation Unit and Gas Turbine Block for IGCC Systems

The Integrated Gasification Combined Cycle (IGCC) systems are considered as a promising technology for power generation. However, they are not yet in widespread commercial use and opportunities remain to improve system feasibility and profitability via improved process integration. This work focuses on the integrated design of gasification system, air separation unit (ASU) and the gas turbine (GT) block. The ASU supplies oxygen to the gasification system and it can also supply nitrogen (if required as a diluent) to the gas turbine block with minimal incremental cost. Since both GT and the ASU require a source of compressed air, integrating the air requirement of these units is a logical starting point for facility optimization (Smith et al., 1997). Air extraction from the GT can reduce or avoid the compression cost in the ASU and the nitrogen injection can reduce NOx emissions and promote trouble-free operation of the GT block (Wimer et al., 2006). There are several possible degrees of integration between the ASU and the GT (Smith and Klosek, 2001). In the case of 'total' integration, where all the air required for the ASU is supplied by the GT compressor and the ASU is expected to be an elevated-pressure (EP) type. Alternatively, the ASU can be 'stand alone' without any integration with the GT. In this case, the ASU operates at low pressure (LP), with its own air compressor delivering air to the cryogenic process at the minimum energy cost. Here, nitrogen may or may not be injected because of the energy penalty issue and instead, syngas humidification may be preferred. A design, which is intermediate between these two cases, involves partial supply of air by the gas turbine and the remainder by a separate air compressor. These integration schemes have been utilized in some IGCC projects. Examples include Nuon Power Plant at Buggenum, Netherlands (both air and nitrogen integration), Polk Power Station at Tampa, US (nitrogen-only integration) and LGTI at Plaquemine, US (stand-alone). However, there is very little information on systematic assessment of air extraction, nitrogen injection and configuration and operating conditions of the ASU and it is not clear which scheme is optimal for a given IGCC application. In this work, we address the above mentioned problem systematically using mixed-integer optimization. This approach allows the use of various objectives such as minimizing the investment and operating cost or SOx and NOx emissions, maximizing power output or overall efficiency or a weighted combination of these factors. A superstructure is proposed which incorporates all the integration schemes described above. Simplified models for ASU, gas turbine system and steam cycle are used which provide reasonable estimates for performance and cost (Frey and Zhu, 2006). The optimal structural configuration and operating conditions are presented for several case studies and it is observed that the optimal solution changes significantly depending on the specified objective.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal integrated design of air separation unit and gas turbine block for IGCC systems

The Integrated Gasification Combined Cycle (IGCC) systems are considered as a promising technology for power generation. However, they are not yet in widespread commercial use and opportunities remain to improve system feasibility and profitability via improved process integration. This work focuses on the integrated design of gasification system, air separation unit (ASU) and the gas turbine (GT) block. The ASU supplies oxygen to the gasification system and it can also supply nitrogen (if required as a diluent) to the gas turbine block with minimal incremental cost. Since both GT and the ASU require a source of compressed air, integrating the air requirement of these units is a logical starting point for facility optimization (Smith et al., 1997). Air extraction from the GT can reduce or avoid the compression cost in the ASU and the nitrogen injection can reduce NOx emissions and promote trouble-free operation of the GT block (Wimer et al., 2006). There are several possible degrees of integration between the ASU and the GT (Smith and Klosek, 2001). In the case of 'total' integration, where all the air required for the ASU is supplied by the GT compressor and the ASU is expected to be an elevated-pressure (EP) type. Alternatively, the ASU can be 'stand alone' without any integration with the GT. In this case, the ASU operates at low pressure (LP), with its own air compressor delivering air to the cryogenic process at the minimum energy cost. Here, nitrogen may or may not be injected because of the energy penalty issue and instead, syngas humidification may be preferred. A design, which is intermediate between these two cases, involves partial supply of air by the gas turbine and the remainder by a separate air compressor. These integration schemes have been utilized in some IGCC projects. Examples include Nuon Power Plant at Buggenum, Netherlands (both air and nitrogen integration), Polk Power Station at Tampa, US (nitrogen-only integration) and LGTI at Plaquemine, US (stand-alone). However, there is very little information on systematic assessment of air extraction, nitrogen injection and configuration and operating conditions of the ASU and it is not clear which scheme is optimal for a given IGCC application. In this work, we address the above mentioned problem systematically using mixed-integer optimization. This approach allows the use of various objectives such as minimizing the investment and operating cost or SOx and NOx emissions, maximizing power output or overall efficiency or a weighted combination of these factors. A superstructure is proposed which incorporates all the integration schemes described above. Simplified models for ASU, gas turbine system and steam cycle are used which provide reasonable estimates for performance and cost (Frey and Zhu, 2006). The optimal structural configuration and operating conditions are presented for several case studies and it is observed that the optimal solution changes significantly depending on the specified objective.

97 MATHEMATICS AND COMPUTING↗

Multidimensional sum-up rounding for integer programming in optimal experimental design

Here we present a numerical method for approximating the solution of convex integer programs stemming from optimal experimental design. The statistical setup consists of a Bayesian framework for linear inverse problems for which the direct relationship is described by a discretized integral equation. Specifically, we aim to find the optimal sensor placement from a set of candidate locations where data are collected with measurement error. The convex objective function is a measure of the uncertainty, described here by the trace or log-determinant of the posterior covariance matrix, for the discretized linear inverse problem solution. The resulting convex integer program is relaxed, producing a lower bound. An upper bound is obtained by extending the sum-up rounding approach to multiple dimensions. For this extension, we analyze its accuracy as a function of the discretization mesh size for a rectangular domain. We show asymptotic optimality of the integer solution defining the upper bound for different experimental design criteria (A- and D-optimal), by proving the convergence to zero of the gap between the upper and lower bounds as the mesh size goes to zero. The technique is illustrated on a two-dimensional gravity surveying problem for both A-optimal and D-optimal sensor placement where our designs yield better results compared with a thresholding rounding approach.

97 MATHEMATICS AND COMPUTING↗

Graphical models for optimal power flow

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modeling design and control problems involving neural network surrogates

Here, we consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence, and then characterize stationarity of such models. We then present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation: as a mixed-integer optimization problem and as a mathematical program with complementarity constraints. For the latter formulation we prove that stationarity at a point for this problem corresponds to stationarity of the embedded formulation. Each of these formulations may be solved with state-of-the-art optimization methods, and we show how to obtain good initial feasible solutions for these methods. We compare our formulations on three practical applications arising in the design and control of combustion engines, in the generation of adversarial attacks on classifier networks, and in the determination of optimal flows in an oil well network.

97 MATHEMATICS AND COMPUTING↗

Optimizing dynamic wireless charging for electric buses: A data-driven approach to infrastructure planning

The network configuration significantly impacts the performance of dynamic wireless charging (DWC) technology for electric buses. Here, this study presents a novel approach to planning charging infrastructure for public transit using data-driven nonconvex mixed-integer optimization. Integrating DWC and charging station technologies reveals a trade-off between enroute and stationary charging times. Our framework optimizes bus frequency settings and transmitter coil arrangements to minimize operational and infrastructure costs. A case study in Chattanooga, Tennessee, demonstrates the method's effectiveness in mitigating range anxiety and reducing charging expenses. This research implies that integrating DWC technology into public transit systems can enhance the feasibility and cost-effectiveness of electric bus operations, promoting sustainable urban mobility.

33 ADVANCED PROPULSION SYSTEMS↗

Real-Time Control of an Ensemble of Heterogeneous Resources

This paper focuses on the problem of controlling an ensemble of heterogeneous resources connected to an electrical grid at the same point of common coupling (PCC). The controller receives an aggregate power setpoint for the ensemble in real time and tracks this setpoint by issuing individual optimal setpoints to the resources. The resources can have continuous or discrete nature (e.g., heating systems consisting of a finite number of heaters that each can be either switched on or off) and/or can be highly uncertain (e.g., photovoltaic (PV) systems or residential loads). A naive approach would lead to a stochastic mixed-integer optimization problem to be solved at the controller at each time step, which might be infeasible in real time. Instead, we allow the controller to solve a continuous convex optimization problem and compensate for the errors at the resource level by using a variant of the well-known error diffusion algorithm. We give conditions guaranteeing that our algorithm tracks the power setpoint at the PCC on average while issuing optimal setpoints to individual resources. We illustrate the approach numerically by controlling a collection of batteries, PV systems, and discrete loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Decision Analysis Methods For the Analysis of Nuclear Terrorism Threats with Imperfect Information

Protection of commercial nuclear fuel cycles against adversary groups who may attempt to steal weapons-usable material is an issue of interest to the U.S. Department of Energy, Office of Nuclear Energy. The wide array of potential nuclear fuel cycle configurations and the security measures that could be deployed to protect them pose a daunting system design problem. In general, there are billions of potential design configurations. Moreover, the design choices are not independent – the effectiveness of one design feature or security measure can affect the desirability of other design choices. To explore this issue, we develop a mixed-integer optimization problem that solves a complex decision tree to allocate security resources across a commercial nuclear fuel cycle configuration. A nominal UREX+ reprocessing facility is used to demonstrate how the model allocates resources across a particular fuel cycle facility and shows how the problem can be scaled up to include other facilities and design features in the fuel cycle. In our model, the defender first chooses a set of safeguards to implement in order to mitigate the risk of a terrorist theft from various unit operations in the reprocessing facility. The attacker observes the defender’s strategy choice and executes an attack to acquire material, including the possibility of declining to attack at all. The model considers the terrorist as an intelligent adversary with a set of attack strategies known to the defender. The strategic choices made by both the defender and attacker affect the probability of a successful attack by the terrorist and in turn affect the distribution of consequences to the defender. We use a decision tree to illustrate the interactions among costs, decisions, correlated uncertainties, and outcomes, and then show how to formulate the problem as a mixed-integer program with an equivalent solution. The novel features of our formulation include the following. First, as discussed above, we use a sequential game-theoretic formulation (a Stackelberg game). This formulation assumes the attacker can observe the defender’s actions before the attack is executed. Many previous game-theoretic studies have assumed attacker and defender act simultaneously without knowledge of the other’s strategy choice. We believe the sequential game formulation is more applicable for knowledgeable insider adversaries, the focus of this study. Second, we build on our previous work that has developed a methodology to reflect the correlation among probability distributions represented as discrete chance nodes in a decision tree. We illustrate how this methodology can be applied to two chance nodes in a decision tree that relate the quality of the materials that might be stolen or diverted by an adversary with the yield of a weapon that might be constructed from that material. In a decision tree, the dependence of the yield on the quality of the material could be modeled with conditional probabilities of the weapon yield given the quality of the materials obtained. For three outcome discretizations, this would require the assessment of nine conditional probabilities from domain experts as part of the model building effort. In contrast, our methodology will allow this same representation of the tree based on the assessment of the correlation between these two chance nodes by the experts, which we believe is a much easier and more reliable assessment task. The advantage of this approach increases as the number of dependent chance nodes grows in a decision tree representation of this problem. Third, we extend this approach to the approximation of the dependence between discrete binary events such as success or failure represented by binary chance nodes in a decision tree or in the special case of a probabilistic risk analysis (PRA) based on an event tree. This extension is a novel application in this domain, and uses Monte Carlo simulation to determine the appropriate conditional probabilities on the binary chance nodes when the number of correlated uncertainties is more than two. Fourth, we show how these decision trees or probability trees can be formulated and solved as equivalent integer programming (IP) problems. The advantages of the IP representation include the opportunity to use the computing power associated with powerful optimization solver algorithms available on high speed computers to solve very large versions of these trees, and the ability to include several such models of different facilities into a much larger IP with connecting constraints that represent budget restrictions, number of available inspection opportunities in a given time window, or other dependencies among these facilities. Policy makers can use the resulting model to inform their decisions about how to assess terrorism risk and to safeguard the commercial nuclear fuel cycle.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

SU-E-T-574: Novel Chance-Constrained Optimization in Intensity-Modulated Proton Therapy Planning to Account for Range and Patient Setup Uncertainties

Purpose: We propose to apply a probabilistic framework, namely chanceconstrained optimization, in the intensity-modulated proton therapy (IMPT) planning subject to range and patient setup uncertainties. The purpose is to hedge against the influence of uncertainties and improve robustness of treatment plans. Methods: IMPT plans were generated for a typical prostate patient. Nine dose distributions are computed — the nominal one and one each for ±5mm setup uncertainties along three cardinal axes and for ±3.5% range uncertainty. These nine dose distributions are supplied to the solver CPLEX as chance constraints to explicitly control plan robustness under these representative uncertainty scenarios with certain probability. This probability is determined by the tolerance level. We make the chance-constrained model tractable by converting it to a mixed integer optimization problem. The quality of plans derived from this method is evaluated using dose-volume histogram (DVH) indices such as tumor dose homogeneity (D5% – D95%) and coverage (D95%) and normal tissue sparing like V70 of rectum, V65, and V40 of bladder. We also compare the results from this novel method with the conventional PTV-based method to further demonstrate its effectiveness Results: Our model can yield clinically acceptable plans within 50 seconds. The chance-constrained optimization produces IMPT plans with comparable target coverage, better target dose homogeneity, and better normal tissue sparing compared to the PTV-based optimization [D95% CTV: 67.9 vs 68.7 (Gy), D5% – D95% CTV: 11.9 vs 18 (Gy), V70 rectum: 0.0 % vs 0.33%, V65 bladder: 2.17% vs 9.33%, V40 bladder: 8.83% vs 21.83%]. It also simultaneously makes the plan more robust [Width of DVH band at D50%: 2.0 vs 10.0 (Gy)]. The tolerance level may be varied to control the tradeoff between plan robustness and quality. Conclusion: The chance-constrained optimization generates superior IMPT plan compared to the PTV-based optimization with explicit control of plan robustness. NIH/NCI K25CA168984, Eagles Cancer Research Career Development, The Lawrence W. and Marilyn W. Matteson Fund for Cancer Research, Mayo ASU Seed Grant, and The Kemper Marley Foundation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Real-Time Dispatch With Secondary Frequency Regulation: A Pathway to Consider Intra-Interval Fluctuations

Real-time dispatch balances the power demand with minimized operating costs. For the current dispatch model, the demand is assumed to be constant within a time interval, while the intra-interval power balance is left to frequency regulation. Based on practical experience and simulations, this behavior may lead to insufficient frequency regulation and uneconomic regulation costs considering the increase in intra-interval fluctuations caused by renewables. Here, a real-time dispatch method with secondary frequency regulation behaviors is proposed. Without changing the interval of the real-time dispatch command, the system regulation mileage and intra-interval generation adjustment are explicitly formulated in a mixed-integer optimization model. To reduce the computational burden, an efficient two-stage calculation method is proposed. With practical utility data, this article finds that the proposed method can effectively improve the system frequency performance with the subminute net load forecasting curve obtained by an off-the-shelf forecasting approach. Time-domain simulations in IEEE and practical utility systems validate the effectiveness of the proposed method in terms of the frequency performance and total operating costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Robotic path-finding in inverse treatment planning for stereotactic radiosurgery with continuous dose delivery

Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, are used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.

60 APPLIED LIFE SCIENCES↗