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 1,045 records · Page 58

Accelerated CO2 Storage Optimization Using Multi-Resolution Fourier Neural Operator at the Illinois Basin Decatur Project (IBDP)

This paper presents a deep learning-based approach for optimizing CO2 injection in carbon capture and storage (CCS) operations. We developed a multi-resolution machine learning model to significantly reduce data generation costs. Utilizing this proxy model, we implemented a multi-objective genetic algorithm to optimize well control during the CO2 injection process. The proposed approach was applied to the Illinois Basin Decatur Project (IBDP), successfully optimizing the CO2 injection schedule based on three key objectives: maximizing the amount of CO2 stored, maximizing sweep efficiency, and minimizing pressure increase. The use of the proxy model accelerated the optimization workflow by two orders of magnitude, while the cost of data generation for the proxy model was reduced by 90% by utilizing a coarse-scale model.

accelerated CO2 storage optimization↗

REIMAGINING HEAT EXCHANGERS FOR NEXT GENERATION ENVIRONMENTAL SYSTEMS

Air-to-refrigerant heat exchangers (HXs) are essential components in space conditioning, refrigeration, and power systems, and recent efforts have focused on making these devices more compact, reducing refrigerant charge and lowering manufacturing costs. Historically, HX innovation has been limited by available computational resources, design tools, and manufacturing constraints. The best available technologies utilize tube-fin and micro- or macro-channel tubes with fins, which are not necessarily the optimal designs achievable with current technology. In this paper, we highlight the latest advancements in air-to-refrigerant HXs, specifically emphasizing innovations achieved through shape and topology optimization. A multi-scale design optimization approach is introduced, alongside similar methods in literature, which enable highly sophisticated shape-optimized tube designs with more than 50% reduction in size and 25% reduction in refrigerant charge, essential for A3 refrigerant charge limit compliance. The frameworks integrate traditional heat and mass transfer science with state-of-the-art machine learning, genetic algorithms, and adjoint algorithms to create novel designs. While many of these innovative designs may not be manufacturable using conventional methods, they allow us explore the boundaries of what is possible. These novel air-to-refrigerant HXs are key enablers for ultra-low-refrigerant charge heat pump and refrigeration systems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

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↗

DEVELOPMENT AND APPLICATION OF RISK ANALYSIS TOOLKIT FOR PLANT RESOURCE OPTIMIZATION

This paper presents the development of methods and tools that are being designed to optimize plant operations (e.g., maintenance/replacement schedules and optimal maintenance postures for plant components) in a manner that is more cost effective than current approaches and makes better use of available component health and cost data. These methods include both data- and model-based optimization methods. Model-based optimization methods directly include reliability and cost models to determine an optimal plant operational strategy. We consider gradient-based and evolutionary (based on genetic algorithms) optimization methods. The second class of methods target more specific use cases (e.g., project schedule optimization) and are not based on reliability models directly, but they require specific component reliability and cost data. This class of methods is based on variants of the knapsack problem with an aim to determine an optimal project schedule that maximizes the overall NPV. This paper also presents multi-objective methods designed to identify an optimal maintenance posture based on a Pareto frontier analysis. Rather than dictating the “right” tradeoff (i.e., identify the absolute best posture), we show how it is possible to perform a trade space exploration approach (i.e., identify value and costs of several postures and let the analysis account for desired value and cost metrics). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space. For all these methods we present detailed applicative examples that show their validity from a decision-making perspective.

97 - MATHEMATICS AND COMPUTING↗

Optimization of a Secondary Air Injector for a Rich-Quench-Lean (RQL) Ammonia Combustor Using Computational Fluid Dynamics

Ammonia has emerged as a promising medium for moving hydrogen around the globe due to its energy density, existing infrastructure for production, transportation, and storage, and multiple applications from fertilizer to power generation. However, one of the most significant challenges with ammonia combustion for power generation is the formation of nitrogen oxides (NOx) during combustion. Several combustion strategies have been developed to minimize the formation of NOx. One such strategy, known as rich-quench-lean (RQL), is a method that combusts NH3 in a fuel-rich environment, followed by a quick mix section and a lean burnout section. Rapid mixing of secondary air before lean burnout is thought to be important to minimize the formation of NOx. A genetic algorithm (GA) is used to parametrically vary the secondary air injector design, including the diameter, count, and angles over a constrained design space. The designs are evaluated using a non-reacting OpenFOAM model, with the objective function being the uniformity index of the secondary air (modeled as a scalar). Optimization campaigns show that traditional correlation-based designs might not be adequate. After running 414 OpenFOAM models, the optimal design is 32, 1 mm diameter, angled air injectors, increasing the uniformity index at the outlet of the quick mix zone by 36.8%. The most promising designs will be manufactured and tested in a small RQL burner setup, which is expected to lead to validation and insight into the practical usage of NH3 combustion for power generation.

