Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 505 records · Page 28

Soft computing methods in design of superalloys

Soft computing techniques of neural networks and genetic algorithms are used in the design of superalloys. The cyclic oxidation attack parameter K(sub a), generated from tests at NASA Lewis Research Center, is modeled as a function of the superalloy chemistry and test temperature using a neural network. This model is then used in conjunction with a genetic algorithm to obtain an optimized superalloy composition resulting in low K(sub a) values.

Cios, K. J.↗

Design of the VISITOR Tool: A Versatile ImpulSive Interplanetary Trajectory OptimizeR

The design of trajectories for interplanetary missions represents one of the most complex and important problems to solve during conceptual space mission design. To facilitate conceptual mission sizing activities, it is essential to obtain sufficiently accurate trajectories in a fast and repeatable manner. To this end, the VISITOR tool was developed. This tool modularly augments a patched conic MGA-1DSM model with a mass model, launch window analysis, and the ability to simulate more realistic arrival and departure operations. This was implemented in MATLAB, exploiting the built-in optimization tools and vector analysis routines. The chosen optimization strategy uses a grid search and pattern search, an iterative variable grid method. A genetic algorithm can be selectively used to improve search space pruning, at the cost of losing the repeatability of the results and increased computation time. The tool was validated against seven flown missions: the average total mission (Delta)V offset from the nominal trajectory was 9.1%, which was reduced to 7.3% when using the genetic algorithm at the cost of an increase in computation time by a factor 5.7. It was found that VISITOR was well-suited for the conceptual design of interplanetary trajectories, while also facilitating future improvements due to its modular structure.

Corpaccioli, Luca↗

Co-Optimization of CO 2 -EOR and Storage Processes in Mature Oil Reservoirs

This article presents an optimization methodology for CO 2 enhanced oil recovery in partially depleted reservoirs. A field-scale compositional reservoir flow model was developed for assessing the performance history of an active CO 2 flood and for optimizing both oil production and CO 2 storage in the Farnsworth Unit (FWU), Ochiltree County, Texas. A geological framework model constructed from geophysical, geological, and engineering data acquired from the FWU was the basis for all reservoir simulations and the optimization method. An equation of state was calibrated with laboratory fluid analyses and subsequently used to predict the thermodynamic minimum miscible pressure (MMP). Initial history calibrations of primary, secondary and tertiary recovery were conducted as the basis for the study. After a good match was achieved, an optimization approach consisting of a proxy or surrogate model was constructed with a polynomial response surface method (PRSM). The PRSM utilized an objective function that maximized both oil recovery and CO 2 storage. Experimental design was used to link uncertain parameters to the objective function. Control variables considered in this study included: water alternating gas cycle and ratio, production rates and bottom-hole pressure of injectors and producers. Other key parameters considered in the modeling process were CO 2 purchase, gas recycle and addition of infill wells and/or patterns. The PRSM proxy model was ‘trained’ or calibrated with a series of training simulations. This involved an iterative process until the surrogate model reached a specific validation criterion. A sensitivity analysis was first conducted to ascertain which of these control variables to retain in the surrogate model. A genetic algorithm with a mixed-integer capability optimization approach was employed to determine the optimum developmental strategy to maximize both oil recovery and CO 2 storage. The proxy model reduced the computational cost significantly. The validation criteria of the reduced order model ensured accuracy in the dynamic modeling results. The prediction outcome suggested robustness and reliability of the genetic algorithm for optimizing both oil recovery and CO 2 storage. The reservoir modeling approach used in this study illustrates an improved approach to optimizing oil production and CO 2 storage within partially depleted oil reservoirs such as FWU. Lastly, this study may serve as a benchmark for potential CO 2 –EOR projects in the Anadarko basin and/or geologically similar basins throughout the world.

02 PETROLEUM↗

Systems Engineering Design Via Experimental Operation Research: Complex Organizational Metric for Programmatic Risk Environments (COMPRE)

