Search NASA⌕ Search

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.

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

At least 145 records · Page 8

Direct structural retrieval from gas-phase ultrafast diffraction data using a genetic algorithm

Ultrafast scattering techniques such as ultrafast electron diffraction and ultrafast x-ray diffraction have been utilized to elucidate the structural dynamics, reaction intermediates, and final products in molecular reactions following photoexcitation. The time-dependent structures are typically not directly retrieved from the experimental data, but they rely on comparison with calculations. The genetic algorithm (GA), a global optimization strategy, can be used to retrieve the molecular structures directly from diffraction patterns without any theoretical input. However, the robustness of the GA with respect to real experimental conditions such as a limited momentum transfer range, noise, and artifacts has not been studied in detail. In this work, we characterize the performance of the GA with simulated data that mimic realistic experimental conditions. We have developed and implemented a variant of the GA specific to diffraction measurements which performs better in the presence of imperfect data compared to the standard implementation of the GA. We demonstrate this method with both synthetic data and experimental ultrafast electron diffraction data on the UV-induced photodissociation of trifluoroiodomethane (C⁢F 3⁡ I) molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

Optimizing Fast Charging and Wetting in Lithium-Ion Batteries with Optimal Microstructure Patterns Identified by Genetic Algorithm

To sustain the high-rate current required for fast charging electric vehicle batteries, electrodes must exhibit sufficiently high effective ionic diffusion. Additionally, to reduce battery manufacturing costs, wetting time must decrease. Both of these issues can be addressed by structuring the electrodes with mesoscale pore channels. However, their optimal spatial distribution, or patterns, is unknown. Herein, a genetic algorithm has been developed to identify these optimal patterns using a CPU-cheap proxy distance-based model to evaluate the impact of the added pore networks. Both coin-cell and pouch cell form factors have been considered for the wetting analysis, with their respective electrolyte infiltration mode. Regular hexagonal and mud-crack-like patterns, respectively, for fast charging and fast wetting were found to be optimal and have been compared with pre-determined, easier to manufacture, patterns. The model predicts that using cylindrical channels arranged in a regular hexagonal pattern is ∼6.25 times more efficient for fast charging as compared to grooved lines with both structuring strategies being restricted to a 5% electrode total volume loss. The model also shows that only a very limited electrode volume loss (1%–2%) is required to dramatically improve the wetting (5–20 times) compared to an unstructured electrode.

25 ENERGY STORAGE↗

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗

GAAF: Searching Activation Functions for Binary Neural Networks Through Genetic Algorithm

Binary neural networks (BNNs) show promising utilization in cost and power-restricted domains such as edge devices and mobile systems. This is due to its significantly less computation and storage demand, but at the cost of degraded performance. To close the accuracy gap, in this paper we propose to add a complementary activation function (AF) ahead of the sign based binarization, and rely on the genetic algorithm (GA) to automatically search for the ideal AFs. These AFs can help extract extra information from the input data in the forward pass, while allowing improved gradient approximation in the backward pass. Fifteen novel AFs are identified through our GA-based search, while most of them show improved performance (up to 2.54% on ImageNet) when testing on different datasets and network models. Interestingly, periodic functions are identified as a key component for most of the discovered AFs, which rarely exist in human designed AFs. Our method offers a novel approach for designing general and application-specific BNN architecture.

59 BASIC BIOLOGICAL SCIENCES↗

Comprehensive Efficiency Analysis of Seven-Switch Current-Source Inverter Based on Voltage-Boost Function and Genetic Algorithm

This paper investigates the voltage-boost features of the emerging seven-switch current-source inverter (H7-CSI) to improve the efficiency of the CSI-based motor drive system. The switching transient and power loss model of the H7-CSI topology during voltage-boost operation are analyzed in detail. The effects of the boost function on the switching and conduction loss of the H7-CSI topology are investigated. A genetic algorithm has been introduced that makes it possible to optimize the H7-CSI’s modulation index to minimize its power loss. Experimental results for the H7-CSI unit show that this optimization can reduce the power loss by 10.6%.

