Search NASA⌕ Search

SEARCH · Search NASA

Results for “Genetic 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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Genetic Algorithm-Based Commutation Angle Control for Torque Ripple Mitigation in Switched Reluctance Motor Drives

This work addresses the application of the Genetic Algorithm (GA) technique to optimize the commutation angles of a 2 kW 8/6 switched reluctance machine (SRM). The primary goal is to reduce the well-known drawback of SRMs: the torque ripple. Firstly, the machine was modeled in Matlab /Simulink ® using lookup tables obtained via finite element method (FEM) simulations. Subsequently, the model was used to perform the GA routine aiming to find the optimal phase commutation angles that minimize the torque ripple factor. Notably, the torque performance of the SRM was significantly affected by the commutation angles during the search for the optimal solution. Afterwards, the GA results for four different operation points were verified experimentally through a developed drive platform with digital signal processor-based (DSP) control and an asymmetric bridge converter. As showed by the experiments, the proposed approach was suitable to reduce the torque ripple by more than 50% for one of the evaluated operating points. Furthermore, it was confirmed that the torque ripple mitigation led to acoustic noise improvement.

42 ENGINEERING↗
DOE OSTI2020

Finite-Temperature Structures of Supported Subnanometer Catalysts Inferred via Statistical Learning and Genetic Algorithm-Based Optimization

Single-atom catalysts (SACs) minimize noble metal utilization and can alter the activity and selectivity of supported metal nanoparticles. However, the morphology of active centers, including single atoms and subnanometer clusters of a few atoms, remains elusive due to experimental challenges. The computational cost to describe numerous cluster shapes and sizes makes direct first-principles calculations impractical. We present a computational framework to enable structure determination for single-atom and subnanometer cluster catalysts. As a case study, we obtained the low energy structures of Pd n (n = 1-21) clusters supported on CeO 2 (111), which are critical components of automobile three-way catalysts. Trained on density functional theory data, a three-dimensional cluster expansion is established using statistical learning to describe the Hamiltonian and predict energies of supported Pdn clusters of any structure. Low energy stable and metastable structures are identified using a Metropolis Monte Carlo-based genetic algorithm in the canonical ensemble at 300 K. We observe that supported single atoms sinter to form bilayer clusters and large cluster isomers share similarities in both shape and energy, and elucidate the significance of the support and microstructure on cluster stability. We discovered a simple surrogate structure-energy model, where the energy per atom scales with the square root of the average first coordination number, which can be used to estimate energies and compare the stability of clusters. Our framework, applicable to any metal/support system, fills an important methodological gap to predict the stability of supported metal catalysts in the subnanometer regime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

A modular GUI-based program for genetic algorithm-based feedback-assisted wavefront shaping

Abstract We have developed a modular graphical user interface (GUI)-based program for use in genetic algorithm-based feedback-assisted wavefront shaping. The program uses a class-based structure to separate out the universal modules (e.g. GUI, multithreading, optimization algorithms) and hardware-specific modules (e.g. code for different SLMs and cameras). This modular design makes the program easily adaptable to a wide range of lab equipment, while providing easy access to a GUI, multithreading, and three optimization algorithms (phase-stepping, simple genetic, and microgenetic).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Revealing Urban Morphology and Outdoor Comfort through Genetic Algorithm-Driven Urban Block Design in Dry and Hot Regions of China

In areas with a dry and hot climate, factors such as strong solar radiation, high temperature, low humidity, dazzling light, and dust storms can tremendously reduce people’s thermal comfort. Therefore, researchers are paying more attention to outdoor thermal comfort in urban environments as part of urban design. This study proposed an automatic workflow to optimize urban spatial forms with the aim of improvement of outdoor thermal comfort conditions, characterized by the universal thermal climate index (UTCI). A city with a dry and hot climate—Kashgar, China—is further selected as an actual case study of an urban block and Rhino & Grasshopper is the platform used to conduct simulation and optimization process with the genetic algorithm. Results showed that in summer, the proposed method can reduce the averaged UTCI from 31.17 to 27.43 °C, a decrease of about 3.74 °C, and reduce mean radiation temperature (MRT) from 43.94 to 41.29 °C, a decrease of about 2.65 °C.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Robust Importance Sampling for Bayesian Model Calibration with Spatio-Temporal Data

