Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 253 records · Page 14

Optimization of the Second Target Station cold source moderators using an automated workflow

The Second Target Station (STS) at the US Department of Energy’s Oak Ridge National Laboratory is designed to become the world’s highest peak-brightness spallation source of cold neutrons. Successful completion of the STS, which is currently in the preliminary design phase, will provide transformative new capabilities to examine novel materials for future technologies. At STS, neutrons will be generated by spallation reactions in a solid tungsten target. They will be moderated and thermalized in two cold (20 K) para-hydrogen moderators. Careful optimization of these moderators is essential to the project’s success. To find optimal moderator designs, an advanced optimization workflow integrates high-fidelity neutronics calculations using the Monte Carlo N-Particle (MCNP) transport code MCNP6.2 with state-of-the-art optimization algorithms in the Dakota optimization toolkit. For each design iteration, a parametrized solid CAD geometry is generated in Creo and automatically converted into an unstructured mesh geometry by Attila 4MC for the neutronics calculation with MCNP. Iterations repeat until optimal designs are found. Herein this paper presents the results of a sensitivity and optimization study for the cylindrical and tube moderators. Both moderators can be optimized for maximum peak brightness, maximum time-integrated brightness, or any combination between these extremes. Maximum peak brightness is achieved by using smaller optimal dimensions of the moderators, whereas maximum time-integrated brightness is achieved by using larger dimensions. A Pareto front details the designs that optimally balance both brightness metrics. The Pareto front can be found in only 40–110 iterations with 4–5 design parameters when using the efficient global and Pareto-set optimization algorithms in Dakota. Additionally, important engineering constraints can be taken into account, such as the coupling between the cylindrical moderator radius and aluminum vessel wall thicknesses required to ensure structural integrity of the vessels. This interaction has a significant impact on the resulting optimal designs. Our new, highly efficient, fully automated optimization workflow will be used to optimize additional STS components in the future and can be adopted for design and optimization studies at other experimental neutron and accelerator facilities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithms and analyses for stochastic optimization for turbofan noise reduction using parallel reduced-order modeling

Simulation-based optimization of acoustic liner design in a turbofan engine nacelle for noise reduction purposes can dramatically reduce the cost and time needed for experimental designs. Because uncertainties are inevitable in the design process, a stochastic optimization algorithm is posed based on the conditional value-at-risk measure so that an ideal acoustic liner impedance is determined that is robust in the presence of uncertainties. A parallel reduced-order modeling framework is developed that dramatically improves the computational efficiency of the stochastic optimization solver for a realistic nacelle geometry. The reduced stochastic optimization solver takes less than 500 s to execute. Additionally, well-posedness and finite element error analyses of the state system and optimization problem are provided.

97 MATHEMATICS AND COMPUTING↗

Optimal Regulator Algorithms for the Control of Linear Systems

Control-theory design package, called Optimal Regulator Algorithms for Control of Linear Systems (ORACLS), aids in design of controllers and optimal filters for systems modeled by linear, time invariant differential and difference equations. ORACLS is particularly attractive rigorous tool for dealing with multi-input and multi-output dynamic systems in both continuous and discrete forms.

Armstrong, E. S.↗

Proton beam scattering system optimization for clinical and research applications

Purpose: To develop and test a method for optimizing and constructing a dual scattering system in passively scattered proton therapy. Methods: A beam optics optimization algorithm was developed to optimize the thickness of the first scatterer (S1) and the profile (of both the high-Z material and Lexan) of the second scatterer (S2) to deliver a proton beam matching a given set of parameters, including field diameter, fluence, flatness, and symmetry. A new manufacturing process was also tested that allows the contoured second scattering foil to be created much more economically and quickly using Cerrobend casting. Two application-specific scattering systems were developed and tested using both experimental and Monte Carlo techniques to validate the optimization process described. Results: A scattering system was optimized and constructed to deliver large uniform irradiations of radiobiology samples at low dose rates. This system was successfully built and tested using film and ionization chambers. The system delivered a uniform radiation field of 50 cm diameter (to a dose of {+-}7% of the central axis) while the depth dose profile could be tuned to match the specifications of the particular investigator using modulator wheels and range shifters. A second scattering system for intermediate field size (4 cm < diameter < 10 cm) stereotactic radiosurgery and radiation therapy (SRS and SRT) treatments was also developed and tested using GEANT4. This system improved beam efficiency by over 70% compared with existing scattering systems while maintaining field flatness and depth dose profile. In both cases the proton range uniformity across the radiation field was maintained, further indicating the accuracy of the energy loss formalism in the optimization algorithm. Conclusions: The methods described allow for rapid prototyping of scattering foils to meet the demands of both research and clinical beam delivery applications in proton therapy.

60 APPLIED LIFE SCIENCES↗

Increasing the solar photovoltaic energy capture on sunny and cloudy days

