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 433 records · Page 24

Exploiting Identical Generators in Unit Commitment

Here, we present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves) into a single unit reduces redundancy in the search space induced by both exact symmetry (permutations of generator schedules) and certain classes of mutually non-dominated solutions. We study the impact of aggregation on two large-scale UC instances, one from the academic literature and another based on real-world operator data. Our computational tests demonstrate that when present, identical generators can negatively affect the performance of modern MILP solvers on UC formulations. Further, we show that our reformation of the UC MILP through aggregation is an effective method for mitigating this source of computational difficulty.

97 MATHEMATICS AND COMPUTING↗

LEISURE: Load-Balanced Network-Wide Traffic Measurement and Monitor Placement

We report that network-wide traffic measurement is of interest to network operators to uncover global network behavior for the management tasks of traffic accounting, debugging or troubleshooting, security, and traffic engineering. Increasingly, sophisticated network measurement tasks such as anomaly detection and security forensic analysis are requiring in-depth fine-grained flow-level measurements. However, performing in-depth per-flow measurements (e.g., detailed payload analysis) is often an expensive process. Given the fast-changing Internet traffic landscape and large traffic volume, a single monitor is not capable of accomplishing the measurement tasks for all applications of interest due to its resource constraint. Moreover, uncovering global network behavior requires network-wide traffic measurements at multiple monitors across the network since traffic measured at any single monitor only provides a partial view and may not be sufficient or accurate. These factors call for coordinated measurements among multiple distributed monitors. In this paper, we present a centralized optimization framework, LEISURE (Load- EqualIzed meaSUREment), for load-balancing network measurement workloads across distributed monitors. Specifically, we consider various load-balancing problems under different objectives and study their extensions to support both fixed and flexible monitor deployment scenarios. We formulate the latter flexible monitor deployment case as an MILP (Mixed Integer Linear Programming) problem and propose several heuristic algorithms to approximate the optimal solution and reduce the computation complexity. We evaluate LEISURE via detailed simulations on Abilene and GEANT network traces to show that LEISURE can achieve much better load-balanced performance (e.g., 4.75 × smaller peak workload and 70 × smaller variance in workloads) across all coordinated monitors in comparison to a naive solution (uniform assignment) to accomplish network-wide traffic measurement tasks under the fixed monitor deployment scenario. Lastly, we also show that under the flexible monitor deployment setting, our heuristic solutions can achieve almost the same load-balancing performance as the optimal solution while reducing the computation times by a factor up to 22.5 × in Abilene and 800 × in GEANT.

42 ENGINEERING↗

Generation Expansion Planning With Large Amounts of Wind Power via Decision-Dependent Stochastic Programming

Power generation expansion planning needs to deal with future uncertainties carefully, given that the invested generation assets will be in operation for a long time. Many stochastic programming models have been proposed to tackle this challenge. However, most previous works assume predetermined future uncertainties (i.e., fixed random outcomes with given probabilities). In several recent studies of generation assets' planning (e.g., thermal versus renewable), new findings show that the investment decisions could affect the future uncertainties as well. To this end, this paper proposes a multistage decision-dependent stochastic optimization model for long-term large-scale generation expansion planning, where large amounts of wind power are involved. In the decision-dependent model, the future uncertainties are not only affecting but also affected by the current decisions. In particular, the probability distribution function is determined by not only input parameters but also decision variables. To deal with the nonlinear constraints in our model, a quasi-exact solution approach is then introduced to reformulate the multistage stochastic investment model to a mixed-integer linear programming model. The wind penetration, investment decisions, and the optimality of the decision-dependent model are evaluated in a series of multistage case studies. The results show that the proposed decision-dependent model provides effective optimization solutions for long-term generation expansion planning.

Zhan, Yiduo↗

Thermal energy storage to minimize cost and improve efficiency of a polygeneration district energy system in a real-time electricity market

