SEARCH · Search NASA

Results for “Genetic 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 163 records · Page 9

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Pressurized-Water Reactor Core Design Demonstration with Genetic Algorithm Based Multi-Objective Plant Fuel Reload Optimization Platform

LWRS M3 milestone report due September 15, 2023. This report summarizes development and demonstration activities of PRLO optimization platform built in Risk Analysis and Virtual ENviroment (RAVEN), specifically: (1) Improvement of multi-objective non-dominated sorting genetic algorithm II (NSGA-II) to handle large size of objectives and constraints, (2) Demonstration of pressurized water reactor core design with NSGA-II multi-objective optimization platform, and (3) Single-objective optimized core design including system analysis and fuel performance feedback.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

NASA NTRS2019

Thermal Property Estimation of Fibrous Insulation: Heat Transfer Modeling and the Continuous Genetic Algorithm

Thermal properties of high-temperature fibrous insulation materials were estimated from transient thermal tests using an inverse heat transfer technique. Transient temperature data from an experimental set up was collected and a simple, one-dimensional numerical model was constructed to replicate the temperatures within the test assembly. The Continuous Genetic Algorithm optimization technique in conjunction with a numerical thermal model and transient test data was used to estimate coefficients of a functional representation of the thermal property. The thermal properties, i.e., thermal conductivity and specific heat, of an alumina insulation felt were estimated over the temperature range of 300 K to 1700 K at various constant static pressures in nitrogen gas and compared with published data. The resulting thermal property estimates were within 10% of published values over the entire temperature range at various pressures. The methodology, application, and results are presented.

Frye, Elora↗

DOE OSTI2023

Insights into Constraining Rate Coefficients in Fuel Oxidation Mechanisms Using Genetic Algorithm Optimization

Accurate fuel oxidation mechanisms can enable predictive capabilities that aid in advancing combustion technologies. High-level computational kinetics can yield reasonable rate coefficients with uncertainties, in some cases, below a factor of 2. Computed rate coefficients can be constrained further by optimizing against experimental data. Here, we explore the application of genetic algorithm (GA) optimization to constrain computed rate coefficients in complex fuel oxidation mechanisms in conjunction with temperature-dependent species mole fractions from jet-stirred reactor (JSR) measurements. Cyclohexane is a model candidate for understanding the reactivity of cyclic fuels. In this work, we optimize the rate coefficients of the most recent literature cyclohexane mechanism, which incorporates theoretically computed rate coefficients for the reaction networks stemming from the first and second O 2 addition pathways, against the experimental results of two separate literature JSR studies. Optimization consistency is evaluated by carrying out three GA optimizations: fitting to the temperature-dependent species mole fractions in each JSR experiment separately and simultaneously fitting the species mole fractions in both experiments. Local sensitivity analyses are used to identify five influential low-temperature oxidation reactions for optimization. Although the three optimizations do not yield identical rate coefficients, the direction of change in all five rate coefficients is consistent among the three optimizations. Performance of the models from the three optimizations is assessed against literature ignition delay times with differences in the level of agreement observed among the different optimizations. In conclusion, comparisons are made with our recent optimization work of a cyclopentane oxidation master-equation model against time-resolved species concentrations, and insights and improvements of the strategy for constraining rate coefficients using GA optimization are discussed.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2022

Preliminary Assessment of Elemental Analysis of X-Ray Fluorescence with Genetic Algorithm

X-ray fluorescence (XRF) spectroscopy is a promising approach to elemental analysis of forensic samples. Elements in the mixture can be identified from the XRF data because chemical elements are associated with unique spectra. This report consists of preliminary assessment of automated identification of unknown mixtures of elements from XRF spectra using a genetic algorithm (GA). The XRF spectra are measured at the Advanced Photon Source (APS) at the liquid-liquid interface during solvent extraction process. Possible advantages of using GA for identifying elements at the interface from XRF data are discussed, and a path for implementation of GA is outlined.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Implementation of Genetic Algorithms to Optimize Metal–Organic Frameworks for CO 2 Capture