42 ENGINEERING↗

Small bimetallic clusters Agn-1M (M = Au, Co, Cu, Ni, Pd, Pt; n = 3, 9, 15): Density functional theory and genetic algorithm

We investigated the effect of size and composition on the properties of bimetallic nanoclusters. The geometric structures, stabilities, and electronic properties of size-selected Ag n-1 M (M = Au, Co, Cu, Ni, Pd, Pt; n = 3, 9, 15) bimetallic nanoclusters are systematically analyzed using spin-polarized density functional theory (DFT) within the generalized gradient approximation (GGA). We determine the most stable geometries for these clusters using a genetic algorithm (GA) in combination with DFT. Our results show that doping pure silver clusters with an M atom (transition metal), referred to as a “guest atom”, increases the stability as compared to pure Ag n (n = 3, 9, 15) clusters. The results for various properties including formation energy per atom, electronic structure, magnetic moments, and vibrational density of states (VDOS) are evaluated as a function of both size and composition of the system. The adsorption of selected bimetallic clusters on hydroxylated alumina substrate shows weak binding and minor changes in geometric properties except for Ag 8 Pt.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comprehensive Efficiency Analysis of Current Source Inverter Based on CSI-Type Double Pulse Test and Genetic Algorithm

A current-source inverter (CSI) has a natural output voltage boost feature that can be advantageous for traction applications. Switching frequency is one of the easily-controlled variables that can be adjusted to improve the CSI efficiency at different operating points when the boost function is used. This paper investigates a CSI-based double-pulse test (DPT) measurement that mimics normal operation of the CSI. A loss model of the CSI is developed based on the CSI-type DPT experimental results. The impacts of the switching frequency and voltage boost ratio on the CSI efficiency and output voltage ripple are investigated. Based on the loss model, a genetic algorithm has been introduced that makes it possible to optimize the CSI's switching frequency and modulation index to maximize its efficiency under any desired operating condition.

current-source inverter, genetic algorithm, SPM ma↗

Genetic-algorithm retrieval of the molecular alignment distribution with high-order harmonics generated from transiently aligned CO 2 molecules

Using genetic algorithm, we propose a method to retrieve the alignment distribution of transiently aligned CO 2 molecules from the high-order harmonic generation (HHG) spectra. The retrieval method is based on the quantitative rescattering (QRS) model where averaged photorecombination transition dipole can be factored out from the parallel (or perpendicular) harmonic spectra after the propagation of the harmonic fields in the gas medium. We examine how the retrieved alignment distributions are affected by uncertainty in alignment dependent ionization probability and on multiple orbital contribution to the HHG. We further confirm that alignment distribution is more accurately retrieved by using the minima in the HHG spectra driven by a long-wavelength laser. In addition, we show that earlier experimental data on the ratios between the perpendicular and the parallel HHG components of aligned CO 2 molecules are in better agreement with the QRS model if the macroscopic propagation and multiple orbital interference are included in the theoretical calculation.

74 ATOMIC AND MOLECULAR PHYSICS↗

On-board autonomous attitude maneuver planning for planetary spacecraft using genetic algorithms

A key enabling technology that leads to greater spacecraft autonomy is the capability to autonomously and optimally slew the spacecraft from and to different attitudes while operating under a number of celestial and dynamic constraints. The task of finding an attitude trajectory that meets all the constraints is a formidable one, in particular for orbiting or fly-by spacecraft where the constraints and initial and final conditions are of time-varying nature. This paper presents an approach for attitude path planning that makes full use of a priori constraint knowledge and is computationally tractable enough to be executed on-board a spacecraft. The approach is based on incorporating the constraints into a cost function and using a Genetic Algorithm to iteratively search for and optimize the solution. This results in a directed random search that explores a large part of the solution space while maintaining the knowledge of good solutions from iteration to iteration. A solution obtained this way may be used 'as is' or as an initial solution to initialize additional deterministic optimization algorithms. A number of example simulations are presented including the case examples of a generic Europa Orbiter spacecraft in cruise as well as in orbit around Europa. The search times are typically on the order of minutes, thus demonstrating the viability of the presented approach. The results are applicable to all future deep space missions where greater spacecraft autonomy is required. In addition, onboard autonomous attitude planning greatly facilitates navigation and science observation planning, benefiting thus all missions to planet Earth as well.