ammonia combustion↗

Blade and Rim Seal Design of a First Stage High Pressure Turbine for a 300 MWe Supercritical CO2 Power Cycle

A first stage high-pressure turbine (HPT) blade is optimized for a 300 MWe supercritical CO2 (sCO2) power cycle using the surrogate-assisted genetic algorithm optimizer in Numeca FINE/Design 3D with objectives of increasing efficiency and decreasing heat load to the blade. The National Institute of Standards and Technology Reference Fluid Thermodynamic and Transport Properties Database (NIST REFPROP) [1] data for supercritical CO2 is formatted into tables of bicubic polynomial coefficients for use in condensable gas simulations in FINE/Turbo. Nearly 3000 unique shapes are evaluated via three-dimensional Reynolds Averaged Navier Stokes simulations, yielding increases in efficiency of up to 0.85 percentage points and decreases in heat load of 14%. A final blade, deemed the advanced blade, is chosen for future experimental analysis. Following this, a squealer tip optimization is performed on both the baseline and advanced blade designs. This optimization resulted in a performance gain of 1.25 points in efficiency and 15% reduction in tip heat load compared to the baseline flat tip design at the same clearance. In tandem, an optimization of the rotor-stator platform rim seal is performed using a parametrized geometry allowing for straight, meandering, and knife seal cavities. This multi-objective optimization focuses on decreasing the cooling mass flow and increasing the heat flux from the rotor and stator disk. The optimization resulted in cooling mass flow decreases of up to 26% while maintaining the average heat flux on the rim seal.

Tuite, Logan↗

Optimized Gear Selection to Maximize Energy Savings in Electric Traction Drives for Medium and Heavy Duty Vehicles

Multi‑gear transmission systems are commonly used in electric traction drives for medium and heavy‑duty vehicles, while most passenger‑vehicle electric drivetrains rely on a single fixed ratio to reduce cost, weight, and complexity. Using multiple gear ratios can enable downsizing of the motor and inverter while still meeting performance requirements. Additionally, appropriately chosen ratios allow the motor to operate more frequently in high‑efficiency regions, improving overall energy usage and reducing operating costs over the drive cycle. This paper presents a systematic approach for selecting optimal gear ratios for electric drive systems. A neural‑network model is first developed to represent motor losses across the full torque–speed range using data generated from finite element analysis. This model enables fast, accurate evaluation of motor efficiency under varying operating conditions. A genetic‑algorithm‑based optimization framework is then applied to identify gear ratios that maximize energy cost savings over the drive cycle, with the resulting optimal ratios stored for real‑time implementation.

Gadiyar, Nishanth [ORNL] (ORCID:0000000348267524)↗

Voxel Based Three-Dimensional Topology Optimization of Heat Exchanger Fins

Increasing interest in novel aircraft propulsion systems and potential for unwanted heat generation, or capture and reuse of waste heat, may require increasingly lightweight and high performing heat exchangers. Advances in manufacturing technologies have shown potential to create complex designs, but design tools need more flexibility. This study utilizes genetic algorithm-driven topology optimization to develop high performance heat exchanger fins for critical applications such as aerospace. The solid domain is generated using voxel representation where a voxel value of 1 indicates the solid domain and a voxel value of 0 refers to the fluid domain. The use of voxel representation somewhat matches the digitization of a model that is required to fabricate using additive manufacturing, and also allows for a highly unconstrained geometry. To test the topology optimization approach, a three-dimensional(3D)baseline offset strip fin geometry in steady laminar flow(Reynolds number = 215)with conjugate heat transfer(simultaneous solution of solid and fluid temperature fields)is optimized. New designs are generated using the genetic algorithm (GA) and sent to evaluation by the CFD software OpenFOAM; then the GA sorts and selects the reproduction pool for the following generation. This process is repeated for 60 generations. The study also investigates the effect off in material on the performance of the GA and the resulting designs. The results show that the optimal designs have overall performance improvement of 18% relative to the baseline. Additionally, a fin constructed of a lower conductivity material (such as an Inconel super alloy that might be necessary for waste heat recovery applications)results in lower overall performance improvement (11%)and optimal designs with higher pressure drop relative to their baseline, and relative to optimal designs produced using higher conductivity materials.