This report analyzes an extensive set of measurements of the solar irradiance made using four identical solar arrays and associated solar sensors (collectively referred to as solar collectors) with different tilt angles relative to the earth's surface, and thus the position of the sun, in order to determine an optimal tracking algorithm for capturing solar radiation. The study included a variety of ambient conditions including different seasons and both cloudy and cloud-free conditions. One set of solar collectors was always approximately pointed directly toward the sun (DTS) for a period around solar noon. These solar collectors thus captured the direct beam component of the solar radiation that predominates on sunny days. We found that on sunny days, solar collectors with a DTS configuration captured more solar energy in accordance with the well-known cosine dependence for the response of a flat-surfaced solar collector to the angle of incidence with direct beam radiation. In particular, a DTS orientation was found to capture up to twice as much solar energy as a horizontal (H) orientation in which the array is tilted toward the zenith. Another set of solar collectors always had an H orientation, and this best captured the diffuse component of the solar radiation that predominates on cloudy days. The dependence of the H/DTS ratio on the solar-collector tilt angle was in approximate agreement with the Isotropic Diffuse Model derived for heavily overcast conditions. During cloudy periods, we found that an H configuration increased the solar energy capture by nearly 40% compared to a DTS configuration during the same period, and we estimate the solar energy increase of an H configuration over a system that tracks the obscured solar disk could reach 50% over a whole heavily-overcast day. On an annual basis the increase is predicted to be much less, typically only about 1%, because the contribution of cloudy days to the total annual solar energy captured by a photovoltaic system is small. These results are consistent with the solar tracking algorithm optimized for cloudy conditions that we proposed in an earlier report and that was based on a much smaller data set. Improving the harvesting of solar energy on cloudy days deserves wider attention due to increasing efforts to utilize renewable solar energy. In particular, increasing the output of distributed solar power systems on cloudy days is important to developing solar-powered home fueling and charging systems for hydrogen-powered fuel-cell electric and battery-powered vehicles, respectively, because it reduces the system size and cost for solar power systems that are designed to have sufficient energy output on the worst (cloudy) days. (author)

14 SOLAR ENERGY↗

Machine learning-aided inverse design for biogas upgrading through biological CO 2 conversion

The biogas upgrading process through bioconversion of CO 2 to CH 4 by hydrogenotrophic methanogens is an attractive strategy for energy decarbonation. Many studies have optimized operational parameters to improve key performance indicators such as CH 4 % and H 2 utilization efficiency. However, inconsistent laboratory conditions make it challenging to compare results. Existing models for analyzing operating conditions can only assess the impact of individual conditions and lack the ability to simultaneously optimize multiple conditions. To address this, two XGBoost models were built with R 2 of 0.779 and 0.903 with data collected from literatures and were embedded into multi-objective partitive swarm optimization algorithm to optimal operating conditions. Predictions were compared with experimental validations under optimized conditions, revealing an 8.50% and 2.95% relative error in CH 4 % and H 2 conversion rate, respectively. This approach streamlines biogas upgrading processes, offering a data-driven solution to enhance efficiency and consistency in the pursuit of sustainable methane production.

Biogas upgrading↗

Techno-Economic Analysis of Recuperated Joule-Brayton Pumped Thermal Energy Storage

This article describes a techno-economic model for pumped thermal energy storage systems based on recuperated Joule-Brayton cycles and two-tank liquid storage. Models have been developed for each component, with particular emphasis on the heat exchangers. Economic metrics such as the power and energy capital costs (i.e., per-kW and per-kWh capacity) and levelized cost of storage are evaluated by gathering numerous cost correlations from the literature, thereby enabling estimates of uncertainty. It is found that the use of heat exchangers with effectivenesses up to 0.95 is economically worthwhile, but higher values lead to rapidly escalating component size and system cost. Several hot storage fluids are considered; those operating at the highest temperatures (chloride salts) improve the round-trip efficiency but the benefit is marginal and may not warrant the additional material costs and risk when compared to lower-temperature nitrate salts. Cost-efficiency trade-offs are explored using a multi-objective optimization algorithm, yielding optimal designs with round-trip efficiencies in the range 59-72% and corresponding levelized storage costs of 0.12 0.03 and 0.38 0.10 $/kWhe. Lifetime costs are competitive with lithium-ion batteries for discharging durations greater than 6 h under current scenarios.

Carnot battery↗

Stochastic solution of population balance equations for reactor networks

This work presents a sequential modular approach to solve a generic network of reactors with a population balance model using a stochastic numerical method. Full-coupling to the gas-phase is achieved through operator-splitting. The convergence of the stochastic particle algorithm in test networks is evaluated as a function of network size, recycle fraction and numerical parameters. These test cases are used to identify methods through which systematic and statistical error may be reduced, including by use of stochastic weighted algorithms. The optimal algorithm was subsequently used to solve a one-dimensional example of silicon nanoparticle synthesis using a multivariate particle model. This example demonstrated the power of stochastic methods in resolving particle structure by investigating the transient and spatial evolution of primary polydispersity, degree of sintering and TEM-style images. Highlights: •An algorithm is presented to solve reactor networks with a population balance model. •A stochastic method is used to solve the population balance equations. •The convergence and efficiency of the reported algorithms are evaluated. •The algorithm is applied to simulate silicon nanoparticle synthesis in a 1D reactor. •Particle structure is reported as a function of reactor length and time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving global optimization problems on GPU cluster