District energy systems can produce low-cost utilities for large energy networks, but can also be a resource for the electric grid by their ability to ramp production or to store thermal energy by responding to real-time market signals. In this work, dynamic optimization exploits the flexibility of thermal energy storage by determining optimal times to store and extract excess energy. This concept is applied to a polygeneration distributed energy system with combined heat and power, district heating, district cooling, and chilled water thermal energy storage. The system is a university campus responsible for meeting the energy needs of tens of thousands of people. The objective for the dynamic optimization problem is to minimize cost over a 24-h period while meeting multiple loads in real time. The paper presents a novel algorithm to solve this dynamic optimization problem with energy storage by decomposing the problem into multiple static mixed-integer nonlinear programming (MINLP) problems. Another innovative feature of this work is the study of a large, complex energy network which includes the interrelations of a wide variety of energy technologies. Results indicate that a cost savings of 16.5% is realized when the system can participate in the wholesale electricity market.

25 ENERGY STORAGE↗

A superstructure optimization approach for process synthesis under complex reaction networks

Here in this work, we present mixed integer linear programming methods for the synthesis of processes that involve complex reaction networks. Specifically, we consider the modeling of reactors and interconnecting streams in systems where the composition of the reactor inlet streams can vary substantially, thereby making the determination of the limiting component as well as the calculation of the stream heating/cooling and power requirements challenging. First, towards the modeling of reactors, we develop an extent-based method which detects the limiting reactant of each reaction occurring in parallel with others, based on the inlet flows of the reactants. Second, we develop a computationally tractable method for the calculation of the work and heating/cooling duty needed to condition any stream of a process based on simple calculations that can be performed offline. Finally, we present how the two aforementioned components can be integrated in an optimization model generated based on a process superstructure. We demonstrate the application of the developed methods for the synthesis of a biorefinery.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The use of multi-objective optimization to improve the design process of nuclear power plant systems

Multi-objective optimization is proposed to address the problem of design optimality in the nuclear power plant design process. This is done via the creation/development of the Optimization and Preference Tool for the Improvement of Nuclear Systems (OPTIONS). This work details applications of multi-objective optimization methods (in Python 3) to two different nuclear system design problems: the flash-Rankine power conversion system (PCS) of the I 2 S-LWR and the Passive Endothermic Reaction Cooling System (PERCS) attached to a standard PWR primary system (in RELAP5). The PCS design problem is first solved for three configurations using a specific particle swarm optimization method, achieving a thermodynamic efficiency of 34.81%. A new method, the Mixed-Integer Non-dominated Sorting Genetic Algorithm (MI-NSGA), is created and then used, solving a PCS superstructure of 22 configurations and achieving an efficiency of 35.63%. Finally, the OPTIONS tool is used to optimize the PERCS, improving cost, core temperature control, and cooling longevity.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Vehicle-to-manufacturing (V2M) system: A novel approach to improve energy demand flexibility for demand response towards sustainable manufacturing

The U.S. manufacturing sector accounts for 77% of the industrial energy consumption, but its participation in demand response (DR) programs is largely lagged behind. The limited flexibility in production scheduling under high capacity utilization and the lack of DR schemes that incorporate energy demand flexibility measures are deemed as major barriers. In this study, a framework of the interactive vehicles-to-manufacturing (V2M) energy sharing system is proposed to improve the energy demand flexibility of the aggregated system and enhance the DR effectiveness for manufacturers. The V2M-based DR scheme aims to reduce the energy cost by load shifting through joint production and energy sharing control, which can eventually promote manufacturing DR implementation even under high capacity utilization requirements and dynamic real-time electricity prices. The V2M system is modeled based on a discrete-Markov chain considering the complex interconnections among various manufacturing resources and multi-directional energy flows among manufacturing facilities, electric vehicles, and the power grid. Based on the system model, a mixed-integer nonlinear programming (MINLP) problem is formulated to identify the optimal DR scheme. The effectiveness of the proposed approach is validated through comparisons with traditional manufacturing DR schemes. Finally, the results show that a 2.1 to 6.5 times energy demand flexibility improvement and an additional 4.7% to 6.9% energy cost reduction can be achieved by the proposed approach.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A generalized superstructure-based framework for process synthesis

