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 451 records · Page 25

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↗

B-jet and c-jet identification with Neural Networks as well as combination of multivariate analyses for the search for of multivariate analyses for the search for single top-quark production

In the first part of this diploma thesis, the current version of the KIT Flavor Separator, a neural network which is able to distinguish between tagged b-quark jets and tagged c/light-quark jets, is presented. In comparison with previous versions four new input variables are utilized and new Monte Carlo samples with a larger number of simulated events are used for the training of the neural network. It is illustrated that the output of the neural network is continuously distributed between 1 and -1, whereas b-quark jets accumulate at 1, however, c-quark jets and light-quark jets have outputs next to -1. To ensure that the network output describes observed events correctly, the shapes of all input variables are compared in simulation and data. Thus the mismodelling of any input variable is excluded. Moreover, the b jet and light jet output distributions are compared with the output of samples of observed events, which are enhanced in the particular flavor. In contrast to previous versions, no b-jet output correction function has to be calculated, because the agreement between simulation and collision data is excellent for b-quark jets. For the light-jet output, correction functions are developed. Different applications of the KIT Flavor Separator are mentioned. For example it provides a precious input to all three CDF single top quark analyses. Furthermore, it is shown that the KIT Flavor Separator is a universal tool, which can be used in every high-p{sub T} analysis that requires the identification of b-quark jets with high efficiency. As it is pointed out, a further application is the estimation of the flavor composition of a given sample of observed events. In addition a neural network, which is able to separate c-quark jets from light-quark jets, is trained. It is shown, that all three flavors can be separated in the c-net-Flavor Separator plane. As a result, the uncertainties on the estimation of the flavor composition in events with one tagged jet are cut into half. In the second part of this diploma thesis, a method for the combination of three multivariate single-top analyses using an integrated luminosity of 2.2 fb{sup -1} is presented. For this purpose the discriminants of the Likelihood Function analysis, the Matrix Element method and the Neural Network analysis are used as input variables to a neural network. Overall four different networks are trained, one for events with two or three jets and one or two SecVtx tags, respectively. Using a binned likelihood function, the outputs of these networks are fitted to the output distribution of observed events. A single top-quark production cross section of {sigma}{sub single-top} = 2.2{sub -0.7}{sup +0.8} pb is measured. Ensemble tests are performed for the calculation of the sensitivity and observed significance, which are found to be 4.8{sigma} and 3.9{sigma}, respectively. Hence the improvement of this combination is roughly 8% in comparison with sensitivities found by the individual analyses. Due to the proportionality of {sigma}{sub single-top} and |V{sub tb}|{sup 2} and under the assumption V{sub tb} >> V{sub ts}, V{sub td}, a value for |V{sub tb}| is quoted: |V{sub tb}| = 0.88{sub -0.12}{sup +0.14}(exp.) {+-} 0.07(theo.). It can be seen, that the given uncertainties are too large for a verification or falsification of the unitarity assumption of the CKM-matrix. Parallel to this combination a further combination method (NEAT-combination) has been developed. This combination uses a neural network trained with a neuroevolution technique, which optimizes the neural network architecture and weights through the use of genetic algorithms. In this analysis an improvement of roughly 12% could be reached. In figure 7.1 the current situation for the measurement of the single top-quark production cross section is summarized. After collecting more data, CDF will be able to observe single top-quark production with a significance larger than 5.0{sigma}. Nevertheless, the cross section measurement will still have large uncertainties on the level of 20%. Precise measurements on the few percent level will only be possible at the LHC. Recent studies for the CMS detector showed, that the t-channel cross section can be measured with an accuracy of 7% in 1 fb{sup -1} of LHC data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

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↗

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↗

Explainable Neural Architecture Search (XNAS)

Code for the paper Learning Interpretable Models Through Multi-Objective Neural Architecture Search by Zachariah Carmichael, Tim Moon, and Sam Ade Jacobs. Monumental advances in deep learning have led to unprecedented achievements across a multitude of domains. While the performance of deep neural networks is indubitable, the architectural design and interpretability of such models are nontrivial. Research has been introduced to automate the design of neural network architectures through neural architecture search (NAS). Recent progress has made these methods more pragmatic by exploiting distributed computation and novel optimization algorithms. However, there is little work in optimizing architectures for interpretability. To this end, we propose a multiobjective distributed NAS framework that optimizes for both task performance and introspection. We leverage the non-dominated sorting genetic algorithm (NSGA-II) and explainable AI (XAI) techniques to reward architectures that can be better comprehended by humans. The framework is evaluated on several image classification datasets. We demonstrate that jointly optimizing for introspection ability and task error leads to more disentangled architectures that perform within tolerable error.