This paper addresses two challenges in Bayesian calibration: 1) computational speed of existing sampling algorithms, and 2) calibration with spatio-temporal responses. The commonly used Markov Chain Monte Carlo (MCMC) approaches require many sequential model evaluations making the computational expense prohibitive. This paper proposes an efficient sampling algorithm: iterative importance sampling with genetic algorithm (IISGA). While iterative importance sampling enables computational efficiency, the genetic algorithm enables robustness by preventing sample degeneration and avoids getting stuck in multimodal search spaces. An inflated likelihood further enables robustness in high-dimensional parameter spaces by enlarging the target distribution. Spatio-temporal data complicate both surrogate modeling, which is necessary for expensive computational models, and the likelihood estimation. In this work, singular value decomposition is investigated for reducing the high-dimensional field data to a lower-dimensional space prior to Bayesian calibration. Then the likelihood is formulated and Bayesian inference is performed in the lower-dimension, latent space. An illustrative example is provided to demonstrate IISGA relative to existing sampling methods, and then IISGA is employed to calibrate a thermal battery model with 26 uncertain calibration parameters and spatio-temporal response data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

CrowdPhase: crowdsourcing the phase problem

The idea of attacking the phase problem by crowdsourcing is introduced. Using an interactive, multi-player, web-based system, participants work simultaneously to select phase sets that correspond to better electron-density maps in order to solve low-resolution phasing problems. The human mind innately excels at some complex tasks that are difficult to solve using computers alone. For complex problems amenable to parallelization, strategies can be developed to exploit human intelligence in a collective form: such approaches are sometimes referred to as ‘crowdsourcing’. Here, a first attempt at a crowdsourced approach for low-resolution ab initio phasing in macromolecular crystallography is proposed. A collaborative online game named CrowdPhase was designed, which relies on a human-powered genetic algorithm, where players control the selection mechanism during the evolutionary process. The algorithm starts from a population of ‘individuals’, each with a random genetic makeup, in this case a map prepared from a random set of phases, and tries to cause the population to evolve towards individuals with better phases based on Darwinian survival of the fittest. Players apply their pattern-recognition capabilities to evaluate the electron-density maps generated from these sets of phases and to select the fittest individuals. A user-friendly interface, a training stage and a competitive scoring system foster a network of well trained players who can guide the genetic algorithm towards better solutions from generation to generation via gameplay. CrowdPhase was applied to two synthetic low-resolution phasing puzzles and it was shown that players could successfully obtain phase sets in the 30° phase error range and corresponding molecular envelopes showing agreement with the low-resolution models. The successful preliminary studies suggest that with further development the crowdsourcing approach could fill a gap in current crystallographic methods by making it possible to extract meaningful information in cases where limited resolution might otherwise prevent initial phasing.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Crystal Structure Prediction of Binary Alloys via Deep Potential

Predicting crystal structure has been a challenging problem in physics and materials science for a long time. A reliable energy calculation engine combined with an efficient global search algorithm, such as particle swarm optimization algorithm or genetic algorithm, is needed to conduct crystal structure prediction. In recent years, machine learning-based interatomic potential energy surface models have been proposed, potentially allowing us to perform crystal structure prediction for systems with the accuracy of density functional theory (DFT) and the speed of empirical force fields. In this paper, we employ a previously developed Deep Potential model to predict the intermetallic compound of the aluminum–magnesium system, and find six meta-stable phases with negative or nearly zero formation energy. In particular, Mg 12 Al 8 shows excellent ductility and Mg 5 Al 27 has a high Young's modulus. Based on our benchmark results, we propose a relatively robust structure screening criterion that selects potentially stable structures from the Deep Potential-based convex hull and performs DFT refinement. By using this criterion, the computational cost needed to construct the convex hull with ab initio accuracy can be dramatically reduced.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Visualization System for Evolutionary Neural Networks for Deep Learning

Deep learning is actively used in a wide range of fields for scientific discovery. To effectively apply deep learning to a particular problem, it is important to select an appropriate network architecture and other hyper-parameters (at each layer). Evolving architectures and hyper-parameters using a genetic algorithm is one current approach to search the huge space of all possible configurations to find those more optimal for the problem. However, examining an evolutionary process and tuning the genetic algorithm are challenging, pushing most users to treat the process as a black box. To address this challenge, we propose a visualization system for evolutionary neural networks for deep learning. The key feature of our visualization system is to provide a visual analytics environment for evaluating a genetic algorithm in order to improve the underlying operations to reduce time to find good solutions. Our system is able to not only visualize how a genetic algorithm traverses its search space but also allows users to examine evolving networks in-depth to get insights to improve performance through interactive visualization components.

Chae, Junghoon↗
DOE OSTI2018

Prediction of perovskite and other ternary oxide multilayers as mirrors for soft X-rays