Unique and innovative graph theory, neural network, organizational modeling, and genetic algorithms are applied to the design and evolution of programmatic and organizational architectures. Graph theory representations of programs and organizations increase modeling capabilities and flexibility, while illuminating preferable programmatic/organizational design features. Treating programs and organizations as neural networks results in better system synthesis, and more robust data modeling. Organizational modeling using covariance structures enhances the determination of organizational risk factors. Genetic algorithms improve programmatic evolution characteristics, while shedding light on rulebase requirements for achieving specified technological readiness levels, given budget and schedule resources. This program of research improves the robustness and verifiability of systems synthesis tools, including the Complex Organizational Metric for Programmatic Risk Environments (COMPRE).

Mog, Robert A.↗

GBOpt: Grain boundary structure optimization using Monte Carlo and evolutionary algorithms

Polycrystalline materials are made of many small crystals separated by grain boundaries (GBs), whose atomic structure strongly influences material properties. Because the structure of a GB determines its properties, the optimal structure must be known in order to determine those impacts. There are many ways of placing atoms in the GB region, but the optimal structure is defined as the one that gives the lowest value of a target property (typically energy). GB structure optimization has been successfully demonstrated using stochastic and evolutionary methods, but no reusable, community-maintained open-source workflow has been developed. GBOpt (Grain Boundary Optimization) is an open-source Python package that creates that workflow, where we have presently implemented two approaches: Markov Chain Monte Carlo, and genetic algorithm based on elite selection. We demonstrate this capability by successfully reproducing the known optimal structures of a specific GB in two materials, and point interested readers to the GitHub repository for additional examples, including optimization for different properties. Both of the implemented approaches recovered the known structures, with the genetic algorithm approach finding the optimal structure faster on average.

99 - GENERAL AND MISCELLANEOUS↗

Designing a Unique Single Point Cross Over Method

The idea behind genetic algorithms is to extract optimization strategies nature uses successfully - known as Darwinian Evolution - and transform them for application in mathematical optimization theory to find the global optimum in a defined phase space. One could imagine a population of individual 'explorers' sent into the optimization phase-space. Each explorer is defined by its genes, what means, its position inside the phase-space is coded in his genes. Every explorer has the duty to find a value of the quality of his position in the phase space. (Consider the phase-space being a number of variables in some technological process, the value of quality of any position in the phase space - in other words: any set of the variables - can be expressed by the yield of the desired chemical product.) Then the struggle of 'life' begins. The three fundamental principles are selection, mating/crossover, and mutation. Only explorers (= genes) sitting on the best places will reproduce and create a new population. This is performed in the second step (mating/crossover). The 'hope' behind this part of the algorithm is, that 'good' sections of two parents will be recombined to yet better fitting children. In fact, many of the created children will not be successful (as in biological evolution), but a few children will indeed fulfill this hope. These good sections are named in some publications as building blocks. Now there appears a problem. Repeating these steps, no new area would be explored. The two former steps would only exploit the already known regions in the phase space, which could lead to premature convergence of the algorithm with the consequence of missing the global optimum by exploiting some local optimum. The third step, mutation, ensures the necessary accidental effects. One can imagine the new population being mixed up a little bit to bring some new information into this set of genes. Whereas in biology a gene is described as a macro-molecule with four different bases to code the genetic information, a gene in genetic algorithms is usually defined as a bitstring (a sequence of b 1's and 0's).

Wilson, Richard Phillip↗

“Teamwork Makes the Dream Work”: Tribal Competition Evolutionary Search as a Surrogate for Free-Energy-Based Structural Predictions

Crystal structure prediction has been a grand challenge in material science owing to the large configurational space that one must explore. Evolutionary (genetic) algorithms coupled with first principles calculations are commonly used in crystal structure prediction to sample the ground and metastable states of materials based on configurational energies. However, crystal structure predictions at finite temperature (T), pressure (P), and composition (X) require a free-energy-based search that is often computationally expensive and tedious. Here in this paper, we introduce a new machine-learning workflow for structure prediction that is based on a concept inspired by the evolution of human tribes in primitive society. Our tribal genetic algorithm (GA) combines configurational sampling with evolutionary optimization to accurately predict entropically stabilized phases at finite (T, P, X), at a computational cost that is an order of magnitude smaller than that required for a free-energy-based search. In a departure from standard GA techniques, the populations of individuals are divided into multiple tribes based on a bond-order fingerprint, and genetic operations are modified to ensure that cluster configurations are sampled adequately to capture entropic contributions. Team competition introduced into the evolutionary process allows winning teams (representing a better set of individuals) to expand their sizes; this translates into a more expanded search of the phase space allowing us to explore solutions near possible global minimum. Each team explores a specific section of the structural phase space and avoids bias on solutions arising from the use of individual populations in a purely energy-based search. We demonstrate the efficacy of our approach by performing the structural prediction of a representative two-dimensional two-body system as well as Lennard-Jones clusters over a range of temperatures up to its melting point. Our approach outperforms the standard GA approaches and enables structural search under “real nonambient conditions” on both bulk systems and finite-sized clusters.