Metal-organic frameworks (MOFs) are promising materials for CO 2 capture with the potential to use less energy than current industrial CO 2 capture methods. MOFs are highly versatile sorbents, and there is an almost unlimited number of MOFs that could be synthesized. In this work, we used a genetic algorithm (GA) and grand canonical Monte Carlo (GCMC) simulations to efficiently search for high-performing MOFs for CO 2 capture. We analyzed the effects of important GA parameters, including the mutation probability, the number of MOFs per generation and the number of GA generations, on the GA performance. Here, we performed GCMC simulations on-the-fly during the GA procedure to determine the performance of proposed MOFs and optimized their structures using multiple objective functions across different topologies. The GA was able to determine top-performing MOFs balancing CO 2 selectivity versus working capacity and reduced the cost of molecular simulations by a factor of 25 versus brute-force screening of an entire database of structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Using genetic algorithms to discover novel ground-state triplet conjugated polymers

Stable ground-state triplet π-conjugated copolymers have many interesting electronic and optoelectronic properties. However, the large number of potential monomer combinations makes it impractical to synthesize or even just use density functional theory (DFT) to calculate their triplet ground-state stability. Furthermore, we present a genetic algorithm implementation that uses the semi-empirical GFN2-xTB to find ground-state triplet polymer candidates. We find more than 1400 polymer candidates with a triplet ground-state stability of up to 4 eV versus the singlet. Additionally, we explore the properties of the monomers of those candidates in order to understand the design rules which promote the formation of a stable ground-state triplet in π-conjugated polymers.

36 MATERIALS SCIENCE↗

NASA NTRS2000

A Parallel Approach To Optimum Actuator Selection With a Genetic Algorithm

Recent discoveries in smart technologies have created a variety of aerodynamic actuators which have great potential to enable entirely new approaches to aerospace vehicle flight control. For a revolutionary concept such as a seamless aircraft with no moving control surfaces, there is a large set of candidate locations for placing actuators, resulting in a substantially larger number of combinations to examine in order to find an optimum placement satisfying the mission requirements. The placement of actuators on a wing determines the control effectiveness of the airplane. One approach to placement Maximizes the moments about the pitch, roll, and yaw axes, while minimizing the coupling. Genetic algorithms have been instrumental in achieving good solutions to discrete optimization problems, such as the actuator placement problem. As a proof of concept, a genetic has been developed to find the minimum number of actuators required to provide uncoupled pitch, roll, and yaw control for a simplified, untapered, unswept wing model. To find the optimum placement by searching all possible combinations would require 1,100 hours. Formulating the problem and as a multi-objective problem and modifying it to take advantage of the parallel processing capabilities of a multi-processor computer, reduces the optimization time to 22 hours.

Rogers, James L.↗

DOE OSTI2021

Enhanced Integer Permutation based Genetic Algorithm for Optimization of Tube-Fin Heat Exchanger Circuitry with Splits and Merges

Tube-fin heat exchangers (HXs) are widely used in air-conditioning and heat pump applications. The performance of these heat exchangers is strongly influenced by the refrigerant circuitry. Studies have proved that by optimizing the refrigerant circuitry, the performance of HXs can be significantly improved. In our previous research, an Integer Permutation based Genetic Algorithm (IPGA) was developed to obtain the optimal circuitry designs. Our previous research showed that IPGA demonstrates superior capability to obtain better refrigerant circuitries with lower computational cost than the other methods in literature. And the optimal circuitry designs obtained from IPGA are manufacturable with the available tooling. However, the IPGA developed previously cannot generate designs with splitting and merging of circuits. To remedy this limitation, a new chromosome which can represent circuitry with splitting and merging of circuits is developed. In addition to the six genetic operators implemented previously, two new genetic operators are developed to generate splits and merges. As a result, the enhanced IPGA can explore the solution space more thoroughly than the previous IPGA. A case study using an evaporator from an A-type indoor unit shows that, given the similar capacity improvements obtained from the enhanced IPGA compared with the previous IPGA, the refrigerant pressure drop reduction obtained from the enhanced IPGA is 26.5% compared against 1.0% pressure drop reduction from the previous IPGA. The benchmark of the enhanced IPGA with other methods in literature demonstrates that the enhanced IPGA can generate circuitry designs with performance superior to those obtained from other methods.