We propose a general framework for the formulation of superstructure-based optimization models for holistic process synthesis. First, we redefine the fundamental problems of reactor, separation, and heat exchanger network synthesis, by presenting generalized problem statements, to make them amenable to seamless integration with each other. Second, we describe the general forms of models that can be developed to address these generalized problems and identify some key characteristics. Notably, for each system, we identify internal variables used only within the system, cost variables used in the objective function, and, importantly, coupling variables for the coupling between systems. Third, we outline some literature models that can be used to address the generalized problems and present new models to couple the three systems. Finally, we show how the individual components (systems and coupling models) can be integrated to formulate a single simultaneous reactor, separation, and heat exchanger network synthesis.

97 MATHEMATICS AND COMPUTING↗

Computational Analysis of Cryogenic Flow Through a Control Valve

The initial efforts to develop the capability to model valves used in rocket engine component testing at Stennis Space Center are documented. An axisymmetric model of a control valve with LN2 as the working fluid was developed. The goal was to predict the effect of change in the plug/sear region of the valve prior to testing. The valve flow coefficient was predicted for a range of plug positions. Verification of the calculations was carried out to quantify the uncertainty in the numerical answer. The modeled results compared well qualitatively to experimental trends. Additionally, insights into the flow processes in the valve were obtained. Benefits from the verification process included the ability to use coarser grids and insight into ways to reduce computational time by using double precision accuracy and non-integer grid ratios. Future valve modeling activities will include shape optimization of the valve/seat region and dynamic grid modeling.

Danes, Russell↗

The inhibiting bisection problem.

Given a graph where each vertex is assigned a generation or consumption volume, we try to bisect the graph so that each part has a significant generation/consumption mismatch, and the cutsize of the bisection is small. Our motivation comes from the vulnerability analysis of distribution systems such as the electric power system. We show that the constrained version of the problem, where we place either the cutsize or the mismatch significance as a constraint and optimize the other, is NP-complete, and provide an integer programming formulation. We also propose an alternative relaxed formulation, which can trade-off between the two objectives and show that the alternative formulation of the problem can be solved in polynomial time by a maximum flow solver. Our experiments with benchmark electric power systems validate the effectiveness of our methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Placement and Sizing of Inverter-Based Renewable Systems in Multi-Phase Distribution Networks

This study develops a tractable formulation for optimal placement and sizing of inverter-based renewable systems in multi-phase distribution networks. The goal of the formulation is to minimize the cost of inverter installation, average power import, and average distributed generation curtailment. Threephase and single-phase inverter models are presented that preserve the underlying mappings between renewable uncertainty to power injection. The uncertainty of distributed generators (DGs) and loads are characterized by a finite set of scenarios. Linear multi-phase power flow approximations are used in conjunction with scenario reduction techniques to arrive at a tractable twostage stochastic formulation for optimal DG placement and sizing. First-stage decisions are locations for DG deployment and capacity sizes, and second-stage decisions include DG real power curtailment, reactive power support, as well as feeder voltage profile. The resulting formulation is a mixed-integer second-order cone program and can be solved efficiently either by existing optimization solvers or by relaxing the binary variables to the [0,1] interval. Simulation studies on standard multi-phase IEEE test feeders promise that optimal stochastic planning of DGs reduces costs during validation, compared to a scheme where uncertainty is only represented by its average value.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An optimization framework for workplace charging strategies

The workplace charging (WPC) has been recently recognized as the most important secondary charging point next to residential charging for plug-in electric vehicles (PEVs). The current WPC practice is spontaneous and grants every PEV a designated charger, which may not be practical or economic when there are a large number of PEVs present at workplace. This study is the first research undertaken that develops an optimization framework for WPC strategies to satisfy all charging demand while explicitly addressing different eligible levels of charging technology and employees’ demographic distributions. The optimization model is to minimize the lifetime cost of equipment, installations, and operations, and is formulated as an integer program. We demonstrate the applicability of the model using numerical examples based on national average data. The results indicate that the proposed optimization model can reduce the total cost of running a WPC system by up to 70% compared to the current practice. The WPC strategies are sensitive to the time windows and installation costs, and dominated by the PEV population size. The WPC has also been identified as an alternative sustainable transportation program to the public transit subsidy programs for both economic and environmental advantages.