36 MATERIALS SCIENCE↗

Discovery of a metastable Al{sub 20}Sm{sub 4} phase

We present an efficient genetic algorithm, integrated with experimental diffraction data, to solve a nanoscale metastable Al{sub 20}Sm{sub 4} phase that evolves during crystallization of an amorphous magnetron sputtered Al{sub 90}Sm{sub 10} alloy. The excellent match between calculated and experimental X-ray diffraction patterns confirms an accurate description of this metastable phase. Molecular dynamic simulations of crystal growth from the liquid phase predict the formation of disordered defects in the devitrified crystal.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Genetically Engineered Microelectronic Infrared Filters

A genetic algorithm is used for design of infrared filters and in the understanding of the material structure of a resonant tunneling diode. These two components are examples of microdevices and nanodevices that can be numerically simulated using fundamental mathematical and physical models. Because the number of parameters that can be used in the design of one of these devices is large, and because experimental exploration of the design space is unfeasible, reliable software models integrated with global optimization methods are examined The genetic algorithm and engineering design codes have been implemented on massively parallel computers to exploit their high performance. Design results are presented for the infrared filter showing new and optimized device design. Results for nanodevices are presented in a companion paper at this workshop.

Cwik, Tom↗

Automated Synthesis of Architecture of Avionic Systems

The Architecture Synthesis Tool (AST) is software that automatically synthesizes software and hardware architectures of avionic systems. The AST is expected to be most helpful during initial formulation of an avionic-system design, when system requirements change frequently and manual modification of architecture is time-consuming and susceptible to error. The AST comprises two parts: (1) an architecture generator, which utilizes a genetic algorithm to create a multitude of architectures; and (2) a functionality evaluator, which analyzes the architectures for viability, rejecting most of the non-viable ones. The functionality evaluator generates and uses a viability tree a hierarchy representing functions and components that perform the functions such that the system as a whole performs system-level functions representing the requirements for the system as specified by a user. Architectures that survive the functionality evaluator are further evaluated by the selection process of the genetic algorithm. Architectures found to be most promising to satisfy the user s requirements and to perform optimally are selected as parents to the next generation of architectures. The foregoing process is iterated as many times as the user desires. The final output is one or a few viable architectures that satisfy the user s requirements.

Chau, Savio↗

Filament-induced breakdown spectroscopy signal enhancement using optical wavefront control

Filament-induced breakdown spectroscopy (FIBS) is an analytical method that holds significant promise for remote sensing. In FIBS, it is desirable to maximize the intensity and improve the reproducibility of a selected spectroscopic feature. Here, we demonstrate the use of wavefront control in conjunction with a genetic algorithm in FIBS of metallic copper and show that this approach can increase the efficacy of filament-induced breakdown signal production. Through wavefront optimization, we enhance the intensity of a chosen characteristic spectroscopic feature of copper by a factor of approximately 3 when performing filamentation over a 1-meter distance. The relative standard deviation of signal intensity is reduced from ~17% to ~12% after optimization. We find that modification of the wavefront by introduction of astigmatism and coma maximizes the signal intensity, and these aberrations appear in two distinct trials of the genetic algorithm. We compare these findings to previous work on multiple filament control and discuss the possible mechanisms that lead to signal enhancement associated with both the beam amplitude and phase profile. A broader use of wavefront control with feedback may improve the performance of FIBS in remote sensing applications.

42 ENGINEERING↗

Genetic Optimization of a Tensegrity Structure

