Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Comments on “Failure analysis of corroded hydrogen-blended natural gas pipelines based on finite element analysis and genetic algorithm-back propagation neural network” [262 (2025) 111174]

This is a brief commentary paper to highlight and discuss the determination of hydrogen concentration in pipeline steel, effect of hydrogen embrittlement (HE) on the mechanical properties of the material, burst strength of corroded pipelines using finite element analysis (FEA) simulations, and curve-fit models for assessing remaining strength of X80 corroded pipelines for transporting hydrogen blended natural gas. Recently, Xie et al. [1] proposed a methodology to quantify the impact of HE on material properties and numerically determined burst pressure of X80 corroded pipelines. However, their HE quantification overestimated the degradation of tensile strength for hydrogen blending ratios beyond the original data range, and their FEA results of burst pressure are nonconservative. This work thus recharacterized the hydrogen concentration in the steel pipeline and the effect of HE on tensile strength, and then redetermined burst pressures for a set of typical corrosion defect cases considered by Xie et al. [1] based on an experimentally validated FEA modelling method. With the new FEA results, two empirical corrosion models were proposed for X80 corroded pipelines for hydrogen service. At zero hydrogen blending ratio, the novel empirical models predict burst pressures to be consistent with the industry-accepted corrosion models. Furthermore, both the numerical simulation method and the novel corrosion models are significant contributions to the pipeline industry and the hydrogen community. Application of these results will enhance the safety, reliability, and integrity of natural gas pipelines when used to transport hydrogen.

Burst pressure prediction↗
DOE OSTI2016

A simulation-optimization model for Stone column-supported embankment stability considering rainfall effect

Landslide due to rainfall has been and continues to be one of the most important concerns of geotechnical engineering. The paper presents the variation of factor of safety of stone column-supported embankment constructed over soft soil due to change in water level for an incessant period of rainfall. A combined simulation-optimization based methodology has been proposed to predict the critical surface of failure of the embankment and to optimize the corresponding factor of safety under rainfall conditions using an evolutionary genetic algorithm NSGA-II (Non-Dominated Sorted Genetic Algorithm-II). It has been observed that the position of water table can be reliably estimated with varying periods of infiltration using developed numerical method. The parametric study is presented to study the optimum factor of safety of the embankment and its corresponding critical failure surface under the steady-state infiltration condition. Results show that in case of floating stone columns, period of infiltration has no effect on factor of safety. Even critical failure surfaces for a particular floating column length remain same irrespective of rainfall duration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.

Probst, Daniel M.↗
NASA NTRS1994

System Design under Uncertainty: Evolutionary Optimization of the Gravity Probe-B Spacecraft

This paper discusses the application of evolutionary random-search algorithms (Simulated Annealing and Genetic Algorithms) to the problem of spacecraft design under performance uncertainty. Traditionally, spacecraft performance uncertainty has been measured by reliability. Published algorithms for reliability optimization are seldom used in practice because they oversimplify reality. The algorithm developed here uses random-search optimization to allow us to model the problem more realistically. Monte Carlo simulations are used to evaluate the objective function for each trial design solution. These methods have been applied to the Gravity Probe-B (GP-B) spacecraft being developed at Stanford University for launch in 1999, Results of the algorithm developed here for GP-13 are shown, and their implications for design optimization by evolutionary algorithms are discussed.

Pullen, Samuel P.↗
NASA NTRS2004

Polymorphic Electronic Circuits

Polymorphic electronics is a nascent technological discipline that involves, among other things, designing the same circuit to perform different analog and/or digital functions under different conditions. For example, a circuit can be designed to function as an OR gate or an AND gate, depending on the temperature (see figure). Polymorphic electronics can also be considered a subset of polytronics, which is a broader technological discipline in which optical and possibly other information- processing systems could also be designed to perform multiple functions. Polytronics is an outgrowth of evolvable hardware (EHW). The basic concepts and some specific implementations of EHW were described in a number of previous NASA Tech Briefs articles. To recapitulate: The essence of EHW is to design, construct, and test a sequence of populations of circuits that function as incrementally better solutions of a given design problem through the selective, repetitive connection and/or disconnection of capacitors, transistors, amplifiers, inverters, and/or other circuit building blocks. The evolution is guided by a search-and-optimization algorithm (in particular, a genetic algorithm) that operates in the space of possible circuits to find a circuit that exhibits an acceptably close approximation of the desired functionality. The evolved circuits can be tested by computational simulation (in which case the evolution is said to be extrinsic), tested in real hardware (in which case the evolution is said to be intrinsic), or tested in random sequences of computational simulation and real hardware (in which case the evolution is said to be mixtrinsic).

