Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 811 records · Page 45

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗

Data-driven simultaneous process optimization and adsorbent selection for vacuum pressure swing adsorption

Technologies for post-combustion carbon capture are essential for the reduction of greenhouse gas emissions to the atmosphere. However, they are still associated with high costs and energy consumption. Intensified processes for carbon capture have the potential to overcome these challenges due to their higher efficiency, lower capital cost, and increased operational flexibility. Here, this work investigates simultaneous optimization of process conditions and adsorbent selection for a modular Vacuum Pressure-Swing Adsorption system designed for CO 2 capture. Both surrogate-based Nonlinear Programming and Mixed-Integer Nonlinear Programming approaches are applied and compared in terms of computational efficiency and solution accuracy. Moreover, process performance results are examined by applying several data analytics techniques to gain insights into the material-process correlations. Data-driven classifiers and neural networks can accurately predict whether a material is likely to satisfy purity, recovery, and energy constraints when operated at optimal process conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sustainable network design for multi-purpose pellet processing depots under biomass supply uncertainty

This work develops a two-stage stochastic mixed-integer programming model to manage multi- purpose pellet processing depots under feedstock supply uncertainty. The proposed optimization model would help to minimize cost and to mitigate emissions from the supply chain network. We consider three alternative Biomass Processing and Densi cation Depot (BPDD) technologies; namely, conventional pellet processing, high moisture pellet processing, and ammonia ber expansion. These three technologies pre-process/pre-treat and densify different types of biomass into more highly densi ed intermediate products for different markets in order to improve movability and overall supply network performance in terms of costs and emissions. A hybrid decomposition algorithm was developed that combines sample average approximation with an enhanced Progressive Hedging (PH) algorithm to solve this challenging NP -hard problem. Some heuristics such as Rolling Horizon (RH) heuristic, variable xing technique were later applied to further enhance the PH algorithm. Mississippi and Alabama were selected as a testing ground and ArcGIS was employed to visualize and validate the modeling results. The results of the analysis reveal promising insights that could lead to recommendations to help decision makers achieve a more cost-effective environmentally-friendly supply chain network.

09 BIOMASS FUELS↗

An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling

Energy-aware scheduling in manufacturing operations with time-of-use electricity tariffs is a challenging problem. Sustainable manufacturing is gaining significant momentum: companies are not only improving their product quality, but also optimizing the production processes to improve energy consumption (i.e., minimizing energy cost) in order to manage environmental challenges which contribute to global climate change. The purpose of this paper is to study a preemptive scheduling problem on a single-machine to minimize the total completion time and total energy cost under time-of-use electricity tariffs, which is a mixed-integer multiobjective mathematical programming model. To solve these objectives, we develop several new holistic ant colony optimization algorithms. The proposed model is solved via several methods including weighted sum method (WSM) using CPLEX, and multiobjective ant colony optimization based on a dominance ranking (ACO-DR) or based on a dominance ranking procedure and crowding distance comparison (ACO-DRC) or based on a heuristic approach to obtain an approximate Pareto-front and also provide information on when to start and resume each job for any solution on the Pareto-front. We provide detailed experimental results evaluating the performance of the proposed algorithms. In a case study, we demonstrate how the results of the multiobjective model could be utilized in decision making using the multiobjective optimization on the basis of ratio analysis (MOORA) method. Furthermore, this proposed model and heuristics allows decision makers to operate in challenging-data enabled environments in industrial internet of things ecosystem, and assists in optimizing production planning to improve energy cost.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Reducing the computational burden of a microgrid energy management system

As renewable technology advances and decreases in cost, microgrids are becoming an appealing means of distributed generation both for isolated communities and integrated with existing electrical grid systems. Due to their small size, however, microgrids may have financial limitations which preclude them from using commercial software to optimize control of their assets. Open-source optimization solvers are a viable alternative, but increase computation time. This work expands on a rolling horizon optimization framework for economic dispatch within an existing residential microgrid located in Hoover, Alabama. The microgrid has an open-source solver requirement and a need for quick solution time on a rolling horizon as opposed to a day-ahead commitment. We present a method of reducing integer variables by relaxation which completes two goals: reduction in computation time for real-time operations, and reduction in daily operational cost for the microgrid. Seasonal data for load and photovoltaic (PV) power was also collected from the microgrid to facilitate simulation testing. Computation time was successfully reduced using multiple variations of the relaxation method, while obtaining solution quality with operational cost similar to or better than the original model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A gradient-based optimization approach for the detection of partially connected surfaces using vibration tests