Marshall Space Flight Center (MSFC) is charged with developing advanced technologies for space telescopes. The next generation of space optics will be very large and lightweight. Tensegrity structures are built of compressive members (bars), and tensile members (strings). For most materials, the tensile strength of a longitudinal member is larger than its buckling strength; therefore a large stiffness to mass ratio can be achieved by increasing the use of tensile members. Tensegrities are the epitome of lightweight structures, since they take advantage of the larger tensile strength of materials. The compressive members of tensegrity structures are disjoint allowing compact storage of the structure. The structure has the potential to eliminate the requirement for assembly by man in space; it can be deployed by adjustments in its cable tension. A tensegrity structure can be more reliably modeled since none of the individual members experience bending moments. (Members that experience deformation in more than one dimension are much harder to model.) Structures that can be more precisely modeled can be more precisely controlled. Furthermore, an astoundingly wide variety of natural systems, including carbon atoms, water molecules, proteins, viruses, cells, tissues and even human and other living creatures are tensegrity structures. Through the process of evolution, nature continually improves the design of living creatures for the environment they live in. Since tensegrities are nature's structure of choice, it is conceivable that they have other benefits we are unaware of. A. Keane and S. Brown designed a satellite boom truss system with an enhanced vibration performance. They started with a standard truss system, then used a genetic algorithm to alter the design, while optimizing the vibration performance. An improvement of over 20,000% in frequency-averaged energy levels was obtained using this approach. In this report an introduction to tensegrity structures is given, along with a description of how to generate the nodal coordinates and connectivity of a multiple stage cylindrical tensegrity structure. A description of how finite elements can be used to develop a stiffness and mass matrix so that the modes of vibration can be determined from the eigenvalue problem is shown. A brief description of a micro genetic algorithm is then presented.

Jaime R. Taylor↗

Evolutionary computation algorithms to coordinating order acceptance and batch delivery for an integrated supply chain scheduling

This paper proposes a novel approach of coordinating decisions in an integrated supply chain (ISC): coordinating order acceptance (OA) and batch delivery (BD) due to round trip transportation (RTT) and using third-party logistics (3PL) vehicles. The paper aims at trading off among accepted orders revenue, delivery costs as well as any penalties incurred in the ISC to maximize the total benefit. A novel mixed-integer programming is proposed for the problem. In addition, the paper provides a heuristic to form batches and develops a hybrid evolutionary computation algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA) to solve the problem. An information sharing mechanism is improved and applied. To explore and to locate the proposed PSO in a better neighborhood, a local search is proposed. Taguchi experimental design is utilized to set the appropriate values of the algorithms’ parameters and random instances are generated to evaluate the performance of the algorithms. The paper investigates the profitability sensitivity of the problem to parameters and analyzes the effect of the changes in the parameters on the performance of our proposed algorithms. The attained results show the appropriate performance of our algorithms.

97 MATHEMATICS AND COMPUTING↗

Stochastic optimization of a uranium oxide reaction mechanism using plasma flow reactor measurements

Abstract In this work, a coupled Monte Carlo Genetic Algorithm (MCGA) approach is used to optimize a gas phase uranium oxide reaction mechanism based on plasma flow reactor (PFR) measurements. The PFR produces a steady Ar plasma containing U, O, H, and N species with high temperature regions (3000–5000 K) relevant to observing UO formation via optical emission spectroscopy. A global kinetic treatment is used to model the chemical evolution in the PFR and to produce synthetic emission signals for direct comparison with experiments. The parameter space of a uranium oxide reaction mechanism is then explored via Monte Carlo sampling using objective functions to quantify the model-experiment agreement. The Monte Carlo results are subsequently refined using a genetic algorithm to obtain an experimentally corroborated set of reaction pathways and rate coefficients. Out of 12 reaction channels targeted for optimization, four channels are found to be well constrained across all optimization runs while another three channels are constrained in select cases. The optimized channels highlight the importance of the OH radical in oxidizing uranium in the PFR. This study comprises a first step toward producing a comprehensive experimentally validated reaction mechanism for gas phase uranium molecular species formation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail. GenETOC was developed in C# using the .NET framework with Windows Presentation Foundation (WPF) serving as the framework from which to create the graphical user interface (GUI). GenETOC user inputs can be categorized into three major data components: definition of the problem (areas of interest, satellite decision parameters, and sensor configurations), definition of performance objectives, and specification of the genetic algorithm (GA) parameters. In the problem definition component, the user is prompted to define the areas of interest against which the performance metrics will be computed, define the sensor parameters and attach them to specific spacecraft, select which satellite orbital parameters will be added to the decision space of the GA, and specify the range of desired values for each optimization parameter. For performance objectives, the user is presented with a list of available coverage and revisit performance based calculation options from which two metrics are chosen to serve as the objective functions that the GA will use to evaluate solutions during the optimization process. Finally, the definition of the GA parameters provides user control over the number of generations (number of optimization iterations), the population size (number of candidate constellations created in each generation), and the adaptive mutation and crossover threshold values (control parameters for how frequently each process occurs during the optimization). GenETOC has been extensively tested to verify the individual components of the optimization process. The GA has been tested against a suite of GA test problems to confirm convergence to the known two and three-dimensional Pareto fronts. The coverage and revisit performance metrics obtained in GenETOC are compared with STK desktop scenarios, confirming the constellations are being appropriately modeled within GenETOC simulations. A walkthrough of a simple, example problem is provided to illustrate the workings of GenETOC and to demonstrate the output available to the mission designer.