The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.

97 MATHEMATICS AND COMPUTING↗

Alternative difference analysis scheme combining R -space EXAFS fit with global optimization XANES fit for X-ray transient absorption spectroscopy

Time-resolved X-ray absorption spectroscopy (TR-XAS), based on the laser-pump/X-ray-probe method, is powerful in capturing the change of the geometrical and electronic structure of the absorbing atom upon excitation. TR-XAS data analysis is generally performed on the laser-on minus laser-off difference spectrum. Here, a new analysis scheme is presented for the TR-XAS difference fitting in both the extended X-ray absorption fine-structure (EXAFS) and the X-ray absorption near-edge structure (XANES) regions. R -space EXAFS difference fitting could quickly provide the main quantitative structure change of the first shell. The XANES fitting part introduces a global non-derivative optimization algorithm and optimizes the local structure change in a flexible way where both the core XAS calculation package and the search method in the fitting shell are changeable. The scheme was applied to the TR-XAS difference analysis of Fe(phen) 3 spin crossover complex and yielded reliable distance change and excitation population.

Zhan, Fei↗

Fourier Analysis-Based Evolutionary Multi-Objective Multiphysics Optimization of Liquid-Cooled Heat Sinks

Optimal heat dissipation in power modules can significantly increase their power density. Removing the generated heat is critical for capturing the benefits of advanced semiconductor materials and improving the reliability of the device operation. This article proposes a design optimization method for liquid-cooled heat sinks that use a Fourier analysis-based tool and an evolutionary optimization algorithm to optimize the heat sink geometry for specified objectives. The optimized heat sink geometry is then compared with state-of-the-art solutions in literature based on finite element analysis of different designs. The proposed methodology can develop complex geometries that outperform the conventional heat sink geometries.

Sahu, Raj↗

I-V characterization and parameter extraction tool [SWR-24-59]

GPT-crafted control software and graphical user interface for Keithley 2400 Source Measure Units and global optimization algorithm. It contains Numba-compatible self-adaptive differential evolution algorithm for optimization tasks. This software is comprised of two repositories: https://github.com/NREL/Keithley_GPT https://github.com/NREL/DE

Febba, Davi Marcelo↗

MOOSE Framework Speed and Memory Optimizations

The Multiphysics Object Oriented Simulation Environment (MOOSE) framework has been developed to solve a variety of complex simulations ranging from groundwater flows to full reactor simulations. MOOSE excels at solving fully-implicit, fully-coupled, highly nonlinear models using the Jacobian Free Newton-Krylov (JFNK) method relying on years of expertise in several dependent packages including PETSc, libMesh, Hypre and many others. The modular design of MOOSE enables the rapid development of new physics models that can be coupled with relative ease within the framework for building up simulations of different levels of complexity. With the ongoing adoption of MOOSE to new application areas along with streamlining of existing simulations, the priorities must be adjusted to include code optimizations. This includes both execution speed and the memory footprint of MOOSE-based simulations. These two categories can be further broken down into ''micro-optimizations'' or source code optimizations and algorithmic optimizations where source code is restructured to accomplish the same tasks through a more efficient means. However, before any code optimizations can occur, one must have robust way of measuring these critical simulation properties to identify the best candidates for optimizations along with having a way to identify the effectiveness of proposed optimizations to the framework. This report discusses the preliminary work towards the implementation of a robust execution baseline of the framework and derivative applications under a variety of different simulations. In addition, several potential optimization target areas in both the MOOSE framework and dependent libraries have been identified. An implementation strategy and potential benefits are discussed.

97 MATHEMATICS AND COMPUTING↗

NuSTORM $\mu$ Ring – Design and Injection Optimization

The design of the NuSTORM muon production beam line and storage ring is discussed. The facility includes a pion production target station with a pion collection horn and transport into a straight section of a storage ring. {\pi} decay within that straight section provides {\mu}'s that are stored within the ring for subsequent decay providing precision electron and muon neutrino beams. The ring and transport designs are described and optimized. Genetic Algorithm optimization of the horn and transport into the ring has been performed, providing a significant increase in intensity

43 PARTICLE ACCELERATORS↗

Attitude determination using vector observations: A fast optimal matrix algorithm

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Markley, F. Landis↗

Attitude determination using vector observations - A fast optimal matrix algorithm

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Markley, F. L.↗

Optimized TRIAD Algorithm for Attitude Determination

TRIAD is a well known simple algorithm that generates the attitude matrix between two coordinate systems when the components of two abstract vectors are given in the two systems. TRIAD however, is sensitive to the order in which the algorithm handles the vectors, such that the resulting attitude matrix is influenced more by the vector processed first. In this work we present a new algorithm, which we call Optimized TRIAD, that blends in a specified manner the two matrices generated by TRIAD when processing one vector first, and then when processing the other vector first. On the average, Optimized TRIAD yields a matrix which is better than either one of the two matrices in that is ti the closest to the correct matrix. This result is demonstrated through simulation.

Bar-Itzhack, Itzhack Y.↗