Optimization↗

Decomposition of Large Scale Semantic Graphsvia an Efficient Communities Algorithm

Semantic graphs have become key components in analyzing complex systems such as the Internet, or biological and social networks. These types of graphs generally consist of sparsely connected clusters or 'communities' whose nodes are more densely connected to each other than to other nodes in the graph. The identification of these communities is invaluable in facilitating the visualization, understanding, and analysis of large graphs by producing subgraphs of related data whose interrelationships can be readily characterized. Unfortunately, the ability of LLNL to effectively analyze the terabytes of multisource data at its disposal has remained elusive, since existing decomposition algorithms become computationally prohibitive for graphs of this size. We have addressed this limitation by developing more efficient algorithms for discerning community structure that can effectively process massive graphs. Current algorithms for detecting community structure, such as the high quality algorithm developed by Girvan and Newman [1], are only capable of processing relatively small graphs. The cubic complexity of Girvan and Newman, for example, makes it impractical for graphs with more than approximately 10{sup 4} nodes. Our goal for this project was to develop methodologies and corresponding algorithms capable of effectively processing graphs with up to 10{sup 9} nodes. From a practical standpoint, we expect the developed scalable algorithms to help resolve a variety of operational issues associated with the productive use of semantic graphs at LLNL. During FY07, we completed a graph clustering implementation that leverages a dynamic graph transformation to more efficiently decompose large graphs. In essence, our approach dynamically transforms the graph (or subgraphs) into a tree structure consisting of biconnected components interconnected by bridge links. This isomorphism allows us to compute edge betweenness, the chief source of inefficiency in Girvan and Newman's decomposition algorithm, much more efficiently, leading to significantly reduced computation time. Test runs on a desktop computer have shown reductions of up to 89%. Our focus this year has been on the implementation of parallel graph clustering on one of LLNL's supercomputers. In order to achieve efficiency in parallel computing, we have exploited the fact that large semantic graphs tend to be sparse, comprising loosely connected dense node clusters. When implemented on distributed memory computers, our approach performed well on several large graphs with up to one billion nodes, as shown in Table 2. The rightmost column of Table 2 contains the associated Newman's modularity [1], a metric that is widely used to assess the quality of community structure. Existing algorithms produce results that merely approximate the optimal solution, i.e., maximum modularity. We have developed a verification tool for decomposition algorithms, based upon a novel integer linear programming (ILP) approach, that computes an exact solution. We have used this ILP methodology to find the maximum modularity and corresponding optimal community structure for several well-studied graphs in the literature (e.g., Figure 1) [3]. The above approaches assume that modularity is the best measure of quality for community structure. In an effort to enhance this quality metric, we have also generalized Newman's modularity based upon an insightful random walk interpretation that allows us to vary the scope of the metric. Generalized modularity has enabled us to develop new, more flexible versions of our algorithms. In developing these methodologies, we have made several contributions to both graph theoretic algorithms and software engineering. We have written two research papers for refereed publication [3-4] and are working on another one [5]. In addition, we have presented our research findings at three academic and professional conferences.

99 GENERAL AND MISCELLANEOUS↗

Quantum Annealing for Prime Factorization

We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses O (log 2 ( N )) binary variables (qubits) for finding the factors of an integer N. We present how to factorize 15, 143, 59989, and 376289 using 4, 12, 59, and 94 logical qubits, respectively. This method was tested using the D-Wave 2000Q for finding an embedding and determining the prime factors for a given composite number. The method is general and could be used to factor larger integers as the number of available qubits increases, or combined with other ad hoc methods to achieve better performances for specific numbers.

97 MATHEMATICS AND COMPUTING↗