genetic algorithm↗

RF design of APEX2 two-cell continuous-wave normal conducting photoelectron gun cavity based on multi-objective genetic algorithm

High brightness, high repetition rate electron beams are key components for optimizing the performance of next generation scientific instruments, such as MHz-class X-ray Free Electron Laser (XFEL) and Ultra-fast Electron Diffraction/Microscopy (UED/UEM). In the Advanced Photo-injector EXperiment (APEX)at Berkeley Lab, a photoelectron gun based on a 185.7 MHz normal conducting re-entrant RF cavity, has been proven to be a feasible solution to provide high brightness, high repetition rate electron beam for both XFEL and UED/UEM. Based on the success of APEX, a new electron gun system, named APEX2, has been under development to further improve the electron beam brightness. For APEX2, we have designed a new 162.5 MHz two-cell photoelectron gun and achieved a significant increase on the cathode launching field and the beam exit energy. For a fixed charge per bunch, these improvements will allow for the emittance reduction and hence to an increased beam brightness. The design of APEX2 gun cavity is a complex problem with multiple design goals and restrictions, some even competing each other. In conclusion, for a systematic and comprehensive search for the optimized cavity geometry, we have developed and implemented a novel optimization method based on the Multi-Objective Genetic Algorithm (MOGA).

47 OTHER INSTRUMENTATION↗

Modeling Wavelength Dependent Mid-infrared (5.5–25 μm) Optical Constants of Silicate Glasses: A Genetic Algorithm Approach

Wavelength-dependent mid-infrared (400–1,800 cm -1 ; 5.56–25 μm) optical constants (real and imaginary indices of refraction; n and k) are determined using reflectance spectra at a spectral sampling of 4 cm -1 for several silicate glasses of varying SiO 2 wt% which include (a) basaltic volcanic glass from Kilauea, Hawaii, (b) synthetic andesite, (c) two synthetic dacites, (d) obsidian volcanic glass from Mount Lassen, California, (e) synthetic rhyodacite, and (f) rhyolitic volcanic glass from Mexico. Because glasses are optically isotropic, no specific orientation was required for spectral measurements, and polished glass samples were measured at random orientations using micro-FTIR spectrometer. Lorentz-Lorenz dispersion theory and Fresnel reflectance model for high symmetry materials were used to model the optical constants by optimizing oscillator parameters in modeled spectra to match laboratory spectra. A genetic algorithm (GA) approach automatically finds the natural oscillators and their parameters for each spectrum, and then uses these parameters in a non-linear least squares optimization routine. The study compared spectral parameters such as Christiansen feature, reststrahlen bands (RBs), and the peaks centered around 860–1,100 (peak 1) and 400–480 cm -1 (peak 2) of n and k to their respective SiO 2 wt% of the glasses. CF, RBs, peak 1 of n and k, and peak 2 of n shift to higher wavenumbers with increased SiO 2 wt%, whereas peak 2 of k shifts to lower wavenumbers with increased SiO 2 wt%. Derived optical constants of these glasses will improve quantitative abundance mapping of volcanic materials on the surfaces of silicate targets in the Solar System.

58 GEOSCIENCES↗

Artificial intelligence based analysis of nanoindentation load–displacement data using a genetic algorithm

