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

A Simple Model to Optimize Third Integer Resonance Extraction Parameters

In storage rings with slow resonant extraction one of the main goals of optimization is the extraction inefficiency, or the fraction of beam lost due to hitting the septum plane. A simple analytical model based on a perturbation theoretic approach is built to help determine optimal parameters. It also helps to evaluate the design performance in time and in a range of machine parameters.

Nagaslaev, Vladimir↗

Moving multiple sinks through wireless sensor networks for lifetime maximization.

Unattended sensor networks typically watch for some phenomena such as volcanic events, forest fires, pollution, or movements in animal populations. Sensors report to a collection point periodically or when they observe reportable events. When sensors are too far from the collection point to communicate directly, other sensors relay messages for them. If the collection point location is static, sensor nodes that are closer to the collection point relay far more messages than those on the periphery. Assuming all sensor nodes have roughly the same capabilities, those with high relay burden experience battery failure much faster than the rest of the network. However, since their death disconnects the live nodes from the collection point, the whole network is then dead. We consider the problem of moving a set of collectors (sinks) through a wireless sensor network to balance the energy used for relaying messages, maximizing the lifetime of the network. We show how to compute an upper bound on the lifetime for any instance using linear and integer programming. We present a centralized heuristic that produces sink movement schedules that produce network lifetimes within 1.4% of the upper bound for realistic settings. We also present a distributed heuristic that produces lifetimes at most 25:3% below the upper bound. More specifically, we formulate a linear program (LP) that is a relaxation of the scheduling problem. The variables are naturally continuous, but the LP relaxes some constraints. The LP has an exponential number of constraints, but we can satisfy them all by enforcing only a polynomial number using a separation algorithm. This separation algorithm is a p-median facility location problem, which we can solve efficiently in practice for huge instances using integer programming technology. This LP selects a set of good sensor configurations. Given the solution to the LP, we can find a feasible schedule by selecting a subset of these configurations, ordering them via a traveling salesman heuristic, and computing feasible transitions using matching algorithms. This algorithm assumes sinks can get a schedule from a central server or a leader sink. If the network owner prefers the sinks make independent decisions, they can use our distributed heuristic. In this heuristic, sinks maintain estimates of the energy distribution in the network and move greedily (with some coordination) based on local search. This application uses the new SUCASA (Solver Utility for Customization with Automatic Symbol Access) facility within the PICO (Parallel Integer and Combinatorial Optimizer) integer programming solver system. SUCASA allows rapid development of customized math programming (search-based) solvers using a problem's natural multidimensional representation. In this case, SUCASA also significantly improves runtime compared to implementations in the ampl math programming language or in perl.

54 ENVIRONMENTAL SCIENCES↗

Quantum Circuit Designs of Integer Division Optimizing T-Count and T-Depth

Quantum circuits for basic mathematical functions such as division are required to implement scientific computing algorithms on quantum computers. In this work, we propose two designs for quantum integer division. The designs are based on quantum Clifford+T gates and are optimized for T-count and T-depth. Quantum circuits that are based on Clifford+T gates can be made fault tolerant in nature but the T gate is very costly to implement. As a result, reducing T-count and T-depth have become important optimization goals. Existing quantum hardware is limited in terms of number of available qubits. Thus, ancillary qubits are a circuit overhead that needs to be kept to a minimum. We propose two quantum integer division circuits. The first quantum integer division circuit is based on the non-restoring division algorithm. The proposed non-restoring division circuit is optimized for total quantum hardware (T-count and T-depth) cost but requires 2* n + 1 ancillary qubits. We also propose a quantum integer division circuit based on the restoring division algorithm. The proposed restoring division circuit is optimized for total qubits. The design requires only n ancillary qubits but will need more quantum hardware than the non-restoring division circuit. Both proposed quantum circuits are based on (i) a new quantum conditional addition circuit, (ii) a new quantum adder-subtractor and (iii) a new quantum subtraction circuit. Further, both designs are compared and shown to be superior to existing work in terms of T-count and T-depth. The proposed quantum non-restoring integer division circuit has a 96% improvement in terms of T-count and a 93% improvement in terms of T-depth compared to existing work. The proposed quantum restoring integer division circuit has a 91% improvement in terms of T-count and a 86% improvement in terms of T-count compared to the existing work.

Thapliyal, Himanshu↗

Fast Integer Ambiguity Resolution for GPS Attitude Determination

In this paper, a new algorithm for GPS (Global Positioning System) integer ambiguity resolution is shown. The algorithm first incorporates an instantaneous (static) integer search to significantly reduce the search space using a geometric inequality. Then a batch-type loss function is used to check the remaining integers in order to determine the optimal integer. This batch function represents the GPS sightline vectors in the body frame as the sum of two vectors, one depending on the phase measurements and the other on the unknown integers. The new algorithm has several advantages: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can resolve the integers even when coplanar baselines exist. The performance of the new algorithm is tested on a dynamic hardware simulator.

Lightsey, E. Glenn↗

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↗

High-Performance Algorithm for Solving the Diagnosis Problem

An improved method of model-based diagnosis of a complex engineering system is embodied in an algorithm that involves considerably less computation than do prior such algorithms. This method and algorithm are based largely on developments reported in several NASA Tech Briefs articles: The Complexity of the Diagnosis Problem (NPO-30315), Vol. 26, No. 4 (April 2002), page 20; Fast Algorithms for Model-Based Diagnosis (NPO-30582), Vol. 29, No. 3 (March 2005), page 69; Two Methods of Efficient Solution of the Hitting-Set Problem (NPO-30584), Vol. 29, No. 3 (March 2005), page 73; and Efficient Model-Based Diagnosis Engine (NPO-40544), on the following page. Some background information from the cited articles is prerequisite to a meaningful summary of the innovative aspects of the present method and algorithm. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD. Diagnosis the task of finding faulty components is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. The calculation of a minimal diagnosis is inherently a hard problem, the solution of which requires amounts of computation time and memory that increase exponentially with the number of components of the engineering system. Among the developments to reduce the computational burden, as reported in the cited articles, is the mapping of the diagnosis problem onto the integer-programming (IP) problem. This mapping makes it possible to utilize a variety of algorithms developed previously for IP to solve the diagnosis problem. In the IP approach, the diagnosis problem can be formulated as a linear integer optimization problem, which can be solved by use of well-developed integer-programming algorithms. This concludes the background information.

Fijany, Amir↗

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↗

Fleet Assignment Using Collective Intelligence

Airline fleet assignment involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of an agent-based integer optimization algorithm to a "cold start" fleet assignment problem. Results show that the optimizer can successfully solve such highly- constrained problems (129 variables, 184 constraints).

Antoine, Nicolas E.↗

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↗