Carmichael, ZachariahJ↗

A Hierarchical Optimization Method for Electric Vertical Takeoff and Landing Aircraft Network Design

Electric vertical takeoff and landing aircraft (eVTOLs) are expected to serve urban air mobility in a station-to-station configuration, which makes the optimal network design of eVTOL stations a critical question to explore. Existing approaches often face limitations, such as the inability to interact station locations with demand or difficulty in finding the optimal solution for large study regions. Here, this paper first proposes a mathematical model to generate optimal eVTOL station locations while considering associated potential eVTOL demand, and then proposes a heuristic algorithm, Hierarchical Optimization MEthod (HOME), to efficiently solve the model. With a case study of Southern California, HOME was compared to 1) directly solving the original integer linear programming-based network design problem, and 2) employing the widely used genetic algorithm. Results suggest that HOME can find optimal solutions with limited computational resources. The proposed framework powered by HOME provides a computationally efficient way to support urban air mobility planning.

97 MATHEMATICS AND COMPUTING↗

Classifier-guided sampling for discrete variable, discontinuous design space exploration: Convergence and computational performance

A classifier-guided sampling (CGS) method is introduced for solving engineering design optimization problems with discrete and/or continuous variables and continuous and/or discontinuous responses. The method merges concepts from metamodel-guided sampling and population-based optimization algorithms. The CGS method uses a Bayesian network classifier for predicting the performance of new designs based on a set of known observations or training points. Unlike most metamodeling techniques, however, the classifier assigns a categorical class label to a new design, rather than predicting the resulting response in continuous space, and thereby accommodates nondifferentiable and discontinuous functions of discrete or categorical variables. The CGS method uses these classifiers to guide a population-based sampling process towards combinations of discrete and/or continuous variable values with a high probability of yielding preferred performance. Accordingly, the CGS method is appropriate for discrete/discontinuous design problems that are ill-suited for conventional metamodeling techniques and too computationally expensive to be solved by population-based algorithms alone. In addition, the rates of convergence and computational properties of the CGS method are investigated when applied to a set of discrete variable optimization problems. Results show that the CGS method significantly improves the rate of convergence towards known global optima, on average, when compared to genetic algorithms.

42 ENGINEERING↗

ENGINE COMBUSTION SYSTEM OPTIMIZATION USING CFD AND MACHINE LEARNING: A METHODOLOGICAL APPROACH

Gasoline compression ignition (GCI) engines are considered an attractive alternative to traditional spark-ignition and diesel engines. In this work, a Machine Learning-Grid Gradient Algorithm (ML-GGA) approach was developed to optimize the performance of internal combustion engines. Machine learning (ML) offers a pathway to transform complex physical processes that occur in a combustion engine into compact informational processes. The developed ML-GGA model was compared with a recently developed Machine learning Genetic Algorithm (ML-GA). Detailed investigations of optimization solver parameters and variables limits extension were performed in the present ML-GGA model to improve the accuracy and robustness of the optimization process. Detailed descriptions of the different procedures, optimization tools and criteria that must be followed for a successful output are provided here. The developed ML-GGA approach was used to optimize the operating conditions (case 1) and the piston bowl design (case 2) of a heavy-duty diesel engine running on a gasoline fuel with a Research Octane Number (RON) of 80. The ML-GGA approach yielded > 2% improvements in the merit function, compared to the optimum obtained from a thorough computational fluid dynamics (CFD) guided system optimization. The predictions from the ML-GGA approach were validated with engine CFD simulations. This study demonstrates the potential of ML-GGA to significantly reduce the time needed for optimization problems, without loss in accuracy compared to traditional approaches.

engine optimization↗

A propagation-based fault detection and discrimination method and the optimization of sensor deployment

