Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Program 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

Multi-scale topology optimization of multi-material structures with controllable geometric complexity — Applications to heat transfer problems

This study presents a topology optimization method to design assemblies of periodic cellular materials with controllable geometric complexity. The framework is based on a novel multi-scale and multi-material design model in which the structure, the layout of the material subdomains, and their micro-structures are optimized concurrently. To allow a tight control over its geometrical complexity, the layout at the macro-scale is described by level-set fields, parameterized by geometric primitives. The micro-scale geometry is represented through a density approach. A nonlinear programming algorithm drives the optimization process using design sensitivities computed by the discrete adjoint method. The proposed design framework is studied with heat transfer problems. Practical design problems, such as a heat sink and a thermal storage unit with phase change are discussed. The macro-scale analysis model relies on a generalized transient diffusion equation. At the micro-scale, homogenization is used to compute equivalent material properties. The numerical examples in this study show that the optimized multi-scale multi-material layouts outperform the corresponding mono-scale structures while maintaining geometric simplicity at the macro-scale level.

42 ENGINEERING↗

Technique for Optimization Design of the Flow Path of a Main Oil Pump

A method for the design of the flow path of a main oil pump by means of which the geometry of the flow path may be optimized to achieve maximum energy efficiency of the pump is given. The method is based on mathematical simulation of the hydrodynamic processes that occur in the flow path of a pump using the ANSYS system of finite-element analysis combined with methods of nonlinear programming.

42 ENGINEERING↗

Development and Implementation of an Optimization Model for Hydropower and Total Dissolved Gas in the Mid-Columbia River System

Managing energy, water, and environmental priorities and constraints within a cascade hydropower system is a challenging multiobjective optimization effort that requires advanced modeling and forecasting tools. Within the mid-Columbia River system, there is currently a lack of specific solutions for predicting how coordinated operational decisions can mitigate the impacts of total dissolved gas (TDG) supersaturation while satisfying multiple additional policy and hydropower generation objectives. In this study, a reduced-order TDG uptake equation is developed that predicts tailrace TDG at seven hydropower facilities on the mid-Columbia River. The equation is incorporated into a general multiobjective river, reservoir, and hydropower optimization tool as a prioritized operating goal within a broader set of system-level objectives and constraints. A test case is presented to assess the response of TDG and hydropower generation when TDG supersaturation is optimized to remain under state water-quality standards. Satisfaction of TDG as an operating goal is highly dependent on whether constraints that limit TDG uptake are implemented at a higher priority than generation requests. According to the model, an opportunity exists to reduce TDG supersaturation and meet hydropower generation requirements by shifting spillway flows to different time periods. In conclusion, a coordinated effort between all project owners is required to implement systemwide optimized solutions that satisfy the operating policies of all stakeholders.

13 HYDRO ENERGY↗

Optimization of harvest and logistics for multiple lignocellulosic biomass feedstocks in the northeastern United States

A mixed-integer linear programming model was developed to optimize the multiple biomass feedstock supply chains, including feedstock establishment, harvest, storage, transportation, and preprocessing. The model was applied for analyses of multiple biomass feedstocks at county level for 13 states in the northeastern United States. In the base case with a demand of 180,000 dry Mg/year of biomass, the delivered costs ranged from $\$67.90$ to $\$86.97$ per dry Mg with an average of $\$79.58$ /dry Mg. The biomass delivered costs by county were from $\$67.90$ to 150.81 per dry Mg across the northeastern U.S. Considered the entire study area, the delivered cost averaged $\$85.30$ /dry Mg for forest residues, $\$84.47$ /dry Mg for hybrid willow, $\$99.68$ for switchgrass and $\$97.87$ per dry Mg for Miscanthus. Seventy seven out of 387 counties could be able to deliver biomass at $84 per dry Mg or less a target set by US DOE by 2022. A sensitivity analysis was also conducted to evaluate the effects of feedstock availability, feedstock price, moisture content, procurement radius, and facility demand on the delivered cost. Lastly, our results showed that procurement radius, facility capacity, and forest residue availability were the most sensitive factors affecting the biomass delivered costs.

09 BIOMASS FUELS↗

Network Optimization of the Electrosynthesis of Chemicals from CO2

Carbon dioxide electroreduction (ECO2R) is gaining attention due to its capacity to mitigate CO2 emissions while using electricity that would otherwise be curtailed. Its foreseeable industrial implementation requires of holistic methods to assess the technological and economic performance of ECO2R processes and integrate them in current chemical supply chains and power systems. Here, we combine techno-economic assessment and mathematical programming to find the optimal paths to electroreduce CO2 into valuable chemicals under variable electricity prices. The proposed approach is tested with a case study addressing the CO2 capture from flue gas or direct air and its electricity-powered reduction into carbon monoxide, formic acid or multi-carbon compounds. The results obtained demonstrate the ability of the framework to build ECO2R networks and provide operation profiles that respond to fluctuating electricity prices.

carbon dioxide↗

Optimal Electric Vehicle Charging and Discharging Strategies Under DER Compensation Programs: Preprint

