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 667 records · Page 37

Algorithms in Diffraction Profile Analysis

This chapter introduces several approaches to crystallographic structure refinement from diffraction profile data including the Rietveld method, global optimization methods, and Bayesian modeling. First, the Rietveld method and related nonlinear least squares approaches to analyzing diffraction profiles are briefly discussed. We then review the most common algorithms within global optimization as alternative methods of structure solution: grid search, simulated annealing, and genetic algorithms. As the Rietveld method is the standard tool for analyzing diffraction profile data, we catalogue its challenges and limitations. A Bayesian approach to diffraction profile analysis is presented as an alternative, along with several sampling algorithms including Gibbs sampling, variants of Metropolis sampling, Hamiltonian Monte Carlo, and approximate Bayesian computing. These sampling algorithms are applied to the fitting of a neutron diffraction profile from a National Institute of Standards and Technology silicon standard reference material, and their results are compared.

Singh, Susheela↗

Machine Learning for Dynamic Test Sensor Placement

There are multiple different algorithms to perform modal test sensor placement optimization: effective independence, residual kinetic energy, iterative Guyan reduction, genetic algorithms, or a brute-force methodology. However, any of these methods may be computationally expensive, especially for structural models with a large number of degrees of freedom. Given the high-cost and the need to optimize the solution, modal sensor placement is a great application for machine learning (ML) algorithms. In this paper, we will apply ML algorithms to determine the optimal sensor locations for simple and complex structures. We will also discuss the benefits and drawbacks of using machine learning over other sensor placement algorithms.

Kelsey Buckles↗

Optimization of the Dynamic Aperture for SPEAR3 Low-Emittance Upgrade

A low emittance upgrade is planned for SPEAR3. As the first phase, the emittance is reduced from 10nm to 7nm without additional magnets. A further upgrade with even lower emittance will require a damping wiggler. There is a smaller dynamic aperture for the lower emittance optics due to a stronger nonlinearity. Elegant based Multi-Objective Genetic Algorithm (MOGA) is used to maximize the dynamic aperture. Both the dynamic aperture and beam lifetime are optimized simultaneously. Various configurations of the sextupole magnets have been studied in order to find the best configuration. The betatron tune also can be optimized to minimize resonance effects. The optimized dynamic aperture increases more than 15% from the nominal case and the lifetime increases from 14 hours to 17 hours. It is important that the increase of the dynamic aperture is mainly in the beam injection direction. Therefore the injection efficiency will benefit from this improvement.

43 PARTICLE ACCELERATORS↗

Genetic learning in rule-based and neural systems

