SEARCH · Search NASA

Results for “optimization algorithm”

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.

SourceResearch connectionFrom yearThrough year

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

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

NASA NTRS2014

Genetic Algorithm Optimization of a Cost Competitive Hybrid Rocket Booster

Performance, reliability and cost have always been drivers in the rocket business. Hybrid rockets have been late entries into the launch business due to substantial early development work on liquid rockets and later on solid rockets. Slowly the technology readiness level of hybrids has been increasing due to various large scale testing and flight tests of hybrid rockets. A remaining issue is the cost of hybrids vs the existing launch propulsion systems. This paper will review the known state of the art hybrid development work to date and incorporate it into a genetic algorithm to optimize the configuration based on various parameters. A cost module will be incorporated to the code based on the weights of the components. The design will be optimized on meeting the performance requirements at the lowest cost.

Story, George↗

NASA NTRS1981

Piloted simulation of an on-board trajectory optimization algorithm

This paper will describe a real time piloted simulation of algorithms designed for on-board computation of time-optimal intercept trajectories for an F-8 aircraft. The algorithms, which were derived using singular perturbation theory, generate commands that are displayed to the pilot on flight director needles on the 8-ball. By flying the airplane so as to zero the horizontal and vertical needles, the pilot flies an approximation to a time-optimal intercept trajectory. The various display and computation modes that are available will be described and results will be presented illustrating the performance of the algorithms with a pilot in the loop.

Price, D. B.↗

DOE OSTI2022

A Novel Method for Controlling Crud Deposition in Nuclear Reactors Using Optimization Algorithms and Deep Neural Network Based Surrogate Models

This work presents the use of a high-fidelity neural network surrogate model within a Modular Optimization Framework for treatment of crud deposition as a constraint within light-water reactor core loading pattern optimization. The neural network was utilized for the treatment of crud constraints within the context of an advanced genetic algorithm applied to the core design problem. This proof-of-concept study shows that loading pattern optimization aided by a neural network surrogate model can optimize the manner in which crud distributes within a nuclear reactor without impacting operational parameters such as enrichment or cycle length. Several analysis methods were investigated. Analysis found that the surrogate model and genetic algorithm successfully minimized the deviation from a uniform crud distribution against a population of solutions from a reference optimization in which the crud distribution was not optimized. Strong evidence is presented that shows boron deposition in crud can be optimized through the loading pattern. This proof-of-concept study shows that the methods employed provide a powerful tool for mitigating the effects of crud deposition in nuclear reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2017

MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECT-inspired optimization algorithm for experimentally accessible computational material design

Computational materials design has suffered from a lack of algorithms formulated in terms of experimentally accessible variables. Here we formulate the problem of (ternary) alloy optimization at the level of choice of atoms and their composition that is normal for synthesists. Mathematically, this is a mixed integer problem where a candidate solution consists of a choice of three elements, and how much of each of them to use. This space has the natural structure of a set of equilateral triangles. We solve this problem by introducing a novel version of the DIRECT algorithm that (1) operates on equilateral triangles instead of rectangles and (2) works across multiple triangles. We demonstrate on a test case that the algorithm is both robust and efficient. Lastly, we offer an explanation of the efficacy of DIRECT -- specifically, its balance of global and local search -- by showing that 'potentially optimal rectangles' of the original algorithm are akin to the Pareto front of the 'multi-component optimization' of global and local search.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Global optimization algorithms to compute thermodynamic equilibria in large complex systems with performance considerations

