Search NASA⌕ Search

SEARCH · Search NASA

Results for “integer”

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

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

At least 937 records · Page 52

Optimization of battery swapping infrastructure for e-commerce drone delivery

Drone delivery is widely-researched to alter the current e-commerce delivery convention for providing short delivery lead times. Yet, flight range of drones, constrained by the available battery technology, sets a milestone toward realizing the sole-drone delivery. To tackle with the flight range limitation, locating automated battery swapping machines (ABSM) have been proposed and a few studies modeled the problem. Using the ABSMs, drones can be loaded with fully-charged batteries along the route to a demand location. Here, we introduce a mixed-integer nonlinear program to model the problem. The objective of the program is to optimally select ABSM locations, determine the delivery-mode choices (drone-only, truck-only, and mixed delivery) of demand locations, find drone delivery routes, and approximate the baseline requirements for the number of drones and batteries needed. The program minimizes the overall delivery system costs including: ABSM, delivery, drone ownership, battery inventory, and service congestion. A cutting-plane method is developed to find exact solutions in finite iterations. Computational experiments showed that the method quickly yields the optimal solution to instances with less than 60 ABSM candidates and 20 demand locations. A case study shows that the optimal drone delivery infrastructure can save almost 20% cost compared to the conventional truck-only delivery. Sensitivity analyses were conducted to reveal the impact of key parameters in the decision-making and found that a decrease in the ABSM and drone costs highly affect the system cost.

25 ENERGY STORAGE↗

Optimal response to attacks on the open science grids.

Cybersecurity is a growing concern, especially in open grids, where attack propagation is easy because of prevalent collaborations among thousands of users and hundreds of institutions. The collaboration rules that typically govern large science experiments as well as social networks of scientists span across the institutional security boundaries. A common concern is that the increased openness may allow malicious attackers to spread more readily around the grid. We consider how to optimally respond to attacks in open grid environments. To show how and why attacks spread more readily around the grid, we first discuss how collaborations manifest themselves in the grids and form the collaboration network graph, and how this collaboration network graph affects the security threat levels of grid participants. We present two mixed-integer program (MIP) models to find the optimal response to attacks in open grid environments, and also calculate the threat level associated with each grid participant. Given an attack scenario, our optimal response model aims to minimize the threat levels at unaffected participants while maximizing the uninterrupted scientific production (continuing collaborations). By adopting some of the collaboration rules (e.g., suspending a collaboration or shutting down a site), the model finds optimal response to subvert an attack scenario.

99 GENERAL AND MISCELLANEOUS↗

An efficient MILP framework for integrating nonlinear process dynamics and control in optimal production scheduling calculations

The emphasis currently placed on enterprise-wide decision making and optimization has led to an increased need for methods of integrating nonlinear process dynamics and control information in scheduling calculations. The inevitable high dimensionality and nonlinearity of first-principles dynamic process models makes incorporating them in scheduling calculations challenging. In this work, we describe a general framework for deriving data-driven surrogate models of the closed-loop process dynamics. Focusing on Hammerstein–Wiener and finite step response (FSR) model forms, we show that these models can be (exactly) linearized and embedded in production scheduling calculations. The resulting scheduling problems are mixed-integer linear programs with a special structure, which we exploit in a novel and efficient solution strategy. A polymerization reactor case study is utilized to demonstrate the merits of this method. Finally, our framework compares favorably to existing approaches that embed dynamics in scheduling calculations, showing considerable reductions in computational effort.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A scalable stochastic programming approach for the design of flexible systems

We study the problem of designing systems in order to minimize cost while meeting a given flexibility target. Flexibility is attained by enforcing a joint chance constraint, which ensures that the system will exhibit feasible operation with a given target probability level. Unfortunately, joint chance constraints are complicated mathematical objects that often need to be reformulated using mixed-integer programming (MIP) techniques. In this work, we cast the design problem as a conflict resolution problem that seeks to minimize cost while maximizing flexibility. We propose a purely continuous relaxation of this problem that provides a significantly more scalable approach relative to MIP methods and show that the formulation delivers solutions that closely approximate the Pareto set of the original joint chance-constrained problem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers.

97 MATHEMATICS AND COMPUTING↗

Natural gas maximal load delivery for multi-contingency analysis