Stoica, Adrian↗
DOE OSTI2019

Zigzag search for multi-objective optimization considering generation cost and emission

The zigzag search algorithm has been applied in engineering fields, such as oil well placement, with satisfactory results. Here, the zigzag search algorithm is introduced, modified with enhancement, and effectively applied to solve an economic emission dispatch problem and to demonstrate its practicability in power systems. The problem is formulated as a non-linear multi-objective optimization model taking energy constraints, generation limits, and transmission constraints into consideration. A set of non-dominant solutions can be obtained to form the Pareto front. Case studies are carried out with the IEEE 30-bus system and IEEE 118-bus system. The results indicate that the proposed zigzag search algorithms have the ability to deal with relevant power system problems. Comparisons are made with algorithms which have been widely used in literatures, such as the genetic algorithm (GA) and particle swarm optimization (PSO). Finally, this demonstrates that the zigzag search is easy to implement and is superior to other multi-objective (MO) techniques in both accuracy and efficiency.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Teeport: Break the Wall Between the Optimization Algorithms and Problems

Optimization algorithms/techniques such as genetic algorithm, particle swarm optimization, and Gaussian process have been widely used in the accelerator field to tackle complex design/online optimization problems. However, connecting the algorithm with the optimization problem can be difficult, as the algorithms and the problems may be implemented in different languages, or they may require specific resources. We introduce an optimization platform named Teeport that is developed to address the above issues. This real-time communication-based platform is designed to minimize the effort of integrating the algorithms and problems. Once integrated, the users are granted a rich feature set, such as monitoring, controlling, and benchmarking. Some real-life applications of the platform are also discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quantification of Lanthanides in a Molten Salt Reactor Surrogate Off-Gas Stream Using Laser-Induced Breakdown Spectroscopy

To enable the deployment of molten salt reactor technology, the development of off-gas treatment systems and advanced monitoring tools capable of operating with high temperatures and radiation fields while delivering near real-time information is necessary. Here, we aim to fulfill this requirement and proposes laser-induced breakdown spectroscopy (LIBS) for monitoring molten salt aerosol streams. A sheath gas measuring method was developed to protect optical elements from aerosol particles and to ensure a relatively constant aerosol stream for measurement. An aqueous system was studied to demonstrate the utility of LIBS for monitoring possible fission products in an aerosol stream: Gd, Nd, and Sm up to 2000 parts per million (ppm). A calibration model was built using partial least squares (PLS) regression with five, six, and nine latent variables for Gd, Nd, and Sm, respectively. This calibration model successfully estimated the concentrations of three test samples, which were validated with inductively charged plasma optical emission spectroscopy measurements at a 99.9% confidence interval. To enhance these models, a genetic algorithm was used to filter the spectra before entering the PLS model, thereby limiting the spectral features being regressed to those with greater correlations to concentration. This allowed for the number of latent variables used in the PLS models to be reduced to four, three, and three for Gd, Nd, and Sm, respectively. Finally, the genetic algorithm-filtered PLS models were used to predict the concentrations of the aerosol stream on a real-time dataset and resulted in a 73%, 18%, and 25% improvement in root mean squared error of prediction compared to the original PLS models developed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2019

A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach

Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.

42 ENGINEERING↗
NASA NTRS1972

Algebraic, geometric, and stochastic aspects of genetic operators

Genetic algorithms for function optimization employ genetic operators patterned after those observed in search strategies employed in natural adaptation. Two of these operators, crossover and inversion, are interpreted in terms of their algebraic and geometric properties. Stochastic models of the operators are developed which are employed in Monte Carlo simulations of their behavior.

Foo, N. Y.↗
NASA NTRS2019

On the Use of Optimization Techniques for Turbulence Model Calibration

This article discusses the use of numerical optimization procedures to aid in the calibration of turbulence model coefficients. Such methods would increase the rigor and repeatability of the calibration procedure by requiring clearly defined and objective optimization metrics, and could be used to identify unique combinations of coefficient values for specific flow problems. The approach is applied to the re-calibration of an explicit algebraic Reynolds stress model for the incompressible planar mixing layer using the Nelder-Mead simplex algorithm and a micro-genetic algorithm with minimally imposed constraints. Three composite fitness functions, each based upon the error in the mixing layer growth rate and the normal and shear components of the Reynolds stresses, are investigated. The results demonstrate a significant improvement in the target objectives through the adjustment of three pressure-strain coefficients. Adjustments of additional coefficients provide little further benefit. Issues regarding the effectiveness of the fitness functions and the efficiency of the optimization algorithms are also discussed.

Yoder, Dennis A.↗
DOE OSTI2023

Finding Your Niche: An Evolutionary Approach to HPC Topologies