Highlights: • Theoretical framework to identify optimal multilayers for high x-ray reflectivity. • Perovskite oxide multilayers are proposed as soft x-ray mirrors. • High soft x-ray reflectivity up to 33% are expected in perovskite multilayers. - Abstract: We propose multilayers of perovskite and related ternary oxides with a general formula of ABO{sub 3} as high reflectivity mirrors, especially for use in water window region (2.3–4.4 nm). The high reflectivity combinations of oxide multilayers were deduced using evolutionary search algorithms such as genetic algorithms, and the calculation speed was accelerated via parallel computing methods We also propose a figure of merit for X-ray reflectivity in periodic multilayers systems, which can simplify the future efforts on identifying material combinations, and the search through this multi-dimensional parameter space. The highest reflectivity value was found to be over 33% at 3.1 nm in the water window region. The effect of interface roughness was simulated and the decrease in reflectivity was found to be modest for practically achievable roughness values. This work establishes the foundation for future experimental and theoretical studies towards achieving high reflectivity x-ray mirrors of complex oxide multilayers.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Implementation of fuel management multi-cycle optimization capabilities in RAVEN optimization framework

Optimization in nuclear fuel-management assists the core reload engineer with finding optimal out-of-core and in-core strategies. RAVEN is INL’s open source software that is equipped with fuel-management optimization capabilities including single-cycle, single- and multi-objective optimization of pressurized water reactors (PWRs) loading patterns (LP) of a fresh core using genetic algorithm (GA) and non-dominated sorting genetic algorithm (NSGA-II). In practice, however, medium and long term planning of fuel-management needs a multi-cycle approach, where the history and availability of fuel assemblies is considered in the optimization process. In this paper, we present a description of an initial expansion of RAVEN fuel-management optimization capabilities for a multi-cycle optimization framework. N-th cycle optimization capabilities that account for the unique history of recycled fuel assembly in the core were added. The multi-cycle optimization approach taken is formulated as a cycle-wise optimization problem where out-of-core decisions are used to onset each cycle optimization. Out-of-core decisions are managed externally to the in-core optimization by a fuel inventory management module. A proof-of-concept optimization problem is also presented.

42 - ENGINEERING↗
DOE OSTI2022

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks: Preprint

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution systems use to prepare for extreme events is to form multiple microgrids and thereby isolate themselves from the grid supply by using local generation as much as possible to supply critical loads. But partitioning an existing system into multiple feasible islands capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithmbased approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, USA.

edge elimination↗
DOE OSTI2013

Optimal design at inner core of the shaped pyramidal truss structure

Sandwich material is a type of composite material with lightweight, high strength, good dynamic properties and high bending stiffness-to-weight ratio. This can be found well such structures in the nature (for example, internal structure of bones, plants, etc.). New trend which prefers eco-friendly products and energy efficiency is emerging in industries recently. Demand for materials with high strength and light weight is also increasing. In line with these trends, researches about manufacturing methods of sandwich material have been actively conducted. In this study, a sandwich structure named as “Shaped Pyramidal Truss Structure” is proposed to improve mechanical strength and to apply a manufacturing process suitable for massive production. The new sandwich structure was designed to enhance compressive strength by changing the cross-sectional shape at the central portion of the core. As the next step, optimization of the shape was required. Optimization technique used here was the SZGA(Successive Zooming Genetic Algorithm), which is one of GA(Genetic Algorithm) methods gradually reducing the area of design variable. The objective function was defined as moment of inertia of the cross-sectional shape of the strut. The control points of cubic Bezier curve, which was assumed to be the shape of the cross section, were used as design variables. By using FEM simulation, it was found that the structure exhibited superior mechanical properties compared to the simple design of the prior art.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Intelligent Reservoir Generation for Liquid State Machines using Evolutionary Optimization

Neuromorphic Computing is a burgeoning field of research. Many groups are exploring hardware architectures and theoretical ideas about spiking recurrent neural networks. The overarching goal is to exploit the low power promise of these neuromorphic systems. However, it is difficult to train spiking recurrent neural networks (SRNNs) to perform tasks and make efficient use of neuromorphic hardware. Reservoir Computing is an attractive methodology because it requires no tuning of weights for the reservoir itself. Yet, to find optimal reservoirs, manual tuning of hyperparameters such as hidden neurons, synaptic density, and natural structure is still required. Because of this, researchers often have to generate and evaluate many networks, which can result in non-trivial amounts of computation. This paper employs the reservoir computing technique (specifically liquid state machines) and genetic algorithms in order to develop useful networks that can be deployed on neuromorphic hardware. We build on past work in reservoir computing and genetic algorithms to demonstrate the power of combining these two techniques and the advantage it can provide over manually tuning reservoirs for use on classification tasks. We discuss the complexities of determining whether or not to use the genetic algorithms approach for liquid state machine generation.

Reynolds, John↗
DOE OSTI2013

Improving experimental phases for strong reflections prior to density modification