In this work, we developed an automated tool, Nanoindentation Neo package for the analysis of nanoindentation load–displacement curves using a Genetic Algorithm (GA) applied to the Oliver-Pharr method (Oliver et al.,1992). For some materials, such as polycrystalline isotropic graphites, Least Squares Fitting (LSF) of the unload curve can produce unrealistic fit parameters. These graphites exhibit sharply peaked unloading curves not easily fit using the LSF, which tends to overestimate the indenter tip geometry parameter. To tackle this problem, we extended our general materials characterization tool Neo for EXAFS analysis (Terry et al., 2021) to fit nanoindentation data. Nanoindentation Neo automatically processes and analyzes nanoindentation data with minimal user input while producing meaningful fit parameters. GA, a robust metaheuristic method, begins with a population of temporary solutions using model parameters called chromosomes; from these we evaluate a fitness value for each solution, and select the best solutions to mix with random solutions producing the next generation. A mutation operator then modifies existing solutions by random perturbations, and the optimal solution is selected. We tested the GA method using Silica and Al reference standards. We fit samples of graphite and a high entropy alloy (HEA) consisting of BCC and FCC phases.

42 ENGINEERING↗

Genetic Algorithm for Optimization: Preprocessing with n Dimensional Bisection and Error Estimation

A knowledge of the appropriate values of the parameters of a genetic algorithm (GA) such as the population size, the shrunk search space containing the solution, crossover and mutation probabilities is not available a priori for a general optimization problem. Recommended here is a polynomial-time preprocessing scheme that includes an n-dimensional bisection and that determines the foregoing parameters before deciding upon an appropriate GA for all problems of similar nature and type. Such a preprocessing is not only fast but also enables us to get the global optimal solution and its reasonably narrow error bounds with a high degree of confidence.

Sen, S. K.↗

Adsorption Hysteresis Under Control: Tuning Host–Guest Interactions via a Genetic Algorithm

Mesoporous adsorbent materials offer a large volumetric capacity; however, cyclic adsorption/desorption processes in these systems often suffer from hysteresis and may require a significant pressure swing to access this capacity. To mitigate hysteresis, a proposed strategy is to include nucleation sites on the walls of the mesoporous material to facilitate droplet and bubble formation, lowering the free energy barriers to the respective phase transitions. It is unclear, however, what combination of adsorbate− adsorbent interactions and spatial patterning would be beneficial for a given application, considering that improvements to some sorption properties may come at the expense of other attributes. To understand these interconnected observables, we examine two model systems, planar-slit and cylindrical pores with tunable interaction sites, using GPU-accelerated transition matrix Monte Carlo simulations. The simulations provide a free energy map of the pressure−adsorption space in a matter of minutes, which we use to track adsorption isotherm characteristics as a function of adsorbent properties. We then leverage the rapid acquisition of simulation data to construct a genetic algorithm to iteratively modify interaction sites of the slit-pore wall to minimize the hysteresis of this system without sacrificing uptake. We find that the adsorption branch of the isotherm is easily modulated via the average host−guest interaction strength, but desorption is only adjustable if there is a suitable bubble nucleation site. Within the context of a slit-pore system, we identify relative interaction strengths and patch sizes required to gain control over both branches of the hysteresis loop.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

Janich, Karl W.↗

New Calabi–Yau manifolds from genetic algorithms

Calabi–Yau manifolds can be obtained as hypersurfaces in toric varieties built from reflexive polytopes. We generate reflexive polytopes in various dimensions using a genetic algorithm. As a proof of principle, we demonstrate that our algorithm reproduces the full set of reflexive polytopes in two and three dimensions, and in four dimensions with a small number of vertices and points. Motivated by this result, we construct five-dimensional reflexive polytopes with the lowest number of vertices and points. By calculating the normal form of the polytopes, we establish that many of these are not in existing datasets and therefore give rise to new Calabi–Yau four-folds. In some instances, the Hodge numbers we compute are new as well.

Astronomy & Astrophysics↗