Several global optimization methods are reviewed that attempt to ensure that the integral Gibbs energy of a closed isothermal isobaric system is a global minimum to satisfy the necessary and sufficient conditions for thermodynamic equilibrium. In particular, the integral Gibbs energy function of a multicomponent system containing non-ideal phases may be highly non-linear and non-convex, which makes finding a global minimum a challenge. Consequently, a poor numerical approach may lead one to the false belief of equilibrium. Furthermore, confirming that one reaches a global minimum and that this is achieved with satisfactory computational performance becomes increasingly more challenging in systems containing many chemical elements and a correspondingly large number of species and phases. Several numerical methods that have been used for this specific purpose are reviewed with a benchmark study of three of the more promising methods using five case studies of varying complexity. A modification of the conventional Branch and Bound method is presented that is well suited to a wide array of thermodynamic applications, including complex phases with many constituents and sublattices, and ionic phases that must adhere to charge neutrality constraints. Also, a novel method is presented that efficiently solves the system of linear equations that exploits the unique structure of the Hessian matrix, which reduces the calculation from a O(N 3 ) operation to a O(N) operation. As a result, this combined approach demonstrates efficiency, reliability and capabilities that are favorable for integration of thermodynamic computations into multi-physics codes with inherent performance considerations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

A retrospective planning analysis comparing intensity modulated radiation therapy (IMRT) to volumetric modulated arc therapy (VMAT) using two optimization algorithms for the treatment of early-stage prostate cancer

The primary aim of this study is to compare intensity modulated radiation therapy (IMRT) to volumetric modulated arc therapy (VMAT) for the radical treatment of prostate cancer using version 10.0 (v10.0) of Varian Medical Systems, RapidArc radiation oncology system. Particular focus was placed on plan quality and the implications on departmental resources. The secondary objective was to compare the results in v10.0 to the preceding version 8.6 (v8.6). Twenty prostate cancer cases were retrospectively planned using v10.0 of Varian's Eclipse and RapidArc software. Three planning techniques were performed: a 5-field IMRT, VMAT using one arc (VMAT-1A), and VMAT with two arcs (VMAT-2A). Plan quality was assessed by examining homogeneity, conformity, the number of monitor units (MUs) utilized, and dose to the organs at risk (OAR). Resource implications were assessed by examining planning and treatment times. The results obtained using v10.0 were also compared to those previously reported by our group for v8.6. In v10.0, each technique was able to produce a dose distribution that achieved the departmental planning guidelines. The IMRT plans were produced faster than VMAT plans and displayed improved homogeneity. The VMAT plans provided better conformity to the target volume, improved dose to the OAR, and required fewer MUs. Treatments using VMAT-1A were significantly faster than both IMRT and VMAT-2A. Comparison between versions 8.6 and 10.0 revealed that in the newer version, VMAT planning was significantly faster and the quality of the VMAT dose distributions produced were of a better quality. VMAT (v10.0) using one or two arcs provides an acceptable alternative to IMRT for the treatment of prostate cancer. VMAT-1A has the greatest impact on reducing treatment time.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2013

Optimization Algorithms for Hierarchical Problems, with Application to Nanoporous Materials

This project investigated computational methods for optimizing the design of nanoporous materials. These materials hold promise in energy storage applications such as electrical supercapacitors and hydrogen storage systems. A significant issue for nanoporous storage devices is the design of the channel network within these materials to allow rapid diffusion while retaining storage capacity.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1990

Robustness, generality and efficiency of optimization algorithms in practical applications

The theoretical foundations of two approaches, sequential quadratic programming (SQP) and optimality criteria (OC), are analyzed and compared, with emphasis on the critical importance of parameters such as accuracy, generality, robustness, efficiency, and ease of use in large scale structural optimization. A simplified fighter wing and active control of space structures are considered with other example problems. When applied to general system identification problems, the OC methods are shown to lose simplicity and demonstrate lack of generality, accuracy and robustness. It is concluded that the SQP method with a potential constraint strategy is a better choice as compared to the currently prevalent mathematical programming and OC approaches.

Thanedar, P. B.↗

NASA NTRS2008

Algorithm Optimally Orders Forward-Chaining Inference Rules

