Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “evolutionary 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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A consistent-mode indicator for the eigensystem realization algorithm

A new method is described for assessing the consistency of structural modal parameters identified with the Eigensystem Realization Algorithm. Identification results show varying consistency in practice due to many sources including high modal density, nonlinearity, and inadequate excitation. Consistency is considered to be a reliable indicator of accuracy. The new method is the culmination of many years of experience in developing a practical implementation of the Eigensystem Realization Algorithm. The effectiveness of the method is illustrated using data from NASA Langley's Controls-Structures-Interaction Evolutionary Model.

Pappa, R. S.↗
NASA NTRS2007

Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

Shaykhian, Gholam Ali↗
DOE OSTI2024

Synchrotron‐source micro‐x‐ray computed tomography for examining butterfly eyes

Comparative anatomy is an important tool for investigating evolutionary relationships among species, but the lack of scalable imaging tools and stains for rapidly mapping the microscale anatomies of related species poses a major impediment to using comparative anatomy approaches for identifying evolutionary adaptations. We describe a method using synchrotron source micro-x-ray computed tomography (syn-μXCT) combined with machine learning algorithms for high-throughput imaging of Lepidoptera (i.e., butterfly and moth) eyes. Our pipeline allows for imaging at rates of ~15 min/mm 3 at 600 nm 3 resolution. Image contrast is generated using standard electron microscopy labeling approaches (e.g., osmium tetroxide) that unbiasedly labels all cellular membranes in a species-independent manner thus removing any barrier to imaging any species of interest. To demonstrate the power of the method, we analyzed the 3D morphologies of butterfly crystalline cones, a part of the visual system associated with acuity and sensitivity and found significant variation within six butterfly individuals. Despite this variation, a classic measure of optimization, the ratio of interommatidial angle to resolving power of ommatidia, largely agrees with early work on eye geometry across species. We show that this method can successfully be used to determine compound eye organization and crystalline cone morphology. Our novel pipeline provides for fast, scalable visualization and analysis of eye anatomies that can be applied to any arthropod species, enabling new questions about evolutionary adaptations of compound eyes and beyond.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2006

Genetic Algorithm for Optimization: Preprocessor and Algorithm

Genetic algorithm (GA) inspired by Darwin's theory of evolution and employed to solve optimization problems - unconstrained or constrained - uses an evolutionary process. A GA has several parameters such the population size, search space, crossover and mutation probabilities, and fitness criterion. These parameters are not universally known/determined a priori for all problems. Depending on the problem at hand, these parameters need to be decided such that the resulting GA performs the best. We present here a preprocessor that achieves just that, i.e., it determines, for a specified problem, the foregoing parameters so that the consequent GA is a best for the problem. We stress also the need for such a preprocessor both for quality (error) and for cost (complexity) to produce the solution. The preprocessor includes, as its first step, making use of all the information such as that of nature/character of the function/system, search space, physical/laboratory experimentation (if already done/available), and the physical environment. It also includes the information that can be generated through any means - deterministic/nondeterministic/graphics. Instead of attempting a solution of the problem straightway through a GA without having/using the information/knowledge of the character of the system, we would do consciously a much better job of producing a solution by using the information generated/created in the very first step of the preprocessor. We, therefore, unstintingly advocate the use of a preprocessor to solve a real-world optimization problem including NP-complete ones before using the statistically most appropriate GA. We also include such a GA for unconstrained function optimization problems.

Sen, S. K.↗
NASA NTRS2007

Aerocapture Technology Developments from NASA's In-Space Propulsion Technology Program

This paper will explain the investment strategy, the role of detailed systems analysis, and the hardware and modeling developments that have resulted from the past 5 years of work under NASA's In-Space Propulsion Program (ISPT) Aerocapture investment area. The organizations that have been funded by ISPT over that time period received awards from a 2002 NASA Research Announcement. They are: Lockheed Martin Space Systems, Applied Research Associates, Inc., Ball Aerospace, NASA's Ames Research Center, and NASA's Langley Research Center. Their accomplishments include improved understanding of entry aerothermal environments, particularly at Titan, demonstration of aerocapture guidance algorithm robustness at multiple bodies, manufacture and test of a 2-meter Carbon-Carbon "hot structure," development and test of evolutionary, high-temperature structural systems with efficient ablative materials, and development of aerothermal sensors that will fly on the Mars Science Laboratory in 2009. Due in large part to this sustained ISPT support for Aerocapture, the technology is ready to be validated in flight.

Munk, Michelle M.↗
NASA NTRS2008