LI, Zhenning↗

NASA NTRS2001

Towards 100,000 CPU Cycle-Scavenging by Genetic Algorithms

We examine a web-centric design using standard tools such as web servers, web browsers, PHP, and mySQL. We also consider the applicability of Information Power Grid tools such as the Globus (no relation to the author) Toolkit. We intend to implement this architecture with JavaGenes running on at least two cycle-scavengers: Condor and United Devices. JavaGenes, a genetic algorithm code written in Java, will be used to evolve multi-species reactive molecular force field parameters.

Globus, Al↗

NASA NTRS2006

Development of a Genetic Algorithm to Automate Clustering of a Dependency Structure Matrix

Much technology assessment and organization design data exists in Microsoft Excel spreadsheets. Tools are needed to put this data into a form that can be used by design managers to make design decisions. One need is to cluster data that is highly coupled. Tools such as the Dependency Structure Matrix (DSM) and a Genetic Algorithm (GA) can be of great benefit. However, no tool currently combines the DSM and a GA to solve the clustering problem. This paper describes a new software tool that interfaces a GA written as an Excel macro with a DSM in spreadsheet format. The results of several test cases are included to demonstrate how well this new tool works.

Rogers, James L.↗

DOE OSTI2020

A genetic algorithm approach for reconstructing spectral content from filtered x-ray diode array spectrometers

Filtered diode array spectrometers are routinely employed to infer the temporal evolution of spectral power from x-ray sources, but uniquely extracting spectral content from a finite set of broad, spectrally overlapping channel spectral sensitivities is decidedly nontrivial in these under-determined systems. Here, we present the use of genetic algorithms to reconstruct a probabilistic spectral intensity distribution and compare to the traditional approach most commonly found in the literature. Unlike many of the previously published models, spectral reconstructions from this approach are neither limited by basis functional forms nor do they require a priori spectral knowledge. While the original intent of such measurements was to diagnose the temporal evolution of spectral power from quasi-blackbody radiation sources—where the exact details of spectral content were not thought to be crucial—we demonstrate that this new technique can greatly enhance the utility of the diagnostic by providing more physical spectra and improved robustness to hardware configuration for even strongly non-Planckian distributions.

47 OTHER INSTRUMENTATION↗

NASA NTRS1988

Robot path planning using a genetic algorithm

Robot path planning can refer either to a mobile vehicle such as a Mars Rover, or to an end effector on an arm moving through a cluttered workspace. In both instances there may exist many solutions, some of which are better than others, either in terms of distance traversed, energy expended, or joint angle or reach capabilities. A path planning program has been developed based upon a genetic algorithm. This program assumes global knowledge of the terrain or workspace, and provides a family of good paths between the initial and final points. Initially, a set of valid random paths are constructed. Successive generations of valid paths are obtained using one of several possible reproduction strategies similar to those found in biological communities. A fitness function is defined to describe the goodness of the path, in this case including length, slope, and obstacle avoidance considerations. It was found that with some reproduction strategies, the average value of the fitness function improved for successive generations, and that by saving the best paths of each generation, one could quite rapidly obtain a collection of good candidate solutions.

Cleghorn, Timothy F.↗

NASA NTRS2005

Retrieval of Dry Snow Parameters from Radiometric Data Using a Dense Medium Model and Genetic Algorithms