People typically develop knowledge bases in a somewhat ad hoc manner by incrementally adding rules with no specific organization. This often results in a very inefficient execution of those rules since they are so often order sensitive. This is relevant to tasks like Deep Space Network in that it allows the knowledge base to be incrementally developed and have it automatically ordered for efficiency. Although data flow analysis was first developed for use in compilers for producing optimal code sequences, its usefulness is now recognized in many software systems including knowledge-based systems. However, this approach for exhaustively computing data-flow information cannot directly be applied to inference systems because of the ubiquitous execution of the rules. An algorithm is presented that efficiently performs a complete producer/consumer analysis for each antecedent and consequence clause in a knowledge base to optimally order the rules to minimize inference cycles. An algorithm was developed that optimally orders a knowledge base composed of forwarding chaining inference rules such that independent inference cycle executions are minimized, thus, resulting in significantly faster execution. This algorithm was integrated into the JPL tool Spacecraft Health Inference Engine (SHINE) for verification and it resulted in a significant reduction in inference cycles for what was previously considered an ordered knowledge base. For a knowledge base that is completely unordered, then the improvement is much greater.

James, Mark↗

DOE OSTI2022

Implementation of an Orificing Optimization Algorithm in the DASSH Subchannel Analysis Code

The Ducted Assembly Steady-State Heat transfer code (DASSH) performs full-core subchannel thermal hydraulics calculations in liquid metal fast reactors. One of the applications of subchannel codes is to optimize coolant flow orificing. As a design activity, the primary task is to determine the best way to divide assemblies into groups and distribute coolant flow rates among them. This report documents an algorithm implemented in DASSH to automatically optimize coolant orificing. Over the course of multiple iterations, DASSH determines the orifice grouping and flow distribution that minimizes peak coolant, clad, or fuel temperatures across all timesteps for a user-specified number of assembly groups. The total coolant flow rate in the reactor is constrained to achieve the specified core-average outlet temperature. The flow rate to each orifice group may also be constrained by the allowable pressure drop. The distribution of coolant flow among groups is accelerated using a predictor-corrector algorithm based on interpolated results from single-assembly parametric calculations. The assembly orificing grouping is initially predicted based on assembly power but can be refined if results demonstrate that an assembly would fit better in another group. The algorithm is demonstrated with two case studies. The first is a simple model for a reactor core consisting of just fuel assemblies; the pin power distributions are specified to create a situation where the initial assembly grouping prediction is suboptimal. This example is used to describe the initial grouping, demonstrate convergence over multiple iterations, and highlight the impact of regrouping. Then, the algorithm is applied to minimize peak clad and fuel temperatures in an example sodium-cooled fast reactor, the Versatile Test Reactor. The multicycle optimization confirms prior calculations for the reference core design. The example highlights how optimizing for different peak temperatures affects the results and demonstrates the use of the pressure drop constraint to limit the maximum flow rate.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2018

Broadband infrared binary-pattern metasurface absorbers with micro-genetic algorithm optimization

Broadband binary-pattern metasurface absorbers are designed and demonstrated in the mid-infrared wavelength range through the micro-genetic algorithm. The tungsten-based metasurface absorbers with the optimized binary-pattern nanostructures exhibit broadband near-perfect absorption due to the multiple plasmonic resonances supported within the unit cell. Furthermore, the influence of minor pixel modifications in the optimized binary-pattern nanostructures on the absorption performance is investigated in the experiment. This Letter presents a promising approach to design and optimize complex optical nanostructures with the desired properties for metamaterial and metasurface applications.

42 ENGINEERING↗

DOE OSTI2018

An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients

Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this paper, we first use the dual SDP subproblem to construct an explicit overestimation and then propose a branch-and-bound algorithm to globally solve (SRQ). Numerical results demonstrate that it is even more efficient than the recent SDP-based heuristic algorithm.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2019

Machine Learning, Markov Chain Monte Carlo, and Optimal Algorithms to Characterize the AdvACT Kilopixel Transition-Edge Sensor Arrays