3D Optimization↗

Autonomous Selective Parts-Based Tracking

Object tracking from videos is still a challenging task due to various changes throughout a video sequence including occlusions, motion blur, scale and other deformation changes. In this paper, we propose a selective parts-based approach, using correlation filters, that makes choices based on a consensus of the parts and global tracking. Moreover, we further enhance our parts-based approach by introducing a segmentation-assisted parts initialization. In addition, we present a genetic algorithm-based method to autonomously select various parameters of the tracking algorithm, as opposed to the common practice of manually tuning those parameters. In contrast to existing part-based methods, the proposed method does not dilute accurate tracking by averaging results over multiple parts at every frame. Instead, we take a selective approach based on the relative weight of the responses across parts. Moreover, we only make location corrections when a part diverges, and rely on these location corrections to maintain an accurate appearance model. In the case of occlusions, which are among the main reasons for using a parts-based approach, our proposed approach consistently achieves the best performance. It is due to the ability to handle occlusion and not dilute decisions with incorrect parts, that our proposed approach enables state-of-the-art performance. The approach we propose was evaluated on videos from three different challenging benchmark datasets. Our approach has resulted in better overall precision and success rates for three different base tracking approaches.

42 ENGINEERING↗

Bell-Curve Based Evolutionary Optimization Algorithm

The paper presents an optimization algorithm that falls in the category of genetic, or evolutionary algorithms. While the bit exchange is the basis of most of the Genetic Algorithms (GA) in research and applications in America, some alternatives, also in the category of evolutionary algorithms, but use a direct, geometrical approach have gained popularity in Europe and Asia. The Bell-Curve Based Evolutionary Algorithm (BCB) is in this alternative category and is distinguished by the use of a combination of n-dimensional geometry and the normal distribution, the bell-curve, in the generation of the offspring. The tool for creating a child is a geometrical construct comprising a line connecting two parents and a weighted point on that line. The point that defines the child deviates from the weighted point in two directions: parallel and orthogonal to the connecting line, the deviation in each direction obeying a probabilistic distribution. Tests showed satisfactory performance of BCB. The principal advantage of BCB is its controllability via the normal distribution parameters and the geometrical construct variables.

Sobieszczanski-Sobieski, J.↗

Hierarchical Stochastic Simulation Algorithm for SBML Models of Genetic Circuits

This paper describes a hierarchical stochastic simulation algorithm, which has been implemented within iBioSim, a tool used to model, analyze, and visualize genetic circuits. Many biological analysis tools flatten out hierarchy before simulation, but there are many disadvantages associated with this approach. First, the memory required to represent the model can quickly expand in the process. Second, the flattening process is computationally expensive. Finally, when modeling a dynamic cellular population within iBioSim, inlining the hierarchy of the model is inefficient since models must grow dynamically over time. This paper discusses a new approach to handle hierarchy on the fly to make the tool faster and more memory-efficient. This approach yields significant performance improvements as compared to the former flat analysis method.

60 APPLIED LIFE SCIENCES↗

Evolutionary Optimization of Yagi-Uda Antennas

Yagi-Uda antennas are known to be difficult to design and optimize due to their sensitivity at high gain, and the inclusion of numerous parasitic elements. We present a genetic algorithm-based automated antenna optimization system that uses a fixed Yagi-Uda topology and a byte-encoded antenna representation. The fitness calculation allows the implicit relationship between power gain and sidelobe/backlobe loss to emerge naturally, a technique that is less complex than previous approaches. The genetic operators used are also simpler. Our results include Yagi-Uda antennas that have excellent bandwidth and gain properties with very good impedance characteristics. Results exceeded previous Yagi-Uda antennas produced via evolutionary algorithms by at least 7.8% in mainlobe gain. We also present encouraging preliminary results where a coevolutionary genetic algorithm is used.

Lohn, Jason D.↗

Automating Discovery of Physics-Informed Neural State Space Models via Learning and Evolution