Aerocapture Technology Development Overview

This paper will explain the investment strategy, the role of detailed systems analysis, and the hardware and modeling developments that have resulted from the past 5 years of work under NASA's In-Space Propulsion Program (ISPT) Aerocapture investment area. The organizations that have been funded by ISPT over that time period received awards from a 2002 NASA Research Announcement. They are: Lockheed Martin Space Systems, Applied Research Associates, Inc., Ball Aerospace, NASA s Ames Research Center, and NASA s Langley Research Center. Their accomplishments include improved understanding of entry aerothermal environments, particularly at Titan, demonstration of aerocapture guidance algorithm robustness at multiple bodies, manufacture and test of a 2-meter Carbon-Carbon "hot structure," development and test of evolutionary, high-temperature structural systems with efficient ablative materials, and development of aerothermal sensors that will fly on the Mars Science Laboratory in 2009. Due in large part to this sustained ISPT support for Aerocapture, the technology is ready to be validated in flight.

Munk, Michelle M.↗
NASA NTRS2001

Efficiency of parallel direct optimization

Tremendous progress has been made at the level of sequential computation in phylogenetics. However, little attention has been paid to parallel computation. Parallel computing is particularly suited to phylogenetics because of the many ways large computational problems can be broken into parts that can be analyzed concurrently. In this paper, we investigate the scaling factors and efficiency of random addition and tree refinement strategies using the direct optimization software, POY, on a small (10 slave processors) and a large (256 slave processors) cluster of networked PCs running LINUX. These algorithms were tested on several data sets composed of DNA and morphology ranging from 40 to 500 taxa. Various algorithms in POY show fundamentally different properties within and between clusters. All algorithms are efficient on the small cluster for the 40-taxon data set. On the large cluster, multibuilding exhibits excellent parallel efficiency, whereas parallel building is inefficient. These results are independent of data set size. Branch swapping in parallel shows excellent speed-up for 16 slave processors on the large cluster. However, there is no appreciable speed-up for branch swapping with the further addition of slave processors (>16). This result is independent of data set size. Ratcheting in parallel is efficient with the addition of up to 32 processors in the large cluster. This result is independent of data set size. c2001 The Willi Hennig Society.

NASA Discipline Evolutionary Biology↗
DOE OSTI2025

RANGE: A robust adaptive nature-inspired global explorer of potential energy surfaces

With the growing demand for realistic representations of chemical structures and the advent of exascale computing, the intelligent sampling of potential energy surfaces and efficient identification of global minima have become more essential but also more feasible. Building on prior studies demonstrating the efficiency of the Artificial Bee Colony (ABC) swarm intelligence algorithm, we report a hybrid metaheuristic framework that integrates the adaptive exploration capabilities of ABC coupled with the exploitation strengths of genetic algorithms (GA) in a scalable, Python-based implementation. The resulting tool, RANGE (Robust Adaptive Nature-inspired Global Explorer), provides seamless interfaces to multiple potential energy evaluators, either directly or via widely used Python libraries, and is designed for high-performance computing environments. We describe the implementation details of RANGE and evaluate its performance, relative to ABC- or GA-alone based algorithms, on a variety of chemical systems, including molecular clusters and heterogeneous surfaces. In conclusion, our results demonstrate RANGE’s efficiency, robustness, and broad applicability in addressing challenging global optimization problems in computational chemistry and materials science.

Algorithms and data structure↗
NASA NTRS1997

Evolutionary Design of Controlled Structures

Basic physical concepts of structural delay and transmissibility are provided for simple rod and beam structures. Investigations show the sensitivity of these concepts to differing controlled-structures variables, and to rational system modeling effects. An evolutionary controls/structures design method is developed. The basis of the method is an accurate model formulation for dynamic compensator optimization and Genetic Algorithm based updating of sensor/actuator placement and structural attributes. One and three dimensional examples from the literature are used to validate the method. Frequency domain interpretation of these controlled structure systems provide physical insight as to how the objective is optimized and consequently what is important in the objective. Several disturbance rejection type controls-structures systems are optimized for a stellar interferometer spacecraft application. The interferometric designs include closed loop tracking optics. Designs are generated for differing structural aspect ratios, differing disturbance attributes, and differing sensor selections. Physical limitations in achieving performance are given in terms of average system transfer function gains and system phase loss. A spacecraft-like optical interferometry system is investigated experimentally over several different optimized controlled structures configurations. Configurations represent common and not-so-common approaches to mitigating pathlength errors induced by disturbances of two different spectra. Results show that an optimized controlled structure for low frequency broadband disturbances achieves modest performance gains over a mass equivalent regular structure, while an optimized structure for high frequency narrow band disturbances is four times better in terms of root-mean-square pathlength. These results are predictable given the nature of the physical system and the optimization design variables. Fundamental limits on controlled performance are discussed based on the measured and fit average system transfer function gains and system phase loss.

