Search NASA⌕ Search

SEARCH · Search NASA

Results for “genetic optimization”

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 91 records · Page 5

Multidisciplinary Design, Analysis, and Optimization Tool Development Using a Genetic Algorithm

Multidisciplinary design, analysis, and optimization using a genetic algorithm is being developed at the National Aeronautics and Space Administration Dryden Flight Research Center (Edwards, California) to automate analysis and design process by leveraging existing tools to enable true multidisciplinary optimization in the preliminary design stage of subsonic, transonic, supersonic, and hypersonic aircraft. This is a promising technology, but faces many challenges in large-scale, real-world application. This report describes current approaches, recent results, and challenges for multidisciplinary design, analysis, and optimization as demonstrated by experience with the Ikhana fire pod design.!

Pak, Chan-gi↗

Multidisciplinary Design, Analysis, and Optimization Tool Development using a Genetic Algorithm

Multidisciplinary design, analysis, and optimization using a genetic algorithm is being developed at the National Aeronautics and Space A dministration Dryden Flight Research Center to automate analysis and design process by leveraging existing tools such as NASTRAN, ZAERO a nd CFD codes to enable true multidisciplinary optimization in the pr eliminary design stage of subsonic, transonic, supersonic, and hypers onic aircraft. This is a promising technology, but faces many challe nges in large-scale, real-world application. This paper describes cur rent approaches, recent results, and challenges for MDAO as demonstr ated by our experience with the Ikhana fire pod design.

Pak, Chan-gi↗

Extreme Longitudinal Compression of Optimized Beams for MEV Ultrafast Electron Diffraction (Final Technical Report)

We worked out the design of a high repetition rate MeV energy ultrafast electron diffraction instrument based on the existing Cornell photoinjector, which can readily be applied to the presented findings. This example is a blueprint of other similarly arranged UED setups. Using particle tracking simulations in conjunction with multiobjective genetic algorithm optimization, we explored the smallest bunch lengths, emittance, and probe spot sizes achievable. As two limits, we defined stroboscopic conditions (with single electrons per pulse) and operation with 10 5 electrons per bunch which may be suitable for single-shot diffraction images. In the stroboscopic case, the flexibility provided by the many cavity bunching and acceleration allows for longitudinal phase space linearization without a higher harmonic field, providing sub-fs bunch lengths at the sample. Given low emittance photoemission conditions, these small bunch lengths can be maintained with probe transverse sizes at the single micron (1 μm) scale and below. In the case of 10 5 electrons per pulse, we simulated state-of-the-art 5D brightness conditions: rms bunch lengths of 10 fs with 3-nm normalized emittances, while permitting repetition rates as high as 1.3 GHz. We showed that in conjunction with collimating apertures, a novel focusing scheme achieves very high-quality emittance compensation for the central core of the beam composing 40% of particles, for a resulting beam size of 5 μm (rms). Finally, to aid in the design of new SRF-based ultrafast electron diffraction machines, we simulated the trade-off between the number of cavities used and achievable bunch length and emittance. In the longitudinal dimension, we made use of the fact that MeV UED requires much lower energy than the 15-MeV maxi mum energy of Cornell’s CBETA injector, and we may therefore use several of the SRF cavities for bunch length compression. In practice, we used a genetic optimization algorithm to choose the phases and amplitudes of the cavities appropriately for optimal bunching. In the zero space charge case, we found that bunching and acceleration are distributed across the six cavities in a way that produces a linearizing effect. And we showed that the ultimate bunch length can be limited by time-of-flight differences arising from transverse size and transverse momentum spread. The space charge code developed and used for this development is now permanent part of the Bmad accelerator simulation code and has already contributed to other developments, e.g., for the EIC electron cooler design.

43 PARTICLE ACCELERATORS↗

Comparing a Coevolutionary Genetic Algorithm for Multiobjective Optimization

We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA finds a solution that dominates solutions produced by eight other algorithms, yet the CGA has poor coverage across the Pareto front.

Lohn, Jason D.↗

Dynamic optimization and economic evaluation of flexible heat integration in a hybrid concentrated solar power plant