In this paper, GA-based techniques are used to invert the equations of an electromagnetic model based on Dense Medium Radiative Transfer Theory (DMRT) under the Quasi Crystalline Approximation with Coherent Potential to retrieve snow depth, mean grain size and fractional volume from microwave brightness temperatures. The technique is initially tested on both noisy and not-noisy simulated data. During this phase, different configurations of genetic algorithm parameters are considered to quantify how their change can affect the algorithm performance. A configuration of GA parameters is then selected and the algorithm is applied to experimental data acquired during the NASA Cold Land Process Experiment. Snow parameters retrieved with the GA-DMRT technique are then compared with snow parameters measured on field.

Tedesco, Marco↗

DOE OSTI2024

Progress in Genetic Algorithm Fitting of X-Ray Fluorescence Data for Absorption Spectroscopy of Liquid Surfaces

X-ray fluorescence (XRF) spectroscopy of liquid surfaces is a promising approach to elemental analysis of forensic samples. Elements in the mixture can be identified from the XRF data because chemical elements are associated with unique spectra. This report describes progress in the development of automated identification of unknown mixtures of elements from XRF spectra using a genetic algorithm (GA). The XRF spectra are measured at the Advanced Photon Source (APS) at the liquid-liquid interface during solvent extraction process. The usage of the GA is demonstrated and future implementation for related problems are then discussed.

47 OTHER INSTRUMENTATION↗

NASA NTRS1997

Simulating and Synthesizing Substructures Using Neural Network and Genetic Algorithms

The feasibility of simulating and synthesizing substructures by computational neural network models is illustrated by investigating a statically indeterminate beam, using both a 1-D and a 2-D plane stress modelling. The beam can be decomposed into two cantilevers with free-end loads. By training neural networks to simulate the cantilever responses to different loads, the original beam problem can be solved as a match-up between two subsystems under compatible interface conditions. The genetic algorithms are successfully used to solve the match-up problem. Simulated results are found in good agreement with the analytical or FEM solutions.

Liu, Youhua↗

NASA NTRS1996

DeMAID/GA USER'S GUIDE Design Manager's Aid for Intelligent Decomposition with a Genetic Algorithm

Many companies are looking for new tools and techniques to aid a design manager in making decisions that can reduce the time and cost of a design cycle. One tool that is available to aid in this decision making process is the Design Manager's Aid for Intelligent Decomposition (DeMAID). Since the initial release of DEMAID in 1989, numerous enhancements have been added to aid the design manager in saving both cost and time in a design cycle. The key enhancement is a genetic algorithm (GA) and the enhanced version is called DeMAID/GA. The GA orders the sequence of design processes to minimize the cost and time to converge to a solution. These enhancements as well as the existing features of the original version of DEMAID are described. Two sample problems are used to show how these enhancements can be applied to improve the design cycle. This report serves as a user's guide for DeMAID/GA.

Rogers, James L.↗

DOE OSTI2020

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗

DOE OSTI2022

Efficient Implementation of Artificial Neural Networks for Sensor Data Analysis Based on a Genetic Algorithm

The reliability of many industrial processes depends on the sensor system. However, these sensors can be affected by noise, perturbations and failures. Hence, sensor monitoring and diagnosis are fundamental to guarantee the quality of an industrial process. Nowadays, artificial neural networks (ANN) are widely used in sensor signal processing and diagnosis. However, those ANNs usually require many artificial neurons, being difficult to implement in software and hardware due to their high computational costs. This paper presents an optimized implementation of artificial neurons in ANNs for sensor data analysis using a Genetic Algorithm (GA). The objective of GA is to find an adequate segmentation to reduce the activation function approximation error. One of the advantages of the proposed approach is that the cost function used in GA considers the effect of factors such as the ANN architecture or the number of bits used in arithmetic operations. The proposed ANN implementation technique aims to get the best possible approximation for a specific ANN architecture, making easier its implementation in software and hardware. Simulation and experimental results using FPGA (Field Programmable Gate Array) prove the advantages of the proposed approach for implementing sensor data analysis systems based on ANNs.

D estefani, André↗