Next-generation focal planes comprising dozens of kilopixel transition-edge sensor (TES) arrays require new methods to rapidly screen candidate arrays, evaluate array non-idealities in the field, identify outlier devices for removal, and optimize the array performance in the field. We demonstrate robust methods to estimate TES parameters (critical temperatures and thermal conductivity parameters) and their uncertainties using a custom Markov Chain Monte Carlo (MCMC) algorithm. We also constrain systematic effects in estimating the TES parameters from non-isothermal current-voltage curves (IVs) at approximately a ~3% level. Additionally, for the first time, we have applied Machine Learning (ML) algorithms to tune detector arrays and optimize their performance.

Maria Salatino↗

DOE OSTI2019

Ensemble-Based Support Vector Regression with Gravitational Search Algorithm Optimization for Estimating Magnetic Relative Cooling Power of Manganite Refrigerant in Magnetic Refrigeration Application

Magnetic refrigeration technology (MRT) is considered an energy-efficient and environmental-friendly system of refrigeration that has a considerable potential of replacing the classical gas-compression expansion method of refrigeration. Inclusion of manganite-based material (MBM) in MRT as a magnetic refrigerant has attracted significant attention recently due to cost effectiveness of the refrigerant as well as better resistance to oxidation and corrosion as compared to the commonly used metal gadolinium refrigerant. Relative cooling power (RCP) is one of the most important parameters to be considered while assessing the usefulness of MBM. Its value can be altered through doping with external materials and accurate estimation of the dopant influence is required to achieve the right amount of RCP. This present research work proposes support vector regression (SVR) ensemble models with gravitational search algorithm (GSA) hyper-parameters optimization, for estimating RCP of MBM and to determine the influence of dopants on RCP using ionic radii and dopant concentrations as descriptors. GSA-SVR ensemble model (GSE) is developed by employing the outputs of five different SVR models as descriptors while GSA-SVR ensemble model with averaging (GSEA) uses the average of the five different SVR models as its descriptor. The novel ensemble models outperform other SVR models, specifically; GSE performs better than GSA-SVR model and the conventional SVR model with performance improvement of 269.14% and 283.61%, respectively on the basis of root mean square error (RMSE). Furthermore, GSEA outperforms GSE, GSA-SVR model and conventional SVR with performance improvement of 27.51%, 370.70%, and 389.14%, respectively on the basis of RMSE. The developed GSE and GSEA also perform better than the existing RCP model in the literature with performance improvement of 11.53% and 42.21%, respectively. The results of this research work will not only serve to circumvent the experimental challenges of RCP measurement without loss of experimental precision but also further promotes environment-friendly system of refrigeration.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Genetic algorithm optimization of a chemical kinetic mechanism for propane at engine relevant conditions

Propane has demonstrated significant potential for reductions in greenhouse gas and pollutant emissions in medium- and heavy-duty engine applications, but further improvements require accurate, compact, and scalable chemical kinetic mechanisms to design the next generation of propane fueled engines, particularly at the boosted operating conditions necessary to meet the power density demand of medium- and heavy-duty applications. In this work, six key chemical reactions were identified in a reduced mechanism with 70 species and 352 reactions through a sensitivity analysis performed at conditions typical of thermodynamic trajectories observed in a high compression ratio, long stroke engine operated on propane from throttled to boosted operating conditions. While the original mechanism was validated against rapid compression machine (RCM) data, it was found to overpredict experimental autoignition tendencies in 2-zone, 0-D SI engine simulations performed in Chemkin Pro. Subsequently, a genetic algorithm approach was used to optimize the six reaction rate parameters within established uncertainty bounds by performing RCM simulations and comparing to two independent sets of literature ignition delay times for propane, thus generating two new kinetic mechanisms. The first optimization achieved a mean absolute percent error (MPE) reduction in 2nd stage ignition delay of 61.4% in seven generations, while the second optimization utilized a newer experimental RCM dataset, and achieved MPE reduction of 56.7% in seven generations, and further marginal improvement to 57.8% reduction in 34 generations. Finally, the two mechanisms were then evaluated again in the 2-zone 0-D SI engine model in Chemkin Pro comparing typical mean and knocking cycle trajectories, and it was found that the second optimized mechanism provided better prediction of knock onset at the representative conditions evaluated in this work, particularly for higher load operating conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS2002

