Thermo-economic assessment and optimization of a hybrid triple effect absorption chiller and compressor
Not provided.
Energy & Fuels↗
SEARCH · Engineering Papers
Results for “optimization algorithms”
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.
A Transfer Learning Strategy for Improving the Data Efficiency of Deep Reinforcement Learning Control in Smart Buildings
Reinforcement learning (RL) is a powerful tool that has shown promising results in many domains such as robotics and game-playing. Because RL algorithms learn optimal control policies by continuously interacting with their environments, these algorithms require a lot of data to learn, which limits their application to a wide range of domains. For this reason, there is an immense need for improving the training and data efficiency of RL. Towards addressing this research gap, this paper proposes a transfer learning (TL) approach to improve the efficiency of the RL algorithms by reducing data need and, thus, reducing training time. To demonstrate the proposed approach, a knowledge transfer from a set of buildings to another building was conducted. The results show that the proposed TL approach is a promising method that can efficiently harness the information from similar RL tasks and reduce the data needs of RL algorithms.
Amasyali, Kadir↗
Precision Computations in Strongly Coupled Conformal Field Theories (Final Technical Report)
Conformal Field Theories (CFTs) are quantum field theories that are invariant under the conformal symmetry group (which includes translations and rotations, but also local rescalings of spacetime). They are building blocks of general quantum field theories, and appear in many areas of physics, including statistical physics, condensed matter physics, particle physics, and quantum gravity. Because of their extra symmetries, the mathematical structure of CFTs is tightly constrained, and this leads to the idea of the ``conformal bootstrap," which is to use these mathematical structures to constrain, and in some cases determine, CFT observables. A new numerical implementation of the conformal bootstrap idea appeared in 2008 with the work of Rattazzi, Rychkov, Tonni, and Vichi. Their observation was that certain bootstrap constraints (conformal symmetry and unitarity) could be combined to yield a convex optimization problem that constraints CFT data. By solving this convex optimization problem on a computer, one could obtain bounds on observables like critical exponents and operator product expansion (OPE) coefficients. Over the course of this award, the PI has improved numerical bootstrap techniques by optimizing known algorithms and finding new ones for performing the required convex optimization computations. The PI has applied these techniques to compute high-precision observables in several important strongly-coupled systems. The PI has also explored both analytical and numerical bootstrap methods for constraining the space of low energy effective field theories of quantum gravity, and developed new analytical techniques for CFT and QFT more broadly.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Placement Of Exciters And Sensors To Measure Vibrations
Report discusses use of simulated-annealing algorithm to place exciters and sensors of vibrations at nearly optimal positions in complicated structure. Because there are generally fewer exciters and sensors than degrees of freedom in structure, optimal-placement algorithm needed to maximize value of resulting incomplete set of measurements for verification of amplitudes and frequencies of previously-computed vibrational modes.
Salama, Moktar A.↗
Optimal trajectories for an aerospace plane. Part 2: Data, tables, and graphs
Data, tables, and graphs relative to the optimal trajectories for an aerospace plane are presented. A single-stage-to-orbit (SSTO) configuration is considered, and the transition from low supersonic speeds to orbital speeds is studied for a single aerodynamic model (GHAME) and three engine models. Four optimization problems are solved using the sequential gradient-restoration algorithm for optimal control problems: (1) minimization of the weight of fuel consumed; (2) minimization of the peak dynamic pressure; (3) minimization of the peak heating rate; and (4) minimization of the peak tangential acceleration. The above optimization studies are carried out for different combinations of constraints, specifically: initial path inclination that is either free or given; dynamic pressure that is either free or bounded; and tangential acceleration that is either free or bounded.
Miele, Angelo↗
Optimal trajectories for an aerospace plane. Part 1: Formulation, results, and analysis
The optimization of the trajectories of an aerospace plane is discussed. This is a hypervelocity vehicle capable of achieving orbital speed, while taking off horizontally. The vehicle is propelled by four types of engines: turbojet engines for flight at subsonic speeds/low supersonic speeds; ramjet engines for flight at moderate supersonic speeds/low hypersonic speeds; scramjet engines for flight at hypersonic speeds; and rocket engines for flight at near-orbital speeds. A single-stage-to-orbit (SSTO) configuration is considered, and the transition from low supersonic speeds to orbital speeds is studied under the following assumptions: the turbojet portion of the trajectory has been completed; the aerospace plane is controlled via the angle of attack and the power setting; the aerodynamic model is the generic hypersonic aerodynamics model example (GHAME). Concerning the engine model, three options are considered: (EM1), a ramjet/scramjet combination in which the scramjet specific impulse tends to a nearly-constant value at large Mach numbers; (EM2), a ramjet/scramjet combination in which the scramjet specific impulse decreases monotonically at large Mach numbers; and (EM3), a ramjet/scramjet/rocket combination in which, owing to stagnation temperature limitations, the scramjet operates only at M approx. less than 15; at higher Mach numbers, the scramjet is shut off and the aerospace plane is driven only by the rocket engines. Under the above assumptions, four optimization problems are solved using the sequential gradient-restoration algorithm for optimal control problems: (P1) minimization of the weight of fuel consumed; (P2) minimization of the peak dynamic pressure; (P3) minimization of the peak heating rate; and (P4) minimization of the peak tangential acceleration.
Miele, Angelo↗
An adaptive precision gradient method for optimal control.
This paper presents a gradient algorithm for unconstrained optimal control problems. The algorithm is stated in terms of numerical integration formulas, the precision of which is controlled adaptively by a test that ensures convergence. Empirical results show that this algorithm is considerably faster than its fixed precision counterpart.-
Klessig, R.↗
Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems
VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [32], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Lastly, support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.
97 MATHEMATICS AND COMPUTING↗
Evaluating scheduling algorithms for traffic with heterogeneous performance objectives
Two types of network traffic are considered: traffic with deadlines, for which the most important performance objective is based on loss rate, and packets without deadlines, for which the most important performance objective is based on mean delay. An optimal scheduling algorithm is presented to minimize weighted loss rate and weighted mean delay in the queues that form at the switches and at the network access points of a packet-switched network, where weights reflect the relative importance of packets. Although not practical for implementation, the algorithm is intended as a standard for the comparison of the performance of other scheduling algorithms. The algorithm is more general and lower computational complexity than previously published algorithms, enabling performance evaluation of some important scenarios that could not previously have been considered. Using the optimal performance results of this algorithm, the performance of the first-come-first-served, static priority, and earliest deadline first scheduling algorithms is evaluated. The results suggest that network efficiency could be improved by using a more sophisticated heuristic scheduling algorithm rather than one of the aforementioned algorithms.
Peha, Jon M.↗
Optimizing the Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems of Equations
The need to solve block tridiagonal systems with hundreds or thousands of right-hand sides for the same block tridiagonal matrix is common in a variety of disciplines. To meet this need, the Accelerated Recursive Doubling Algorithm was developed. After a right-hand side independent phase, the algorithm allows for the quick, online calculation of solutions for different right-hand sides. In this work, we present methods to optimize the Accelerated Recursive Doubling Algorithm in memory usage and computation time in a hybrid parallelization model. The right-hand side independent phase of the naïve implementation takes ≥ 11/3 the amount of memory required to store the tridiagonal matrix, while our implementation reduces the fraction to ≈ 5/3 . The right-hand side dependent phase of the naïve implementation takes ≥ 6 times the amount of memory required to store the right-hand side, while our implementation reduces the fraction to ≈ 3. The computation time for the independent phase is reduced to ≈ 2/3 times that of the naïve implementation, while the computation time for the dependent phase is reduced to ≈ 5/9 . With increasing numbers of shared-memory threads q on every distributed processing element, we have O(q) theoretical speedup.
97 MATHEMATICS AND COMPUTING↗
Gradient-Informed Design Optimization of Select Nuclear Systems
In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Gains in operational flexibility, safety margins, and cost efficiencies via integrated Plant Reload Optimization platform
The U.S. Department of Energy Light Water Reactor Sustainability Program Risk-Informed Systems Analysis Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimizing core design. Optimizing the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible core configuration options, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization platform, which supports artificial-intelligence-based reactor core designing, is now fully capable of handling realistic problems. The Plant ReLoad Optimization platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual ENvironment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multiobjective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.
11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
Characterization of BNL and HPK AC-LGAD sensors with a 120 GeV proton beam
We present measurements of AC-LGADs performed at the Fermilab's test beam facility using 120 GeV protons. Here we studied the performance of various strip and pad AC-LGAD sensors that were produced by BNL and HPK. The measurements are performed with our upgraded test beam setup that utilizes a high precision telescope tracker, and a simultaneous readout of up to 7 channels per sensor, which allows detailed studies of signal sharing characteristics. These measurements allow us to assess the differences in designs between different manufacturers, and optimize them based on experimental performance. We then study several reconstruction algorithms to optimize position and time resolutions that utilize the signal sharing properties of each sensor. We present a world's first demonstration of silicon sensors in a test beam that simultaneously achieve better than 6–10 μm position and 30 ps time resolution. This represents a substantial improvement to the spatial resolution than would be obtained with binary readout of sensors with similar pitch.
47 OTHER INSTRUMENTATION↗
Protection settings optimizer
SAND2023-06672O The Protection Settings Optimizer (PSO) uses system and fault data as inputs to formulate the problem of calculating relay settings as a mixed integer, nonlinear optimization problem (MINLP). The MINLP is solved using a genetic algorithm-based optimizer that attempts to find settings to reduce the relay operating times. The PSO protects the power system by using the steady-state fault voltages and currents, which then calculates the optimal device setting to protect the power system. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
Patel, Trupal↗
Global Design Optimization for Aerodynamics and Rocket Propulsion Components
Modern computational and experimental tools for aerodynamics and propulsion applications have matured to a stage where they can provide substantial insight into engineering processes involving fluid flows, and can be fruitfully utilized to help improve the design of practical devices. In particular, rapid and continuous development in aerospace engineering demands that new design concepts be regularly proposed to meet goals for increased performance, robustness and safety while concurrently decreasing cost. To date, the majority of the effort in design optimization of fluid dynamics has relied on gradient-based search algorithms. Global optimization methods can utilize the information collected from various sources and by different tools. These methods offer multi-criterion optimization, handle the existence of multiple design points and trade-offs via insight into the entire design space, can easily perform tasks in parallel, and are often effective in filtering the noise intrinsic to numerical and experimental data. However, a successful application of the global optimization method needs to address issues related to data requirements with an increase in the number of design variables, and methods for predicting the model performance. In this article, we review recent progress made in establishing suitable global optimization techniques employing neural network and polynomial-based response surface methodologies. Issues addressed include techniques for construction of the response surface, design of experiment techniques for supplying information in an economical manner, optimization procedures and multi-level techniques, and assessment of relative performance between polynomials and neural networks. Examples drawn from wing aerodynamics, turbulent diffuser flows, gas-gas injectors, and supersonic turbines are employed to help demonstrate the issues involved in an engineering design context. Both the usefulness of the existing knowledge to aid current design practices and the need for future research are identified.
Shyy, Wei↗
Numerical Investigation and Optimization of a Flushwall Injector for Scramjet Applications at Hypervelocity Flow Conditions
An investigation utilizing Reynolds-averaged simulations (RAS) was performed in order to find optimal designs for an interdigitated flushwall injector suitable for scramjet applications at hypervelocity conditions. The flight Mach number, duct height, spanwise width, and injection angle were the design variables selected to maximize two objective functions: the thrust potential and combustion efficiency. A Latin hypercube sampling design-of-experiments method was used to select design points for RAS. A methodology was developed that automated building geometries and generating grids for each design. The ensuing RAS analysis generated the performance database from which the two objective functions of interest were computed using a one-dimensional performance utility. The data were fitted using four surrogate models: an artificial neural network (ANN) model, a cubic polynomial, a quadratic polynomial, and a Kriging model. Variance-based decomposition showed that both objective functions were primarily driven by changes in the duct height. Multiobjective design optimization was performed for all four surrogate models via a genetic algorithm method. Optimal solutions were obtained at the upper and lower bounds of the flight Mach number range. The Kriging model obtained an optimal solution set that predicted high values for both objective functions. Additionally, three challenge points were selected to assess the designs on the Pareto fronts. Further sampling among the designs of the Pareto fronts are required in order to lower the errors and perform more accurate surrogate-based optimization. sed optimization.
Shenoy, Rajiv R.↗
Numerical Investigation and Optimization of a Flushwall Injector for Scramjet Applications at Hypervelocity Flow Conditions
An investigation utilizing Reynolds-averaged simulations (RAS) was performed in order to demonstrate the use of design and analysis of computer experiments (DACE) methods in Sandia’s DAKOTA software package for surrogate modeling and optimization. These methods were applied to a flow- path fueled with an interdigitated flushwall injector suitable for scramjet applications at hyper- velocity conditions and ascending along a constant dynamic pressure flight trajectory. The flight Mach number, duct height, spanwise width, and injection angle were the design variables selected to maximize two objective functions: the thrust potential and combustion efficiency. Because the RAS of this case are computationally expensive, surrogate models are used for optimization. To build a surrogate model a RAS database is created. The sequence of the design variables comprising the database were generated using a Latin hypercube sampling (LHS) method. A methodology was also developed to automatically build geometries and generate structured grids for each design point. The ensuing RAS analysis generated the simulation database from which the two objective functions were computed using a one-dimensionalization (1D) of the three-dimensional simulation data. The data were fitted using four surrogate models: an artificial neural network (ANN), a cubic polynomial, a quadratic polynomial, and a Kriging model. Variance-based decomposition showed that both objective functions were primarily driven by changes in the duct height. Multiobjective design optimization was performed for all four surrogate models via a genetic algorithm method. Optimal solutions were obtained at the upper and lower bounds of the flight Mach number range. The Kriging model predicted an optimal solution set that exhibited high values for both objective functions. Additionally, three challenge points were selected to assess the designs on the Pareto fronts. Further sampling among the designs of the Pareto fronts may be required to lower the surrogate model errors and perform more accurate surrogate-model-based optimization.
Shenoy, Rajiv R.↗
Characterization of BNL and HPK AC-LGAD sensors with a 120 GeV proton beam
We present measurements of AC-LGADs performed at the Fermilab's test beam facility using 120 GeV protons. We studied the performance of various strip and pad AC-LGAD sensors that were produced by BNL and HPK. The measurements are performed with our upgraded test beam setup that utilizes a high precision telescope tracker, and a simultaneous readout of up to 7 channels per sensor, which allows detailed studies of signal sharing characteristics. These measurements allow us to assess the differences in designs between different manufacturers, and optimize them based on experimental performance. We then study several reconstruction algorithms to optimize position and time resolutions that utilize the signal sharing properties of each sensor. We present a world's first demonstration of silicon sensors in a test beam that simultaneously achieve better than 6-10 micron position and 30 ps time resolution. This represents a substantial improvement to the spatial resolution than would be obtained with binary readout of sensors with similar pitch.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