An increasing dependence on natural gas has amplified existing vulnerabilities to the power grid, including disruptions to gas transmission networks from natural and man-made disasters. To address the operational challenges arising from these disruptions, we, in this study, consider the problem of estimating the steady-state operating capacity of a damaged gas pipeline network while ensuring the maximal delivery of load. Specifically, we formulate the mixed-integer nonconvex maximal load delivery (MLD) problem, which proves difficult to solve on large-scale networks. To address this challenge, we present a relaxation of the MLD problem and use it to determine bounds on the transport capacity of a gas pipeline system. A rigorous computational evaluation over network models ranging in size from 11 to 4,197 junctions shows that the relaxation-based method is suitable for analyzing the impacts of multi-contingency network disruptions, often converging to the optimal solution of the relaxation in less than ten seconds.

03 NATURAL GAS↗

A spatial superstructure approach to the optimal design of modular processes and supply chains

Modularity is a design principle that aims to provide flexibility for spatio-temporal assembly/disassembly and reconfiguration of systems. This design principle can be applied to multiscale (hierarchical) manufacturing systems that connect units, processes, facilities, and entire supply chains. Designing modular systems is challenging because of the need to capture spatial interdependencies that arise between system components due to product exchange/transport between components and due to product transformation in such components. In this work, we propose an optimization framework to facilitate the design of modular manufacturing systems. Central to our approach is the concept of a spatial superstructure, which is a graph that captures all possible system configurations and interdependencies between components. The spatial superstructure is a generalization of the notion of a superstructure and of a p-graph used in process design, in that it encodes spatial (geographical) context of the system components. Here, we show that this generalization facilitates the simultaneous design and analysis of processes, facilities, and of supply chains. Our framework aims to select the system topology from the spatial superstructure that minimizes design cost and that maximizes design modularity. We show that this design problem can be cast as a mixed-integer, multi-objective optimization formulation. We demonstrate these capabilities using a case study arising in the design of a plastic waste upcycling supply chain.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Disjunctive optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems

This paper proposes a new optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems. The model optimizes both investment decisions (e.g., size, location, and time to install, retire and decommission facilities) and operation decisions (e.g., on/off status, operating capacity, and expected power output). It is also able to optimize reserve systems (or backup systems), as well as the main systems, to improve power systems reliability. An impact of operational strategies of generators (i.e., participating in electricity production vs. remaining as idle units during operation) on power systems reliability is considered. Probability of equipment failures and capacity failure states are used to rigorously estimate the power systems reliability depending on design and operation strategies. The optimization model is formulated with Generalized Disjunctive Programming (GDP), which is reformulated as a mixed-integer linear programming (MILP) model using the Hull relaxation. Two reliability-related penalties, such as downtime penalty and unmet demand penalty, are included in the objective function to maximize reliability while minimizing the total net present cost. Furthermore, a bilevel decomposition with tailored cuts is developed to reduce computational times of the multi-scale optimization model. The effectiveness of the proposed model is shown by comparing the results with the results obtained from the expansion planning models that do not explicitly consider reliability. In conclusion, we also show that the proposed bilevel decomposition is computationally efficient for solving large scale problems through 5-years and 10-years planning case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Measure this, not that: Optimizing the cost and model-based information content of measurements

Model-based design of experiments (MBDoE) is a powerful framework for selecting and calibrating science-based mathematical models from data. Here, this work extends popular MBDoE workflows by proposing a convex mixed integer (non)linear programming (MINLP) to optimize the selection of measurements. The solver MindtPy is modified to support calculating the D-optimality objective and its gradient via an external package, scipy, using the grey-box module in Pyomo. The new approach is demonstrated in two case studies: estimating highly correlated kinetics from a batch reactor and estimating transport parameters in a large-scale rotary packed bed for CO 2 capture. Both case studies show how examining the Pareto optimal trade-offs between information content measured by A- and D-optimality versus measurement budget offers practical guidance for selecting measurements for scientific experiments.

97 MATHEMATICS AND COMPUTING↗

A Cheeger inequality for size-specific conductance

The μ-conductance measure proposed by Lovász and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume smaller than a μ fraction of the whole graph. Using μ-conductance enables us to study the network structures in new ways. Here, in this manuscript, we study a modified spectral cut for μ-conductance that is a natural relaxation of the integer program of μ-conductance and show that the optimum of this program has a two-sided Cheeger inequality with μ-conductance.

Graph theory↗

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↗

Stochastic optimization of cellulosic biofuel supply chain incorporating feedstock yield uncertainty