Masters, Brett P.↗
DOE OSTI2023

Deep learning for morphological identification of extended radio galaxies using weak labels

Abstract The present work discusses the use of a weakly-supervised deep learning algorithm that reduces the cost of labelling pixel-level masks for complex radio galaxies with multiple components. The algorithm is trained on weak class-level labels of radio galaxies to get class activation maps (CAMs). The CAMs are further refined using an inter-pixel relations network (IRNet) to get instance segmentation masks over radio galaxies and the positions of their infrared hosts. We use data from the Australian Square Kilometre Array Pathfinder (ASKAP) telescope, specifically the Evolutionary Map of the Universe (EMU) Pilot Survey, which covered a sky area of 270 square degrees with an RMS sensitivity of 25–35 $\mu$ Jy beam $^{-1}$ . We demonstrate that weakly-supervised deep learning algorithms can achieve high accuracy in predicting pixel-level information, including masks for the extended radio emission encapsulating all galaxy components and the positions of the infrared host galaxies. We evaluate the performance of our method using mean Average Precision (mAP) across multiple classes at a standard intersection over union (IoU) threshold of 0.5. We show that the model achieves a mAP $_{50}$ of 67.5% and 76.8% for radio masks and infrared host positions, respectively. The network architecture can be found at the following link: https://github.com/Nikhel1/Gal-CAM

Astronomy & Astrophysics↗
NASA NTRS2003

Iterative pass optimization of sequence data

The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. This method, though more efficient in time and more effective in cladogram length than many alignment-based procedures, greedily optimizes nodes based on descendent information only. In their proposal of an exact multiple alignment solution, Sankoff et al. in 1976 described a heuristic procedure--the iterative improvement method--to create alignments at internal nodes by solving a series of median problems. The combination of a three-sequence direct optimization with iterative improvement and a branch-length-based cladogram cost procedure, provides an algorithm that frequently results in superior (i.e., lower) cladogram costs. This iterative pass optimization is both computation and memory intensive, but economies can be made to reduce this burden. An example in arthropod systematics is discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

NASA Discipline Evolutionary Biology↗
NASA NTRS1994

Multidisciplinary design optimization using genetic algorithms

Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

Unal, Resit↗
NASA NTRS2005

Efficient Credit Assignment through Evaluation Function Decomposition

Evolutionary methods are powerful tools in discovering solutions for difficult continuous tasks. When such a solution is encoded over multiple genes, a genetic algorithm faces the difficult credit assignment problem of evaluating how a single gene in a chromosome contributes to the full solution. Typically a single evaluation function is used for the entire chromosome, implicitly giving each gene in the chromosome the same evaluation. This method is inefficient because a gene will get credit for the contribution of all the other genes as well. Accurately measuring the fitness of individual genes in such a large search space requires many trials. This paper instead proposes turning this single complex search problem into a multi-agent search problem, where each agent has the simpler task of discovering a suitable gene. Gene-specific evaluation functions can then be created that have better theoretical properties than a single evaluation function over all genes. This method is tested in the difficult double-pole balancing problem, showing that agents using gene-specific evaluation functions can create a successful control policy in 20 percent fewer trials than the best existing genetic algorithms. The method is extended to more distributed problems, achieving 95 percent performance gains over tradition methods in the multi-rover domain.

Agogino, Adrian↗
DOE OSTI2026

Use of Digital Real-Time Simulation and Optimization to Identify Maximum Real Power Injection on Banshee Distribution Network

This study investigates the hosting capacity of the Banshee Distribution Network by optimizing the real power injection at carefully selected Distributed Energy Resource (DER) locations. The analysis is conducted within the framework of power system operational constraints, including bus voltage ranges, thermal line ratings, and transformer loading limits. A Python-based Genetic Algorithm (GA), implemented using the PyGAD library, is employed to iteratively identify the optimal power injection configuration that maximizes network utilization while preserving system reliability. The methodology integrates a real-time simulation environment using the Real-Time Digital Simulator (RTDS), allowing high-fidelity evaluation of power flow and voltage behavior under each proposed injection scenario. By coupling the optimization algorithm with real-time simulation feedback, this approach ensures that both static and dynamic constraints are enforced during the evaluation process. The GA leverages evolutionary operators such as selection, crossover, and mutation to navigate the nonlinear search space efficiently. The results of the study delineate the feasible hosting capacity at three targeted buses, reflecting maximum real power levels that can be injected without causing voltage violations, transformer overloading, or line congestion. These findings provide a decision- support tool for distribution planners and utilities aiming to integrate higher penetrations of DERs in existing infrastructure. Additionally, the work lays the foundation for extending such optimization techniques to multi-objective formulations, including economic dispatch and reactive power coordination, in future studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1982