The integrity of engineering structures is often compromised by embedded surfaces that result from incomplete bonding during the manufacturing process, or initiation of damage from fatigue or impact processes. Examples include delaminations in composite materials, incomplete weld bonds when joining two components, and internal crack planes that may form when a structure is damaged. In many cases the areas of the structure in question may not be easily accessible, thus precluding the direct assessment of structural integrity. In this paper, we present a gradient-based, partial differential equation (PDE)-constrained optimization approach for solving the inverse problem of interface detection in the context of steady-state dynamics. An objective function is defined that represents the difference between the model predictions of structural response at a set of spatial locations, and the experimentally measured responses. One of the contributions of our work is a novel representation of the design variables using a density field that takes values in the range [0, 1] and raised to an integer exponent that promotes solutions to be near the extrema of the range. The density field is combined with the penalty method for enforcing a zero gap condition and realizing partially bonded surfaces. Furthermore the use of the penalty method with a density field representation leads to objective functions that are continuously differentiable with respect to the unknown parameters, enabling the use of efficient gradient-based optimization algorithms. Numerical examples of delaminated plates are presented to demonstrate the feasibility of the approach.

42 ENGINEERING↗

In situ characterization of silver nanoparticle synthesis in maltodextrin supramolecular structures

In this study, the use of maltodextrin supramolecular structures (MD SMS) as a reducing agent and colloidal stabilizing agent for the synthesis of Ag nanoparticles (Ag NPs) identified three key points. First, the maltodextrin (MD) solutions are effective in the formation of well-dispersed Ag NPs utilizing alkaline solution conditions, with the resulting Ag NPs ranging in size from 5 to 50 nm diameter. Second, in situ characterization by Raman spectroscopy and small angle X-ray scattering (SAXS) are consistent with initial nucleation of Ag NPs within the MD SMS up to a critical size of ca. 1 nm, followed by a transition to more rapid growth by aggregation and fusion between MD SMS, similar to micelle aggregation reactions. Third, the stabilization of larger Ag NPs by adsorbed MD SMS is similar to hemi-micelle stabilization, and monomodal size distributions are proposed to relate to integer surface coverage of the Ag NPs. Conditions were identified for preparing Ag NPs with monomodal distributions centered at 30–35 nm Ag NPs.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

A numerical study of the diffusive-thermal instability of opposed nonpremixed tubular flames

The diffusive-thermal (D-T) instability of opposed nonpremixed tubular flames near extinction is investigated here using two-dimensional (2-D) direct numerical simulations together with the linear stability analysis. Two different initial conditions (IC), i.e. the perturbed IC and the C-shaped IC are adopted to elucidate the effects of small and large amplitude disturbances on the formation of flame cells, similar to conditions found in linear stability analysis and experiments, respectively. The characteristics of the D-T instability of tubular flames are identified by a critical Damköhler number, Da C , at which the D-T instability first occurs and the corresponding number of flame cells for three different tubular flames with different flame radii. It is found that Da C predicted through linear stability analysis shows good agreement with that obtained from the 2-D simulations performed with two different ICs. The flame cell number, N cell , from the 2-D simulations with the perturbed IC is also found to be equal to an integer close to the maximum wavenumber, k max , obtained from the linear stability analysis. However, N cell from the 2-D simulations with the C-shaped IC is smaller than k max and N cell found from the simulations with the perturbed IC. This is primarily because the strong reaction at the edges of the horseshoe-shaped cellular flame developed from the C-shaped IC is more likely to produce larger flame cells and reduce N cell . It is also found that for cases with the C-shaped IC, once the cellular instability occurs, the number of flame cells remains constant until global extinction occurs by incomplete reaction manifested by small Da. It is also verified through the displacement speed, S d , analysis that the two edges of the horseshoe-shaped cellular flame are stationary and therefore do not merge due to the diffusion–reaction balance at the edges. Moreover, large negative S d is observed at the local extinction points while small positive or negative S d features in the movement of flame cells as they adjust their location and size towards steady state.

42 ENGINEERING↗

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↗