The global goal to reduce dependence on fossil fuels and to mitigate greenhouse gas emissions has resulted in research focused on environment friendly and socio-economically sustainable renewable energy sources. However, commercial production of bio-energy is constrained by biomass supply uncertainty and associated costs. This study presents an integrated approach to determining the optimal biofuel supply chain considering biomass yield uncertainty. A two-stage stochastic mixed integer linear programming is utilized to minimize the expected system cost while incorporating yield uncertainty in the strategic level decisions related to biomass production and biorefinery investment. Applicability of the stochastic model is illustrated through a case study of switchgrass-based biofuel in west Tennessee.

09 BIOMASS FUELS↗

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints

A novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems is proposed and it considers a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen’s inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improves upon the standard Benders’ algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen’s inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. But, the decomposition phase is required to attain optimality gaps. Moreover, use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately.

97 MATHEMATICS AND COMPUTING↗

Approximating a linear multiplicative objective in watershed management optimization

Implementing management practices in a cost-efficient manner is critical for regional efforts to reduce the amount of pollutants entering the Chesapeake Bay. We study the problem of selecting a subset of practices that minimizes pollutant load—subject to budgetary and environmental constraints—as simulated in a widely used regulatory watershed model. Mimicking the computation of pollutant load in the regulatory model, we formulate this problem as a continuous optimization model with a linear multiplicative objective function and linear constraints. To lay the groundwork for incorporating additional stakeholder requirements in the future, especially those that would require integer variables, we present and study a continuous linear optimization model that approximates the nonlinear model. The linear model, which requires an exponential number of variables, arises naturally as an alternative model for the same underlying physical process. We examine the theoretical behavior of these optimization models and investigate restrictions of the linear model to handle its large number of variables. Through extensive computational tests on real and randomly generated instances, we demonstrate that the linear model and its restrictions provide optimal solutions close to those of the nonlinear model in practice, despite poor approximation properties in the worst case. We conclude that the linear model—together with our approach to handling its large number of variables—provides a viable framework from which to extend the optimization model to better meet the needs of the Chesapeake Bay watershed management stakeholders.

54 ENVIRONMENTAL SCIENCES↗

A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market

Uncertainties arising from complicated natural and market environments pose great challenges for the efficient operation of cascaded hydroelectric systems. To overcome these challenges, this paper studies the day-ahead scheduling of cascaded hydroelectric systems in a restructured electricity market with the presence of uncertainties in electricity price and natural water inflow. To properly model the uncertainty, we consider the unique characteristics of these two types of uncertainties and capture them via the uncertainty set and stochastic scenarios, respectively. Further, a hybrid robust-stochastic optimization model is developed to simultaneously hedge against these two types of uncertainties, which is formulated as a large-scale non-convex optimization problem with mixed integer recourse. After introducing linearization of nonlinear terms, a tailored hybrid decomposition scheme combining Lagrangian relaxation and Dantzig-Wolfe decomposition is adopted to achieve efficient computation of the proposed model. Two real-world cases are conducted to demonstrate the capability and characteristics of the proposed model and algorithms.

13 HYDRO ENERGY↗

Electric vehicle supply equipment location and capacity allocation for fixed-route networks

Electric vehicle (EV) supply equipment location and allocation (EVSELCA) problems for freight vehicles are becoming more important because of the trending electrification shift. Some previous works address EV charger location and vehicle routing problems simultaneously by generating vehicle routes from scratch. Although such routes can be efficient, introducing new routes may violate practical constraints, such as drive schedules, and satisfying electrification requirements can require dramatically altering existing routes. To address the challenges in the prevailing adoption scheme, we approach the problem from a fixed -route perspective. We develop a mixed -integer linear program, a clustering approach, and a metaheuristic solution method using a genetic algorithm (GA) to solve the EVSELCA problem. The clustering approach simplifies the problem by grouping customers into clusters, while the GA generates solutions that are shown to be nearly optimal for small problem cases. A case study examines how charger costs, energy costs, the value of time (VOT), and battery capacity impact the cost of the EVSELCA. Charger equipment costs were found to be the most significant component in the objective function, leading to a substantial reduction in cost when decreased. VOT costs exhibited a significant decrease with rising energy costs. Further, an increase in VOT resulted in a notable rise in the number of fast chargers. Longer EV ranges decrease total costs up to a certain point, beyond which the decrease in total costs is negligible.

33 ADVANCED PROPULSION SYSTEMS↗