mission design↗

Training Software in Artificial-Intelligence Computing Techniques

The Artificial Intelligence (AI) Toolkit is a computer program for training scientists, engineers, and university students in three soft-computing techniques (fuzzy logic, neural networks, and genetic algorithms) used in artificial-intelligence applications. The program promotes an easily understandable tutorial interface, including an interactive graphical component through which the user can gain hands-on experience in soft-computing techniques applied to realistic example problems. The tutorial provides step-by-step instructions on the workings of soft-computing technology, whereas the hands-on examples allow interaction and reinforcement of the techniques explained throughout the tutorial. In the fuzzy-logic example, a user can interact with a robot and an obstacle course to verify how fuzzy logic is used to command a rover traverse from an arbitrary start to the goal location. For the genetic algorithm example, the problem is to determine the minimum-length path for visiting a user-chosen set of planets in the solar system. For the neural-network example, the problem is to decide, on the basis of input data on physical characteristics, whether a person is a man, woman, or child. The AI Toolkit is compatible with the Windows 95,98, ME, NT 4.0, 2000, and XP operating systems. A computer having a processor speed of at least 300 MHz, and random-access memory of at least 56MB is recommended for optimal performance. The program can be run on a slower computer having less memory, but some functions may not be executed properly.

Howard, Ayanna↗

Language models for the prediction of SARS-CoV-2 inhibitors

The COVID-19 pandemic highlights the need for computational tools to automate and accelerate drug design for novel protein targets. We leverage deep learning language models to generate and score drug candidates based on predicted protein binding affinity. We pre-trained a deep learning language model (BERT) on ∼9.6 billion molecules and achieved peak performance of 603 petaflops in mixed precision. Our work reduces pre-training time from days to hours, compared to previous efforts with this architecture, while also increasing the dataset size by nearly an order of magnitude. For scoring, we fine-tuned the language model using an assembled set of thousands of protein targets with binding affinity data and searched for inhibitors of specific protein targets, SARS-CoV-2 Mpro and PLpro. We utilized a genetic algorithm approach for finding optimal candidates using the generation and scoring capabilities of the language model. Our generalizable models accelerate the identification of inhibitors for emerging therapeutic targets.

Blanchard, Andrew E.↗

A Novel Resilience-Oriented Cellular Grid Formation Approach for Distribution Systems with Behind-the-Meter Distributed Energy Resources

This paper presents a resilience-oriented cellular grid formation approach to achieve scalable and reconfigurable community microgrid operations for distribution systems with behind-the-meter distributed energy resources. A set of interconnected solar photovoltaics, energy storage systems, and load is termed as a cell, implying a subset of the grid that can operate independently using its own resources. Cells are identified such that each cell inherently has sufficient energy resources to black start and can provide a certain level of backup power for its load under the loss of utility power supply. The proposed cell formation approach builds on a unique self-organizing map-based method (SomRes) to quantify a system's resilience. Using SomRes and a non-dominated sorting-based genetic algorithm (NSGA-II), a fast and efficient cell formation algorithm is developed to identify cells in a distribution system that are resilient against extreme events. The efficacy of the proposed approach is demonstrated on a numerical model of a real distribution feeder in Colorado, United States.

distributed energy resource↗