Industrial processes can be affected by faults having a serious impact on operation when not promptly detected and diagnosed. Here in this paper, a propagation-based fault detection and discrimination(PFDD) method is proposed to develop a strategy for fault diagnosis while in the design phase of a system. The PFDD method constructs the system model using the Integrated System Fault Analysis(ISFA) technique. Based on the system model, the propagation of hardware and software faults are simulated qualitatively. Given the results of the simulation, the process by which a fault propagates can be characterized using the qualitative features of system variables including the deviation of the system variables from their expected values, the variation of the system variables over time, and the order in which each variable is influenced during the propagation of the fault. The strategy by which a fault can be detected and discriminated is defined using those features. The PFDD method supports the detection and discrimination of faults in both steady states and transient states. Based on the PFDD method, the optimization of sensor deployment in a system is discussed. A brute force algorithm is developed to examine the system’s capability at diagnosing faults and the cost of sensor deployment for all possible configurations of sensors. The optimal sensor deployment strategy can be derived accordingly. However, the brute force method is only applicable to small-scale systems due to its high computational cost. A genetic algorithm is used to optimize sensor deployment in large-scale systems. The PFDD and sensor deployment optimization methods are applied to the Experimental Breeder Reactor II (EBR-II) for verification.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Towards mitigating explosive threats using quantum controlled initiation

Quantum control of localized energy deposition into an energetic material is being investigated as a method to allow controlled initiation and propagation of action without transition to detonation. Quantum controlled initiation (QCI) of explosives utilize time dependent phase shaped ultraviolet (UV) electric fields to drive the energetic chemical systems towards reaction. QCI searches for an optimally shaped ultrafast laser pulse that will guide energy flow along a desired path. QCI can be exploited as a stand-off mitigation technology that strives to reduce the impact of explosive blasts on people and property by initiating controlled low order reaction. Quantum controlled initiation experiments require: (1) optimally shaped light pulses, (2) pulse shaping measurement, (3) feedback control algorithms, and (4) feedback measurement methods. Femtosecond laser pulse shaping in the UV at 400 nm employs a fused silica acousto-optic modulator (AOM) pulse shaper that consists of a 4-f zero dispersion compressor. Tr sient absorption spectroscopy is used to measure the pulse shaper effects. Both global and local optimization search routines such as genetic algorithm, differential evolution, and downhill simplex are used to search for the optimal pulse shape. Hexanitroazobenzene (HNAB), Trinitroanaline (TNA) and Diaminoazozyfurazan (DAAF) are excited to the first electronic state with 400 nm light. Our initiation experiments are studying the effect of phase shaped 400 nm pulses on HNAB, TNA and DAAF. The transient absorption spectra for each material have been obtained and note worthy regions further investigated with single parameter control (second order spectral phase and energy). Many systems have simple intensity control such as that shown by DAAF. TNA and HNAB have spectral features that are not single parameter driven and are being further investigated to obtain fully optimized complex control.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

A systematic comparison of machine learning methods for modeling of dynamic processes applied to combustion emission rate modeling

Ten established, data-driven dynamic algorithms are surveyed and a practical guide for understanding these methods generated. Existing Python programming packages for implementing each algorithm are acknowledged, and the model equations necessary for prediction are presented. A case study on a coal-fired power plant’s NO x emission rates is performed, directly comparing each modeling method’s performance on a mutual system. Each model is evaluated by its root mean squared error (RMSE) on out-of-sample future horizon predictions. Optimal hyperparameters are identified using either an exhaustive search or genetic algorithm. The top five model structures of each method are used to recursively predict future NO x emission rates over a 60-step time horizon. The RMSE at each future timestep is determined, and the recursive output prediction trends compared against measurements in time. The GRU neural network is identified as the best candidate for representing the system, demonstrating accurate and stable predictions across the future horizon by all considered models, while satisfactory performance was observed in several of the ARX/NARX formulations. Finally, these efforts have contributed 1) a concise resource of multiple proven dynamic machine learning methods, 2) a practical guide explaining the use of these methods, effectively lowering the “barrier-to-entry” of deploying such models in control systems, 3) a comparison study evaluating each method’s performance on a mutual system, 4) demonstration of accurate multi-timestep emissions modeling suitable for systems-level control, and 5) generalizable results demonstrating the suitability of each method for prediction over a multi-step future horizon to other complex dynamic systems.

42 ENGINEERING↗