Hybridization of concentrated solar power (CSP) plants provides flexibility in operation that can drastically improve the solar-to-electric (STE) efficiency and levelized cost of electricity (LCOE) relative to standalone CSP plants. Flexible heat integration (FHI) is a novel concept where the collection and integration of CSP within a power plant is modified relative to the amount of solar energy available. FHI improves the thermal efficiency of a hybrid solar tower steam Rankine cycle power plant but leads to increased pumping needs due to continuously elevated molten salt flow rates through the collection system, which can negatively impact STE efficiency. The present work is carried out to maximize the STE efficiency of a hybrid CSP plant utilizing FHI by employing a dynamic optimization framework where a genetic algorithm optimizes the operation of the plant over a given solar irradiance profile. The study concerns a plant hypothetically located in Salt Lake City, Utah. Here, the optimization results confirm the accuracy of a predictive heuristic where the preferred operation of the plant can be estimated relative to local peaks in the incident power generated by the heliostat collection field. The optimized FHI operation demonstrates a yearly STE efficiency of 13.8%, whereas the equivalent base-level hybrid and solar-only plants exhibit solar efficiencies of 13.4% and 11.2%, respectively. Economic analysis shows that FHI reduces yearly natural gas costs, leading to a $\$0.5$/MWh reduction in LCOE relative to the base-level hybrid configuration. Overall, the results show that hybrid FHI schemes exhibit economic benefits along with observed thermodynamic improvements.

14 SOLAR ENERGY↗

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.↗

Temperature dependence of magnetic anisotropy and magnetoelasticity from classical spin-lattice calculations

Here we present a classical molecular-spin dynamics (MSD) methodology that enables accurate computations of the temperature dependence of the magnetocrystalline anisotropy as well as magnetoelastic properties of magnetic materials. The nonmagnetic interactions are accounted for by a spectral neighbor analysis potential (SNAP) machine-learned interatomic potential, whereas the magnetoelastic contributions are accounted for using a combination of an extended Heisenberg Hamiltonian and a Néel pair interaction model, representing both the exchange interaction and spin-orbit-coupling effects, respectively. All magnetoelastic potential components are parameterized using a combination of first-principles and experimental data. Our framework is applied to the α phase of iron. Initial testing of our MSD model is done using a 0 K parametrization of the Néel interaction model. After this, we examine how individual Néel parameters impact the $B$ 1 and $B$ 2 magnetostrictive coefficients using a moment-independent δ sensitivity analysis. The results from this study are then used to initialize a genetic algorithm optimization which explores the Néel parameter phase space and tries to minimize the error in the B 1 and B 2 magnetostrictive coefficients in the range of 0–1200 K. Our results show that while both the 0 K and genetic algorithm optimized parametrization provide good experimental agreement for $B$ 1 and $B$ 2 , only the genetic algorithm optimized results can capture the second peak in the $B$ 1 magnetostrictive coefficient which occurs near approximately 800 K.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Evaluation of Genetic Algorithm Concepts Using Model Problems: Multi-Objective Optimization - Part 2

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of simple model problems. Several new features including a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all optimization problems attempted. The binning algorithm generally provides pareto front quality enhancements and moderate convergence efficiency improvements for most of the model problems. The gene-space transformation procedure provides a large convergence efficiency enhancement for problems with non-convoluted pareto fronts and a degradation in efficiency for problems with convoluted pareto fronts. The most difficult problems --multi-mode search spaces with a large number of genes and convoluted pareto fronts-- require a large number of function evaluations for GA convergence, but always converge.

Holst, Terry L.↗

Genetic Algorithm-Based Optimization to Match Asteroid Energy Deposition Curves

An asteroid entering Earth's atmosphere deposits energy along its path due to thermal ablation and dissipative forces that can be measured by ground-based and spaceborne instruments. Inference of pre-entry asteroid properties and characterization of the atmospheric breakup is facilitated by using an analytic fragment-cloud model (FCM) in conjunction with a Genetic Algorithm (GA). This optimization technique is used to inversely solve for the asteroid's entry properties, such as diameter, density, strength, velocity, entry angle, and strength scaling, from simulations using FCM. The previous parameters' fitness evaluation involves minimizing error to ascertain the best match between the physics-based calculated energy deposition and the observed meteors. This steady-state GA provided sets of solutions agreeing with literature, such as the meteor from Chelyabinsk, Russia in 2013 and Tagish Lake, Canada in 2000, which were used as case studies in order to validate the optimization routine. The assisted exploration and exploitation of this multi-dimensional search space enables inference and uncertainty analysis that can inform studies of near-Earth asteroids and consequently improve risk assessment.

Depositio↗

Evaluation of Genetic Algorithm Concepts using Model Problems: Single-Objective Optimization - Part 1

A genetic-algorithm-based optimization approach is described and evaluated using a simple hill-climbing model problem. The model problem utilized herein allows for the broad specification of a large number of search spaces including spaces with an arbitrary number of genes or decision variables and an arbitrary number hills or modes. In the present study, only single objective problems are considered. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all problems attempted. The most difficult problems - those with large hyper-volumes and multi-mode search spaces containing a large number of genes - require a large number of function evaluations for GA convergence, but they always converge.

Holst, Terry L.↗

The Application of a Genetic Algorithm to the Optimization of a Mesoscale Model for Emergency Response