The adoption of electric vehicles (EVs) is becoming increasingly popular because of environmental concerns, the greater availability of models, and increased cost-competitiveness with gas vehicles. Because EVs have both charging and discharging capabilities, they provide great potential to help electric utilities with grid operation. When the grid demand is high, EVs can discharge to the grid to reduce the peak load, and vice versa; therefore, electric utilities have designed different policies to encourage EV charging station operators to charge or discharge at certain time periods. The New York State Public Service Commission established the Value of Distributed Energy Resources (VDER), or the Value Stack, to compensate for energy created by distributed energy resources, including EVs. This paper presents an optimization-based approach to identify the "golden hours" and "golden spots," i.e., the effective time periods and geographic locations for EV charging station operators to charge or discharge under the VDER program that can provide them the highest benefit. The proposed methodology can be applied to other compensation mechanisms and distribution systems as well. By working with industry partner NineDot Energy, realistic charging station information is used in this study, and the proposed approach is tested on a distribution feeder. The results from this study can help electric utilities and EV charging station operators determine the ideal charging/discharging time and the ideal locations for the charging station(s) in their distribution systems to achieve maximized benefit.

electric vehicle↗

Resiliency of Distribution Systems Incorporating Asynchronous Information for System Restoration

Resiliency of distribution systems under extreme operating conditions is critical, especially when the utility is not available. With the large-scale deployment of distributed resources, it becomes possible to restore critical loads with local non-utility resources. Distribution system operators (DSOs) need to determine the critical loads to be restored, considering limited resources and distribution facilities. Several studies on resiliency have been conducted for the restoration of distribution systems. However, the inherent asynchronous characteristic on the information availability has not been incorporated. With incomplete and asynchronous information, decisions may be made that result in underutilization of generation resources. In this paper, a new distribution system restoration approach is proposed, considering uncertain devices and associated asynchronous information. It uses a two-module architecture that efficiently optimizes restoration actions using a binary linear programming model and evaluates their feasibility with unbalanced optimal power flow. Networked microgrids are included in the model. The IEEE 123-node test feeder is used for validation. Results show that asynchronous messages may affect the restoration actions significantly and the impacts can be mitigated by the proposed decision support tool for the DSOs.

Bedoya, Juan C.↗

RTN-011: Rubin Observatory Plans for an Early Science Program

This document outlines Rubin Observatory's plans for a dedicated \emph{Early Science Program} to enable high-impact science prior to the first annual data release of the Legacy Survey of Space and Time (LSST). Components of the Early Science Program include releasing science-grade commissioning data products via a series of ``Data Previews,'' ramping up of the transient alert stream during commissioning, implementing a program of incremental template generation to augment alert production in the early phases of the survey, and the first LSST Data Release, DR1, based on the first 6 months of data from the LSST. A detailed breakdown of which data products can be expected when is provided. The Rubin Operations team is working closely with the science community to optimize the Early Science Program for the time-domain and solar system science achievable in the first year of operations. This is a living document; both it and the Early Science Program will continue to evolve over the course of commissioning and pre-operations in response to the state of the as-built system and to community guidance.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-E-I-76: Matching Primary and Scattered X-Ray Spectra for Use in Calculating the Diagnostic Radiation Index of Protection

Purpose: Lightweight lead-free or lead-composite protective garments exploit k-edge interactions to attenuate scattered X-rays. Manufacturers specify the protective value of garments in terms of lead equivalence at a single kVp. This is inadequate, as the protection provided by such garments varies with radiation quality in different use conditions. We present a method for matching scattered X-ray spectra to primary X-ray spectra. The resulting primary spectra can be used to measure penetration through protective garments, and such measurements can be weighted and summed to determine a Diagnostic Radiation Index for Protection (DRIP). Methods: Scattered X-ray spectra from fluoroscopic procedures were modeled using Monte Carlo techniques in MCNP-X 2.7. Data on imaging geometry, operator position, patient size, and primary beam spectra were gathered from clinical fluoroscopy procedures. These data were used to generate scattered X-ray spectra resulting from procedural conditions. Technical factors, including kV and added filtration, that yielded primary X-ray spectra that optimally matched the generated scattered X-ray spectra were identified through numerical optimization using a sequential quadratic programming (SQP) algorithm. Results: The primary spectra generated with shape functions matched the relative flux in each bin of the scattered spectra within 5%, and half and quarter-value layers matched within 0.1%. The DRIP for protective garments can be determined by measuring the penetration through protective garments using the matched primary spectra, then calculating a weighted average according to the expected clinical use of the garment. The matched primary spectra are specified in terms of first and second half-value layers in aluminum and acrylic. Conclusion: Lead equivalence is inadequate for completely specifying the protective value of garments. Measuring penetration through a garment using full scatter conditions is very difficult. The primary spectra determined in this work allow for practical primary penetration measurements to be made with equipment readily available to clinical medical physicists.

61 RADIATION PROTECTION AND DOSIMETRY↗

Performance portable ice-sheet modeling with MALI