A genetic algorithm has been developed to optimize the phases of the strongest reflections in SIR/SAD data. This is shown to facilitate density modification and model building in several test cases. Experimental phasing of diffraction data from macromolecular crystals involves deriving phase probability distributions. These distributions are often bimodal, making their weighted average, the centroid phase, improbable, so that electron-density maps computed using centroid phases are often non-interpretable. Density modification brings in information about the characteristics of electron density in protein crystals. In successful cases, this allows a choice between the modes in the phase probability distributions, and the maps can cross the borderline between non-interpretable and interpretable. Based on the suggestions by Vekhter [Vekhter (2005 ▶), Acta Cryst. D61, 899–902], the impact of identifying optimized phases for a small number of strong reflections prior to the density-modification process was investigated while using the centroid phase as a starting point for the remaining reflections. A genetic algorithm was developed that optimizes the quality of such phases using the skewness of the density map as a target function. Phases optimized in this way are then used in density modification. In most of the tests, the resulting maps were of higher quality than maps generated from the original centroid phases. In one of the test cases, the new method sufficiently improved a marginal set of experimental SAD phases to enable successful map interpretation. A computer program, SISA, has been developed to apply this method for phase improvement in macromolecular crystallography.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Data‐driven identification of environmental variables influencing phenotypic plasticity to facilitate breeding for future climates

Summary Phenotypic plasticity describes a genotype's ability to produce different phenotypes in response to different environments. Breeding crops that exhibit appropriate levels of plasticity for future climates will be crucial to meeting global demand, but knowledge of the critical environmental factors is limited to a handful of well‐studied major crops. Using 727 maize ( Zea mays L.) hybrids phenotyped for grain yield in 45 environments, we investigated the ability of a genetic algorithm and two other methods to identify environmental determinants of grain yield from a large set of candidate environmental variables constructed using minimal assumptions. The genetic algorithm identified pre‐ and postanthesis maximum temperature, mid‐season solar radiation, and whole season net evapotranspiration as the four most important variables from a candidate set of 9150. Importantly, these four variables are supported by previous literature. After calculating reaction norms for each environmental variable, candidate genes were identified and gene annotations investigated to demonstrate how this method can generate insights into phenotypic plasticity. The genetic algorithm successfully identified known environmental determinants of hybrid maize grain yield. This demonstrates that the methodology could be applied to other less well‐studied phenotypes and crops to improve understanding of phenotypic plasticity and facilitate breeding crops for future climates.

Kusmec, Aaron↗
DOE OSTI2016

Holistic Portfolio Optimization using Directed Mutations

Genetic algorithms provide attractive options for performing nonlinear multi-objective combinatorial design optimization, and they have proven very useful for optimizing individual systems. However, conventional genetic algorithms fall short when performing holistic portfolio optimizations in which the decision variables also include the integer counts of multiple system types over multiple time periods. When objective functions are formulated as analytic functions, we can formally differentiate with respect to system counts and use the resulting gradient information to generate favorable mutations in the count variables. We apply several variations on this basic idea to an idealized hanging chain example to obtain >> 1000x speedups over conventional genetic algorithms in both single - and multi-objective cases. We develop a more complex example of a notional military portfolio that includes combinatorial design variables and dependency constraints between the design choices. In this case, our initial results are mixed, but many variations are still open to further research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Supporting mobile WEEE collection on demand: A method for multi-criteria vehicle routing, loading and cost optimisation

Highlights: • Multi-criteria method of WEEE mobile collection on demand. • Vehicle routing and loading problem included in the model and algorithm. • Optimisation of collecting vehicles routes including genetic algorithms and fuzzy logic. • Case study for heterogeneous fleet of collection vehicles for medium size city in Poland. • Possible application in a software supporting waste collection on demand. - Abstract: The task of increasing collection rates of waste electrical and electronic equipment (WEEE) is an important challenge in the global economy, and especially in the European Union where stiffer collection targets set out in a new WEEE directive are to be effective by 2019. As the circular economy approach replaces the linear model, resource recycling activities become a priority in waste management policy. As new techniques and possibilities of waste collection systems emerge, opportunities are created for improving efficiency for collection companies and affording benefits for the environment. A model proposed for mobile WEEE collection in this study considers a multi-criteria approach in developing a cost efficient method for pick up on demand from residents or electrical and electronic equipment (EEE) stores. The algorithm used in this model optimises vehicle routes and helps in selecting a number of vehicles from a heterogeneous fleet, incorporating the WEEE loading problem. Using genetic algorithm and fuzzy logic, this model optimises costs and resources required to complete the WEEE collection assuring timely pick up of the waste equipment. The numerical model is verified in a case study in Opole, a city in the south of Poland. The results show that the proposed model can handle the multiple parameter optimisation problem including operational costs, efficient use of vehicles from a fleet, efficient waste loading in vehicles and residents' satisfaction with timely pick up of the waste equipment from a household. Such system can be successfully applied even for large cities. The algorithm provides an opportunity for writing software or mobile apps design to be used by WEEE collection companies.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