Recent works exploring deep learning application to dynamical systems modeling have demonstrated that embedding physical priors into neural networks can yield more effective, physically-realistic, and data-efficient models. However, in the absence of complete prior knowledge of a dynamical system's physical characteristics, determining the optimal structure and optimization strategy for these models can be difficult. In this work, we explore methods for discovering neural state space dynamics models for system identification. Starting with a design space of block-oriented state space models and structured linear maps with strong physical priors, we encode these components into a model genome alongside network structure, penalty constraints, and optimization hyperparameters. Demonstrating the overall utility of the design space, we employ an asynchronous genetic search algorithm that alternates between model selection and optimization and obtains accurate physically consistent models of three physical systems: an aerodynamics body, a continuous stirred tank reactor, and a two tank interacting system.

genetic algorithms, neural architecture search, ne↗

Reveal, A General Reverse Engineering Algorithm for Inference of Genetic Network Architectures

Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/output patterns of its variables? We investigated this possibility using binary models of genetic networks. Trajectories, or state transition tables of Boolean nets, resemble time series of gene expression. By systematically analyzing the mutual information between input states and output states, one is able to infer the sets of input elements controlling each element or gene in the network. This process is unequivocal and exact for complete state transition tables. We implemented this REVerse Engineering ALgorithm (REVEAL) in a C program, and found the problem to be tractable within the conditions tested so far. For n = 50 (elements) and k = 3 (inputs per element), the analysis of incomplete state transition tables (100 state transition pairs out of a possible 10(exp 15)) reliably produced the original rule and wiring sets. While this study is limited to synchronous Boolean networks, the algorithm is generalizable to include multi-state models, essentially allowing direct application to realistic biological data sets. The ability to adequately solve the inverse problem may enable in-depth analysis of complex dynamic systems in biology and other fields.

Liang, Shoudan↗

Pressurized-Water Reactor Core Design using Multi-Objective Plant Fuel Reload Optimization Platform

The United States (U.S.) Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program Risk-Informed Systems Analysis (RISA) Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimization of core design. The optimization of the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible options of core configuration, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization (PRLO) platform which supports artificial-intelligence-based reactor core designing is now fully capable of handling realistic problems. The PRLO Platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm-II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual Environment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multi-objective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.

42 ENGINEERING↗

Autonomous Human Activity Classification From Wearable Multi-Modal Sensors

There has been significant amount of research work on human activity classification relying either on Inertial Measurement Unit (IMU) data or data from static cameras providing a third-person view. There has been relatively less work using wearable cameras, providing first-person or egocentric view, and even fewer approaches combining egocentric video with IMU data. Utilizing only IMU data limits the variety and complexity of the activities that can be detected. For instance, the sitting activity can be detected by IMU data, but it cannot be determined whether the subject has sat on a chair or a sofa, or where the subject is. To perform fine-grained activity classification, and to distinguish between activities that cannot be differentiated by only IMU data, we present an autonomous and robust method using data from both wearable cameras and IMUs. In contrast to convolutional neural network-based approaches, we propose to employ capsule networks to obtain features from egocentric video data. Moreover, Convolutional Long Short Term Memory framework is employed both on egocentric videos and IMU data to capture the temporal aspect of actions. We also propose a genetic algorithm-based approach to autonomously and systematically set various network parameters, rather than using manual settings. Experiments have been conducted to perform 9- and 26-label activity classification, and the proposed method, using autonomously set network parameters, has provided very promising results, achieving overall accuracies of 86.6% and 77.2%, respectively. The proposed approach, combining both modalities, also provides increased accuracy compared to using only egovision data and only IMU data.

47 OTHER INSTRUMENTATION↗

Orbit design and optimization based on global telecommunication performance metrics

The orbit selection of telecommunications orbiters is one of the critical design processes and should be guided by global telecom performance metrics and mission-specific constraints. In order to aid the orbit selection, we have coupled the Telecom Orbit Analysis and Simulation Tool (TOAST) with genetic optimization algorithms. As a demonstration, we have applied the developed tool to select an optimal orbit for general Mars telecommunications orbiters with the constraint of being a frozen orbit. While a typical optimization goal is to minimize tele-communications down time, several relevant performance metrics are examined: 1) area-weighted average gap time, 2) global maximum of local maximum gap time, 3) global maximum of local minimum gap time. Optimal solutions are found with each of the metrics. Common and different features among the optimal solutions as well as the advantage and disadvantage of each metric are presented. The optimal solutions are compared with several candidate orbits that were considered during the development of Mars Telecommunications Orbiter.

genetic algorithms↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