Operator split methods in the numerical solution of the finite deformation elastoplastic dynamic problem

The spatial formulation of the elastoplastic dynamic problem for finite deformations is considered. A thermodynamic argument leads to an additive decomposition of the spatial rate of deformation tensor and allows an operator split of the evolutionary equations of the problem into elastic and plastic parts. This operator split is taken as the basis for the definition of a global product algorithm. In the context of finite element discretization the product algorithm entails, for every time step, the solution of a nonlinear elastodynamic problem followed by the application of plastic algorithms that operate on the stresses and internal variables at the integration points and bring in the plastic constitutive equations. Suitable plastic algorithms are discussed for the cases of perfect and hardening plasticity and viscoplasticity. The proposed formalism does not depend on any notion of smoothness of the yield surface and is applicable to arbitrary convex elastic regions, with or without corners. The stabiity properties of the global product algorithm are shown to be identical to those of the algorithm used for the integration of the nonlinear elastodynamic problem. Numerical examples illustrate the accuracy of the method.

Pinsky, P. M.↗
DOE OSTI2026

Use of Digital Real-Time Simulation and Optimization to Identify Maximum Real Power Injection on the Banshee Distribution Network: Preprint

This study investigates the hosting capacity of the Banshee Distribution Network by optimizing the real power injection at carefully selected Distributed Energy Resource (DER) locations. The analysis is conducted within the framework of power system operational constraints, including bus voltage ranges, thermal line ratings, and transformer loading limits. A Python-based Genetic Algorithm (GA), implemented using the PyGAD library, is employed to iteratively identify the optimal power injection configuration that maximizes network utilization while preserving system reliability. The methodology integrates a real-time simulation environment using the Real-Time Digital Simulator (RTDS), allowing high-fidelity evaluation of power flow and voltage behavior under each proposed injection scenario. By coupling the optimization algorithm with real-time simulation feedback, this approach ensures that both static and dynamic constraints are enforced during the evaluation process. The GA leverages evolutionary operators such as selection, crossover, and mutation to navigate the nonlinear search space efficiently. The results of the study delineate the feasible hosting capacity at three targeted buses, reflecting maximum real power levels that can be injected without causing voltage violations, transformer overloading, or line congestion. These findings provide a decision- support tool for distribution planners and utilities aiming to integrate higher penetrations of DERs in existing infrastructure. Additionally, the work lays the foundation for extending such optimization techniques to multi-objective formulations, including economic dispatch and reactive power coordination, in future studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

MedNAS: Multiscale Training-Free Neural Architecture Search for Medical Image Analysis

Deep neural networks have demonstrated impressive results in medical image analysis, but designing suitable architectures for each specific task is expertise dependent and time consuming. Neural architecture search (NAS) offers an effective means of discovering architectures. It has been highly successful in numerous applications, particularly in natural image classification. Yet, medical images possess unique characteristics, such as small regions and a wide variety of lesion sizes, that differentiate them from natural images. Furthermore, most current NAS methods struggle with high computational costs, especially when dealing with high-resolution image datasets. In this article, we present a novel evolutionary NAS method called multiscale training-free neural architecture search (MSTF-NAS) to address these challenges. Specifically, to accommodate the broad range of lesion region sizes in disease diagnosis, we develop a new reduction cell search space that enables the search algorithm to explicitly identify the optimal scale combination for multiscale feature extraction. Further, to overcome the issue of high computational costs, we utilize training-free indicators as performance measures for candidate architectures, which allows us to search for the optimal architecture more efficiently. More specifically, by considering the capability and simplicity of various networks, we formulate a multiobjective optimization problem that involves two training-free indicators and model complexity for candidate architectures. Extensive experiments on a large medical image benchmark and a publicly available breast cancer detection dataset are conducted. The empirical results demonstrate that our MSTF-NAS outperforms both human-designed architectures and current state-of-the-art NAS algorithms on both datasets, indicating the effectiveness of our proposed method.

60 APPLIED LIFE SCIENCES↗