The design of neural networks and fuzzy systems can involve complex, nonlinear, and ill-conditioned optimization problems. Often, traditional optimization schemes are inadequate or inapplicable for such tasks. Genetic Algorithms (GA's) are a class of optimization procedures whose mechanics are based on those of natural genetics. Mathematical arguments show how GAs bring substantial computational leverage to search problems, without requiring the mathematical characteristics often necessary for traditional optimization schemes (e.g., modality, continuity, availability of derivative information, etc.). GA's have proven effective in a variety of search tasks that arise in neural networks and fuzzy systems. This presentation begins by introducing the mechanism and theoretical underpinnings of GA's. GA's are then related to a class of rule-based machine learning systems called learning classifier systems (LCS's). An LCS implements a low-level production-system that uses a GA as its primary rule discovery mechanism. This presentation illustrates how, despite its rule-based framework, an LCS can be thought of as a competitive neural network. Neural network simulator code for an LCS is presented. In this context, the GA is doing more than optimizing and objective function. It is searching for an ecology of hidden nodes with limited connectivity. The GA attempts to evolve this ecology such that effective neural network performance results. The GA is particularly well adapted to this task, given its naturally-inspired basis. The LCS/neural network analogy extends itself to other, more traditional neural networks. Conclusions to the presentation discuss the implications of using GA's in ecological search problems that arise in neural and fuzzy systems.

Smith, Robert E.↗

A Comparison of Techniques for Scheduling Earth-Observing Satellites

Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.

Globus, Al↗

Dynamic Optimized Advanced Scheduling of Bandwidth Demands for Large-Scale Science Applications (Final Report)

In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published several conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operation optical WDM networks.

97 MATHEMATICS AND COMPUTING↗

Generative AI for design of nanoporous materials: review and future prospects

Generative artificial intelligence (AI) is emerging as a powerful tool for advancing the design of nanoporous materials such as metal–organic frameworks, covalent–organic frameworks, and zeolites. These materials have potential application in important areas such as carbon capture, catalysis, gas storage, chemical separation, and drug delivery due to their modular, tunable structures, and their performance in these areas depends on precise control over their structure, chemical functionalities, and properties. Herein, we provide a review of generative AI algorithms that are emerging as powerful tools for the design of nanoporous materials, namely generative adversarial networks, variational autoencoders, diffusion models, genetic algorithms, reinforcement learning, and large language models. Some models are particularly good at generating diverse and high-quality designs, while others excel at exploring large design spaces or optimizing materials with desired properties. Certain algorithms also allow for efficient transitions between different designs, and some offer versatility in generating materials based on textual input. We discuss the advantages, limitations, and applications of these algorithms in porous material design and emphasize the future potential of integrating AI with experimental workflows to accelerate the development and validation of AI-generated materials.

36 MATERIALS SCIENCE↗

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↗

Ion-Stockmayer clusters: Minima, classical thermodynamics, and variational ground state estimates of Li{sup +}(CH{sub 3}NO{sub 2}){sub n} (n = 1–20)

Structural optimizations, classical NVT ensemble, and variational Monte Carlo simulations of ion Stockmayer clusters parameterized to approximate the Li{sup +}(CH{sub 3}NO{sub 2}){sub n} (n = 1–20) systems are performed. The Metropolis algorithm enhanced by the parallel tempering strategy is used to measure internal energies and heat capacities, and a parallel version of the genetic algorithm is employed to obtain the most important minima. The first solvation sheath is octahedral and this feature remains the dominant theme in the structure of clusters with n ≥ 6. The first “magic number” is identified using the adiabatic solvent dissociation energy, and it marks the completion of the second solvation layer for the lithium ion-nitromethane clusters. It corresponds to the n = 18 system, a solvated ion with the first sheath having octahedral symmetry, weakly bound to an eight-membered and a four-membered ring crowning a vertex of the octahedron. Variational Monte Carlo estimates of the adiabatic solvent dissociation energy reveal that quantum effects further enhance the stability of the n = 18 system relative to its neighbors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space

Sensor networks have been used in a rapidly increasing number of applications in many fields. This work generalizes a sensor deployment problem to place a minimum set of wireless sensors at candidate locations in constrained 3D space to k-cover a given set of target objects. By exhausting the combinations of discreteness/continuousness constraints on either sensor locations or target objects, we formulate four classes of sensor deployment problems in 3D space: deploy sensors at Discrete/Continuous Locations (D/CL) to cover Discrete/Continuous Targets (D/CT). We begin with the design of an approximate algorithm for DLDT and then reduce DLCT, CLDT, and CLCT to DLDT by discretizing continuous sensor locations or target objects into a set of divisions without sacrificing sensing precision. Furthermore, we consider a connected version of each problem where the deployed sensors must form a connected network, and design an approximation algorithm to minimize the number of deployed sensors with connectivity guarantee. For performance comparison, we design and implement an optimal solution and a genetic algorithm (GA)-based approach. Extensive simulation results show that the proposed deployment algorithms consistently outperform the GA-based heuristic and achieve a close-to-optimal performance in small-scale problem instances and a significantly superior overall performance than the theoretical upper bound.

47 OTHER INSTRUMENTATION↗

Piston Bowl Optimization for RCCI Combustion in a Light-Duty Multi-Cylinder Engine

Reactivity Controlled Compression Ignition (RCCI) is an engine combustion strategy that that produces low NO{sub x} and PM emissions with high thermal efficiency. Previous RCCI research has been investigated in single-cylinder heavy-duty engines. The current study investigates RCCI operation in a light-duty multi-cylinder engine at 3 operating points. These operating points were chosen to cover a range of conditions seen in the US EPA light-duty FTP test. The operating points were chosen by the Ad Hoc working group to simulate operation in the FTP test. The fueling strategy for the engine experiments consisted of in-cylinder fuel blending using port fuel-injection (PFI) of gasoline and early-cycle, direct-injection (DI) of diesel fuel. At these 3 points, the stock engine configuration is compared to operation with both the original equipment manufacturer (OEM) and custom machined pistons designed for RCCI operation. The pistons were designed with assistance from the KIVA 3V computational fluid dynamics (CFD) code. By using a genetic algorithm optimization, in conjunction with KIVA, the piston bowl profile was optimized for dedicated RCCI operation to reduce unburned fuel emissions and piston bowl surface area. By reducing these parameters, the thermal efficiency of the engine was improved while maintaining low NOx and PM emissions. Results show that with the new piston bowl profile and an optimized injection schedule, RCCI brake thermal efficiency was increased from 37%, with the stock EURO IV configuration, to 40% at the 2,600 rev/min, 6.9 bar BMEP condition, and NOx and PM emissions targets were met without the need for exhaust after-treatment.

02 PETROLEUM↗

Accelerating Lipidomic Method Development through in Silico Simulation

Judicious selection of mass spectrometry (MS) acquisition parameters is essential for effectively profiling the broad diversity and dynamic range of biomolecules. Typically, acquisition parameters are individually optimized to maximally characterize analytes from each new sample matrix. This time-consuming process often ignores the synergistic relationship between MS method parameters, producing suboptimal results. Here in this paper, we detail the creation of an algorithm which accurately simulates LC-MS/MS lipidomic data acquisition performance for a benchtop quadrupole-Orbitrap MS system. By coupling this simulation tool with a genetic algorithm for constrained parameter optimization, we demonstrate the efficient identification of LC-MS/MS method parameter sets individually suited for specific sample matrices. Finally, we utilize the in silico simulation to examine how continued developments in MS acquisition speed and sensitivity will further increase the power of MS lipidomics as a vital tool for impactful biochemical analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Integration of sensing and computing in an intelligent decision support system for homeland security defense

We propose an intelligent decision support system based on sensor and computer networks that incorporates various component techniques for sensor deployment, data routing, distributed computing, and information fusion. The integrated system is deployed in a distributed environment composed of both wireless sensor networks for data collection and wired computer networks for data processing in support of homeland security defense. We present the system framework and formulate the analytical problems and develop approximate or exact solutions for the subtasks: (i) sensor deployment strategy based on a two-dimensional genetic algorithm to achieve maximum coverage with cost constraints; (ii) data routing scheme to achieve maximum signal strength with minimum path loss, high energy efficiency, and effective fault tolerance; (iii) network mapping method to assign computing modules to network nodes for high-performance distributed data processing; and (iv) binary decision fusion rule that derive threshold bounds to improve system hit rate and false alarm rate. These component solutions are implemented and evaluated through either experiments or simulations in various application scenarios. The extensive results demonstrate that these component solutions imbue the integrated system with the desirable and useful quality of intelligence in decision making.

59 BASIC BIOLOGICAL SCIENCES↗

Costs of Limiting Route Optimization to Published Waypoints in the Traffic Aware Planner

The Traffic Aware Planner (TAP) is an airborne advisory tool that generates optimized, traffic-avoiding routes to support the aircraft crew in making strategic reroute requests to Air Traffic Control (ATC). TAP is derived from a research-prototype self-separation tool, the Autonomous Operations Planner (AOP), in which optimized route modifications that avoid conflicts with traffic and weather, using waypoints at explicit latitudes and longitudes (a technique supported by self-separation concepts), are generated by maneuver patterns applied to the existing route. For use in current-day operations in which trajectory changes must be requested from ATC via voice communication, TAP produces optimized routes described by advisories that use only published waypoints prior to a reconnection waypoint on the existing route. We describe how the relevant algorithms of AOP have been modified to implement this requirement. The modifications include techniques for finding appropriate published waypoints in a maneuver pattern and a method for combining the genetic algorithm of AOP with an exhaustive search of certain types of advisory. We demonstrate methods to investigate the increased computation required by these techniques and to estimate other costs (measured in terms such as time to destination and fuel burned) that may be incurred when only published waypoints are used.

TASAR↗

An Open, Cloud-Based Platform for Whole-Building Fault Detection and Diagnostics

Small commercial buildings in the U.S. waste an estimated 300 Trillion BTU (approximately $6 billion in energy costs) annually due to faults, but lack cost-effective automated fault detection and diagnosis (AFDD) tools. NREL and GE Global Research are partnering to develop hybrid AFDD algorithms tailored to the unique needs of small commercial buildings (</=10,000 sq. ft.). The approach combines physics-based energy modeling tools with state-of-the-art machine learning algorithms to enable diagnostics using modeled input data. NREL, in partnership with Purdue University, has adapted DOE's physics-based modeling software EnergyPlus and OpenStudio to simulate common building faults. Cloud-based implementations of these physics-based models were used to generate data for multiple climate zones. The data were then used to train machine learning algorithms, such as those available in GE's Predix platform, to detect and diagnose building faults. Key features of the system including the automated, cloud-implementation of EnergyPlus, genetic algorithms for automated model feature selection, multiclass detection and diagnosis models, and anomaly detection algorithms will be presented.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Experimental Results for Mars Rotorcraft Airfoils (roamx-0201 and clf5605) at Low Reynolds Number and Compressible Flow in a Mars Wind Tunnel

Experimental results are obtained for a roamx-0201 type airfoil and the clf5605 airfoil at highsubsonic, low Reynolds number conditions using the Tohoku University Mars Wind Tunnel, Japan. The tests are conducted at a Mach number of M = 0.60, and a Reynolds number of Re = 20,000 to reflect representative aerodynamics of a rotor blade for Mars exploration. The angle of attack is varied between α = −2.0 deg and α = 6.0 deg. The roamx-0201 type airfoil is an unconventional airfoil optimized for the chosen tunnel operating conditions using the Evolutionary aLgorithm for Iterative Studies of Aeromechanics (ELISA), developed under the Rotor Optimization for the Advancement of Mars eXploration (ROAMX) project. ELISA is utilized here to optimize aerodynamic airfoil performance using a Genetic Algorithm and two-dimensional high-fidelity CFD simulations, ultimately resulting in a Pareto-optimal airfoil set. The clf5605 airfoil is the outboard airfoil used on the Ingenuity Mars Helicopter and provides a baseline against which the roamx-0201, as well as possible future airfoil profiles for the compressible low Reynolds number regime, can be compared against. Lift and drag data are recorded using a balance, pressure distributions are obtained using Pressure Sensitive Paint (PSP) application, and Schlieren images are obtained to visualize the flowfield. The data is tabulated to aid future research.

Roamx↗

Evolvable Hardware for Spacecraft Autonomy

Evolvable hardware is a recently proposed technology in which reconfigurable hardware under the control of and evolutionary (genetic) algorithm can automatically self-reconfigure into sonfigurations with the desired behavior.

digital↗

Accelerated optimization and automated discovery with covariance matrix adaptation for experimental quantum control

Optimization of quantum systems by closed-loop adaptive pulse shaping offers a rich domain for the development and application of specialized evolutionary algorithms. Derandomized evolution strategies (DESs) are presented here as a robust class of optimizers for experimental quantum control. The combination of stochastic and quasi-local search embodied by these algorithms is especially amenable to the inherent topology of quantum control landscapes. Implementation of DES in the laboratory results in efficiency gains of up to {approx}9 times that of the standard genetic algorithm, and thus is a promising tool for optimization of unstable or fragile systems. The statistical learning upon which these algorithms are predicated also provide the means for obtaining a control problem's Hessian matrix with no additional experimental overhead. The forced optimal covariance adaptive learning (FOCAL) method is introduced to enable retrieval of the Hessian matrix, which can reveal information about the landscape's local structure and dynamic mechanism. Exploitation of such algorithms in quantum control experiments should enhance their efficiency and provide additional fundamental insights.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