Prediction of Aerodynamic Coefficient using Genetic Algorithm Optimized Neural Network for Sparse Data

Wind tunnels use scale models to characterize aerodynamic coefficients, Wind tunnel testing can be slow and costly due to high personnel overhead and intensive power utilization. Although manual curve fitting can be done, it is highly efficient to use a neural network to define the complex relationship between variables. Numerical simulation of complex vehicles on the wide range of conditions required for flight simulation requires static and dynamic data. Static data at low Mach numbers and angles of attack may be obtained with simpler Euler codes. Static data of stalled vehicles where zones of flow separation are usually present at higher angles of attack require Navier-Stokes simulations which are costly due to the large processing time required to attain convergence. Preliminary dynamic data may be obtained with simpler methods based on correlations and vortex methods; however, accurate prediction of the dynamic coefficients requires complex and costly numerical simulations. A reliable and fast method of predicting complex aerodynamic coefficients for flight simulation I'S presented using a neural network. The training data for the neural network are derived from numerical simulations and wind-tunnel experiments. The aerodynamic coefficients are modeled as functions of the flow characteristics and the control surfaces of the vehicle. The basic coefficients of lift, drag and pitching moment are expressed as functions of angles of attack and Mach number. The modeled and training aerodynamic coefficients show good agreement. This method shows excellent potential for rapid development of aerodynamic models for flight simulation. Genetic Algorithms (GA) are used to optimize a previously built Artificial Neural Network (ANN) that reliably predicts aerodynamic coefficients. Results indicate that the GA provided an efficient method of optimizing the ANN model to predict aerodynamic coefficients. The reliability of the ANN using the GA includes prediction of aerodynamic coefficients to an accuracy of 110% . In our problem, we would like to get an optimized neural network architecture and minimum data set. This has been accomplished within 500 training cycles of a neural network. After removing training pairs (outliers), the GA has produced much better results. The neural network constructed is a feed forward neural network with a back propagation learning mechanism. The main goal has been to free the network design process from constraints of human biases, and to discover better forms of neural network architectures. The automation of the network architecture search by genetic algorithms seems to have been the best way to achieve this goal.

Rajkumar, T.↗

NASA NTRS2006

Implementation of a Low-Thrust Trajectory Optimization Algorithm for Preliminary Design

A tool developed for the preliminary design of low-thrust trajectories is described. The trajectory is discretized into segments and a nonlinear programming method is used for optimization. The tool is easy to use, has robust convergence, and can handle many intermediate encounters. In addition, the tool has a wide variety of features, including several options for objective function and different low-thrust propulsion models (e.g., solar electric propulsion, nuclear electric propulsion, and solar sail). High-thrust, impulsive trajectories can also be optimized.

optimization↗

DOE OSTI2017

Use of advanced optimization algorithms for the design of critical experiments

The need for validating molybdenum and rhodium cross sections in the thermal energy range has arisen for many years for reprocessing activities and burnup credit calculations. An Integral Experimental Request (IER) sheet was submitted by IRSN to the NCSP (Nuclear Criticality Safety Program) in 2015. A preliminary design was therefore proposed for review. In order to define experiments that meet the requirements and that exhibit optimized sensitivities of k{sub eff} to the capture cross sections of {sup 95}Mo and {sup 103}Rh, advanced algorithms of the PROMETHEE workbench, developed at IRSN, were used. The methodology as well as the main results are presented in this paper, which focuses only on the molybdenum experiments design. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