Traditional interconnection network design approaches focus on building general network topologies by optimizing the bisection bandwidth or minimizing the network’s diameter to reduce the maximum distance between any two nodes, thus amortizing the overall execution time of the HPC workloads. While such network topologies may accommodate a wide variety of applications in general, this may result in sub-optimal performance for many frequently-executed or dynamic workloads. In this paper, instead of focusing on designing an all-encompassing, general-purpose network topology, we develop a methodology to design customized network interconnects, evolved by “finding” the optimal topologies for a particular target workload given by its communication and contention profiles. To this end, we implement a Genetic Algorithm (GA)-based approach for network topology design tailored to improve the overall execution time of a particular workload of interest. We conducted extensive experiments with well-known motifs in physics-based workloads (Sweep3D and FFT), as well as with a representative graph application (MiniVite), using the well-known Structural Simulation Toolkit (SST) Macroscale Element Library (SST/macro) simulator for network interconnect evaluation. We demonstrate that our genetic algorithm-based approach is robust enough to find the underlying optimal topology of a particular workload.

network interconnects, graph search, meta-heuristi↗
DOE OSTI2016

Hybrid optimization and Bayesian inference techniques for a non-smooth radiation detection problem

In this paper, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Finally, marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms.

42 ENGINEERING↗
NASA NTRS2004

An Evolved Antenna for Deployment on NASA's Space Technology 5 Mission

We present an evolved X - band antenna design and flight prototype currently on schedule to be deployed on NASA's Space Technology 5(ST5) spacecraft. Current methods of designing and optimizing antennas by hand are time and labor intensive, limit complexity and require significant expertise and experience. Evolutionary design techniques can overcome these limitations by searching the design space and automatically finding effective solutions that would ordinarily not be found. The ST5 antenna was evolved to meet a challenging set of mission requirements, most notably the combination of wide beamwidth for a circularly-polarized wave and wide bandwidth.Two evolutionary algorithms were used: one used a genetic algorithm style representation that did not allow branching in the antenna arms: the second used a genetic programming style tree-structured representation that allowed branching in the antenna arms. The highest performance antennas from both algorithms were fabricated and tested and both yielded similar performance. Both were comparable in performance to a hand-designed antenna produced by a contractor for the mission, and so we consider them examples of human-competitive performance by evolutionary algorithms. One of the evolved antenna prototypes is undergoing flight qualification testing.

Lohn, Jason D.↗
DOE OSTI2018

Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry

The hub location and revenue management problems are two interesting research fields in the transportation and network design studies. The hub location model designs the transportation network structure and the revenue management model allocates the network’s capacity for customer classes based on their sensitivity to prices. In this paper, we consider the integrated hub location and revenue management problem in the airline industry to maximize the revenue of transportation network and minimize hub installation costs. p hubs have been chosen from a set of n nodes and connected to a central node based on star–star network design. The capacity of the installed links between the hubs and the central node and the hubs and non-hub nodes is limited. This limited capacity has been allocated to the stochastic demands of customer classes using the revenue management approach. A two-stage stochastic model has been derived to determine the locations of hubs and protection levels in the ticket sale process, and an efficient modification of genetic algorithm has been proposed for the large-scale problems. Numerical experiments have been carried out to assess the effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Utilizing computer vision and artificial intelligence algorithms to predict and design the mechanical compression response of direct ink write 3D printed foam replacement structures

Additive Manufacturing (AM) of porous polymeric materials, such as foams, recently became a topic of intensive research due their unique combination of low density, impressive mechanical properties, and stress dissipation capabilities. Conventional methods for fabricating foams rely on complex and stochastic processes, making it challenging to achieve precise architectural control of structured porosity. In contrast, AM provides access to a wide range of printable materials, where precise spatial control over structured porosity can be modulated during the fabrication process enabling the production of foam replacement structures (FRS). Current approaches for designing FRS are based on intuitive understanding of their properties or an extensive number of finite element method (FEM) simulations. These approaches, however, are computationally expensive and time consuming. As such, in this work, we present a novel methodology for determining the mechanical compression response of direct ink write (DIW) 3D printed FRS using a simple cross-sectional image. By obtaining measurement data for a relatively small number of samples, an artificial neural network (ANN) was trained, and a computer vision algorithm was used to make inferences about foam compression characteristics from a single cross-sectional image. Finally, a genetic algorithm (GA) was used to solve the inverse design problem, generating the AM printing parameters that an engineer should use to achieve a desired compression response from a DIW printed FRS. The methods developed herein present an avenue for entirely autonomous design and analysis of additively manufactured structures using artificial intelligence.

36 MATERIALS SCIENCE↗