High-resolution simulations of polar ice sheets play a crucial role in the ongoing effort to develop more accurate and reliable Earth system models for probabilistic sea-level projections. These simulations often require a massive amount of memory and computation from large supercomputing clusters to provide sufficient accuracy and resolution; therefore, it has become essential to ensure performance on these platforms. Many of today’s supercomputers contain a diverse set of computing architectures and require specific programming interfaces in order to obtain optimal efficiency. In an effort to avoid architecture-specific programming and maintain productivity across platforms, the ice-sheet modeling code known as MPAS-Albany Land Ice (MALI) uses high-level abstractions to integrate Trilinos libraries and the Kokkos programming model for performance portable code across a variety of different architectures. In this article, we analyze the performance portable features of MALI via a performance analysis on current CPU-based and GPU-based supercomputers. The analysis highlights not only the performance portable improvements made in finite element assembly and multigrid preconditioning within MALI with speedups between 1.26 and 1.82x across CPU and GPU architectures but also identifies the need to further improve performance in software coupling and preconditioning on GPUs. We perform a weak scalability study and show that simulations on GPU-based machines perform 1.24–1.92x faster when utilizing the GPUs. The best performance is found in finite element assembly, which achieved a speedup of up to 8.65x and a weak scaling efficiency of 82.6% with GPUs. We additionally describe an automated performance testing framework developed for this code base using a changepoint detection method. The framework is used to make actionable decisions about performance within MALI. We provide several concrete examples of scenarios in which the framework has identified performance regressions, improvements, and algorithm differences over the course of 2 years of development.

54 ENVIRONMENTAL SCIENCES↗

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗

Compiling Adiabatic Quantum Programs

We develop a non-cooperative game-theoretic model for the problem of graph minor-embedding to show that optimal compiling of adiabatic quantum programs in the sense of Nash equilibrium is possible.

Khan, Faisal Shah↗

An ILP based Algorithm for Optimal Customer Selection for Demand Response in SmartGrids

Demand Response (DR) events are initiated by utilities during peak demand periods to curtail consumption. They ensure system reliability and minimize the utility’s expenditure. Selection of the right customers and strategies is critical for a DR event. An effective DR scheduling algorithm minimizes the curtailment error which is the absolute difference between the achieved curtailment value and the target. State-of-the-art heuristics exist for customer selection, however their curtailment errors are unbounded and can be as high as 70%. In this work, we develop an Integer Linear Programming (ILP) formulation for optimally selecting customers and curtailment strategies that minimize the curtailment error during DR events in SmartGrids. We perform experiments on real world data obtained from the University of Southern California’s SmartGrid and show that our algorithm achieves near exact curtailment values with errors in the range of 10 -7 to 10 -5 , which are within the range of numerical errors. We compare our results against the state-of-the-art heuristic being deployed in practice in the USC SmartGrid. We show that for the same set of available customer strategy pairs our algorithm performs 103 to 107 times better in terms of the curtailment errors incurred.

97 MATHEMATICS AND COMPUTING↗

Computing single step operators of logic programming in radial basis function neural networks

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integration of graphical approaches into optimization-based design of multistage liquid extraction

We propose two optimization models for designing two liquid extraction systems: simple multistage liquid extractors and extractors with extract reflux. Both models are motivated by the concepts of the modified McCabe-Thiele graphical method for multistage extractor design. The operating and equilibrium curves in the McCabe-Thiele method are represented by material balances and piece-wise linearized thermodynamics properties. The use of piece-wise approximations improves computational tractability of both optimization models. In addition, we consider some extensions such as dilute systems, insoluble solvents, and non-ideal stages. In conclusion, the applicability of the proposed models is demonstrated with four illustrative examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

mpi-sppy: Optimization Under Uncertainty for Pyomo

We introduce a new Pyomo extension for optimization under uncertainty, mpi-sppy. This extension allows for the mixing of, and sharing of information between, various algorithmic approaches for optimization under uncertainty. We will discuss the underlying architecture and assess the performance and scalability of mpi-sppy on various systems, including HPC clusters.

27 ARPA - Advanced Research Projects Agency-Energy↗

Robust trajectory-constrained frequency control for microgrids considering model linearization error

Grid supportive modes integrated within inverter-based resources can improve the frequency response of renewable-rich microgrids. The synthesis of grid supportive modes to guarantee frequency trajectory constraints under a predefined disturbance set is challenging but essential. To tackle this challenge, a numerical optimal control (NOC)-based control synthesis methodology is proposed. Without loss of generality, a wind-diesel fed microgrid is studied, where we aim to design grid supportive functions in the wind turbine. In the control design, linearized models are used, and the linearization-induced errors are quantitatively analyzed by reachability and interval arithmetics and represented in the form of interval uncertainties. Then, the NOC problem can be formulated into a robust mixed-integer linear program. The control structure is strategically configured into two levels to realize online deployment. The proposed control is verified on the modified 33-node microgrid with a full-order three-phase nonlinear model in Simulink. In conclusion, the simulation results show the effectiveness of the proposed control paradigm and the necessity of considering linearization-induced uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