A systems engineering framework for the optimization of food supply chains under circular economy considerations

The current linear “take-make-waste-extractive” model leads to the depletion of natural resources and environmental degradation. Circular Economy (CE) aims to address these impacts by building supply chains that are restorative, regenerative, and environmentally benign. This can be achieved through the re-utilization of products and materials, the extensive usage of renewable energy sources, and ultimately by closing any open material loops. Such a transition towards environmental, economic and social advancements requires analytical tools for quantitative evaluation of the alternative pathways. Here, in this work, we present a novel CE system engineering framework and decision-making tool for the modeling and optimization of food supply chains. First, the alternative pathways for the production of the desired product and the valorization of wastes and by-products are identified. Then, a Resource-Task-Network representation that captures all these pathways is utilized, based on which a mixed-integer linear programming model is developed. This approach allows the holistic modeling and optimization of the entire food supply chain, taking into account any of its special characteristics, potential constraints as well as different objectives. Considering that typically CE introduces multiple, often conflicting objectives, we deploy here a multi-objective optimization strategy for trade-off analysis. A representative case study for the supply chain of coffee is discussed, illustrating the steps and the applicability of the framework. Single and multi-objective optimization formulations under five different coffee-product demand scenarios are presented. The production of instant coffee as the only final product is shown to be the least energy and environmental efficient scenario. On the contrary, the production solely of whole beans sets a hypothetical upper bound on the optimal energy and environmental utilization. In both problems presented, the amount of energy generated is significant due to the utilization of waste generated for the production of excess energy.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Optimal automatic reaction and species elimination in kinetic mechanisms

A known challenge for the simulation of reacting flow systems is that detailed chemical mechanisms contain hundreds to thousands of species and thousands of reactions, leading to high CPU requirements despite the use of state-of-the-art solvers. For specific conditions of interest (temperature, pressure, and composition), smaller mechanisms can predict the chemistry relatively accurately. One possibility for obtaining such mechanisms is species elimination from a detailed mechanism. Here, an automatic method for kinetic model reduction by simultaneous reaction and species elimination is proposed, based on an integer linear program (ILP) formulation. The solution of the ILP is an optimally reduced kinetic mechanism that reproduces the predictions of a reference mechanism within prespecified tolerances for finitely many reference points in the state space. The method is applied to generate optimally reduced models for isobaric, adiabatic homogeneous combustion. Case studies are presented for the combustion of n-heptane. Comparisons between the full and reduced models are shown and the tradeoff between species and reaction elimination is discussed. Tolerances in the ILP formulation control the error introduced by the model reduction. For increasing acceptable error, more species and/or reactions are eliminated. A method of quantifying this tradeoff between approximation error and reduction achieved is proposed, based on multiobjective optimization, and demonstrated in a case study. The effect of variable initial conditions is investigated. The mechanisms generated achieve significant reduction in the CPU requirement and can accurately predict the trajectories of the state variables (species mass fractions and temperature), as well as other metrics of interest, such as ignition time delay. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bidding strategy for microgrid in day-ahead market based on hybrid stochastic/robust optimization

In this paper, we propose an optimal bidding strategy in the day-ahead market of a microgrid consisting of intermittent distributed generation (DG), storage, dispatchable DG and price responsive loads. The microgrid coordinates the energy consumption or production of its components and trades electricity in both the day-ahead and real-time markets to minimize its operating cost as a single entity. The bidding problem is challenging due to a variety of uncertainties, including power output of intermittent DG, load variation, day-ahead and real-time market prices. A hybrid stochastic/robust optimization model is proposed to minimize the expected net cost, i.e., expected total cost of operation minus total benefit of demand. This formulation can be solved by mixed integer linear programming. The uncertain output of intermittent DG and day-ahead market price are modeled via scenarios based on forecast results, while a robust optimization is proposed to limit the unbalanced power in real-time market taking account of the uncertainty of real-time market price. Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator, a battery and a responsive load show the advantage of stochastic optimization in addition to robust optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