Besides solving the equations of momentum, heat, and moisture transport on the model grid, mesoscale weather models must account for subgrid-scale processes that affect the resolved model variables. These are simulated with model parameterizations, which often rely on values preset by the user. Such “free” model parameters, along with others set to initialize the model, are often poorly constrained, requiring that a user select each from a range of plausible values. Finding the values to optimize any forecasting tool can be accomplished with a search algorithm, and one such process—the genetic algorithm (GA)—has become especially popular. As applied to modeling, GAs represent a Darwinian process: an ensemble of simulations is run with a different set of parameter values for each member, and the members subsequently judged to be most accurate are selected as “parents” who pass their parameters onto a new generation. At the U.S. Department of Energy’s Savannah River Site in South Carolina, we are applying a GA to the Regional Atmospheric Modeling System (RAMS) mesoscale weather model, which supplies input to a model to simulate the dispersion of an airborne contaminant as part of the site’s emergency response preparations. An ensemble of forecasts is run each day, weather data are used to “score” the individual members of the ensemble, and the parameters from the best members are used for the next day’s forecasts. As meteorological conditions change, the parameters change as well, maintaining a model configuration that is best adapted to atmospheric conditions. Significance Statement We wanted to develop a forecasting system by which a weather model is run over the Savannah River Site each day and repeatedly adjusted according to how well it performed the previous day. To run the model, a series of values (parameters) must be set to control how the model will calculate winds, temperatures, and other desired variables. Each day the model was run several times using different combinations of these parameters and later compared with observed meteorological conditions. Parameters that produced the most accurate forecasts were preferentially reused to create the forecasts for the next day. The process was tested for the summer of 2020 and exhibited lower errors than forecasts produced by the model using default values of the parameters.

54 ENVIRONMENTAL SCIENCES↗

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.

Communication Network Scheduling↗

Enhancing Camera Calibration for Traffic Surveillance with an Integrated Approach of Genetic Algorithm and Particle Swarm Optimization

Recent advancements in sensor technologies, coupled with signal processing and machine learning, have enabled real-time traffic control systems to effectively adapt to changing traffic conditions. Cameras, as sensors, offer a cost-effective means to determine the number, location, type, and speed of vehicles, aiding decision-making at traffic intersections. However, the effective use of cameras for traffic surveillance requires proper calibration. This paper proposes a new optimization-based method for camera calibration. In this approach, initial calibration parameters are established using the Direct Linear Transformation (DLT) method. Then, optimization algorithms are applied to further refine the calibration parameters for the correction of nonlinear lens distortions. A significant enhancement in the optimization process is achieved through the integration of the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) into a combined Integrated GA and PSO (IGAPSO) technique. The effectiveness of this method is demonstrated through the calibration of eleven roadside cameras at three different intersections. The experimental results show that when compared to the baseline DLT method, the vehicle localization error is reduced by 22.30% with GA, 22.31% with PSO, and 25.51% with IGAPSO.

47 OTHER INSTRUMENTATION↗

Optimization of laminated stacking sequence for buckling load maximization by genetic algorithm

The use of a genetic algorithm to optimize the stacking sequence of a composite laminate for buckling load maximization is studied. Various genetic parameters including the population size, the probability of mutation, and the probability of crossover are optimized by numerical experiments. A new genetic operator - permutation - is proposed and shown to be effective in reducing the cost of the genetic search. Results are obtained for a graphite-epoxy plate, first when only the buckling load is considered, and then when constraints on ply contiguity and strain failure are added. The influence on the genetic search of the penalty parameter enforcing the contiguity constraint is studied. The advantage of the genetic algorithm in producing several near-optimal designs is discussed.

Le Riche, Rodolphe↗

Truss Optimization for a Manned Nuclear Electric Space Vehicle using Genetic Algorithms

The purpose of this paper is to utilize the genetic algorithm (GA) optimization method for structural design of a nuclear propulsion vehicle. Genetic algorithms provide a guided, random search technique that mirrors biological adaptation. To verify the GA capabilities, other traditional optimization methods were used to generate results for comparison to the GA results, first for simple two-dimensional structures, and then for full-scale three-dimensional truss designs.

Benford, Andrew↗

Aerodynamic Shape Optimization Using A Real-Number-Encoded Genetic Algorithm

A new method for aerodynamic shape optimization using a genetic algorithm with real number encoding is presented. The algorithm is used to optimize three different problems, a simple hill climbing problem, a quasi-one-dimensional nozzle problem using an Euler equation solver and a three-dimensional transonic wing problem using a nonlinear potential solver. Results indicate that the genetic algorithm is easy to implement and extremely reliable, being relatively insensitive to design space noise.

Holst, Terry L.↗

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↗