Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “evolutionary 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Parallel general purpose multiobjective optimization framework with application to electron beam dynamics

Particle accelerators are invaluable tools for research in the basic and applied sciences, such as materials science, chemistry, the biosciences, particle physics, nuclear physics and medicine. The design, commissioning, and operation of accelerator facilities is a nontrivial task, due to the large number of control parameters and the complex interplay of several conflicting design goals. The Argonne Wakefield Accelerator facility has some unique challenges resulting from its purpose to carry out advanced accelerator R&D. Individual experiments often have challenging beam requirements, and the physical configuration of the beam lines is often changed to accommodate the variety of supported experiments. The need for rapid deployment of different operational settings further complicates the optimization work that must be done for multiple constraints and challenging operational regimes. One example of this is an independently staged two-beam acceleration experiment which requires the construction of an additional beam line (this is now in progress). The high charge drive beam, well into the space charge regime, must be threaded through small aperture (17.6 mm) decelerating structures. In addition, the bunch length must be sufficiently short to maximize power generation in the decelerator. We propose to tackle this problem by means of multiobjective optimization algorithms which also facilitate a parallel deployment. In order to compute solutions in a meaningful time frame, a fast and scalable software framework is required. In this paper, we present a general-purpose framework for simulation-based multiobjective optimization methods that allows the automatic investigation of optimal sets of machine parameters. Using evolutionary algorithms as the optimizer and opal as the forward solver, validation experiments and results of multiobjective optimization problems in the domain of beam dynamics are presented. Optimized solutions for the new high charge drive beam line found by the framework were used to finish the design of a two beam acceleration experiment. The selected solution along with the associated beam parameters is presented.

43 PARTICLE ACCELERATORS↗
DOE OSTI2019

Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.

Probst, Daniel M.↗
DOE OSTI2021

Benchmarking the Performance of Neuromorphic and Spiking Neural Network Simulators

Software simulators play a critical role in the development of new algorithms and system architectures in any field of engineering. Neuromorphic computing, which has shown potential in building brain-inspired energy-efficient hardware, suffers a slow-down in the development cycle due to a lack of flexible and easy-to-use simulators of either neuromorphic hardware itself or of spiking neural networks (SNNs), the type of neural network computation executed on most neuromorphic systems. While there are several openly available neuromorphic or SNN simulation packages developed by a variety of research groups, they have mostly targeted computational neuroscience simulations, and only a few have targeted small-scale machine learning tasks with SNNs. Evaluations or comparisons of these simulators have often targeted computational neuroscience-style workloads. In this work, we seek to evaluate the performance of several publicly available SNN simulators with respect to non-computational neuroscience workloads, in terms of speed, flexibility, and scalability. We evaluate the performance of the NEST, Brian2, Brian2GeNN, BindsNET and Nengo packages under a common front-end neuromorphic framework. Our evaluation tasks include a variety of different network architectures and workload types to mimic the computation common in different algorithms, including feed-forward network inference, genetic algorithms, and reservoir computing. We also study the scalability of each of these simulators when running on different computing hardware, from single core CPU workstations to multi-node supercomputers. Our results show that the BindsNET simulator has the best speed and scalability for most of the SNN workloads (sparse, dense, and layered SNN architectures) on a single core CPU. However, when comparing the simulators leveraging the GPU capabilities, Brian2GeNN outperforms the others for these workloads in terms of scalability. NEST performs the best for small sparse networks and is also the most flexible simulator in terms of reconfiguration capability NEST shows a speedup of at least 2x compared to the other packages when running evolutionary algorithms for SNNs. The multi-node and multi-thread capabilities of NEST show at least 2x speedup compared to the rest of the simulators (single core CPU or GPU based simulators) for large and sparse networks. We conclude our work by providing a set of recommendations on the suitability of employing these simulators for different tasks and scales of operations. We also present the characteristics for a future generic ideal SNN simulator for different neuromorphic computing workloads.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Sequence-defined Pareto frontier of a copolymer structure

The correlations between the sequence of monomers in a macromolecule and its three-dimensional (3D) structure is a grand challenge in polymer science. The properties and functions of macromolecules depend on their 3D shape that has appeared to be dictated by their monomer sequence. However, the progress towards understanding the sequence–structure-property correlations and their utilization in materials engineering are slow because it is almost impossible to characterize an astronomically large number of possible sequences of a copolymer using traditional experimental and simulation methods. To address this problem, here, we combine evolutionary computing and coarse-grained molecular dynamics (CGMD) simulation and study the sequence-structure correlations of a model AB-type copolymer in a solution and assess the impact of sequence on the packing density in its bulk phase. The CGMD-based evolutionary algorithm (EA) screens the sequence space of a single chain copolymer efficiently and identifies a wide range of single-molecule structures including extremal radii of gyration. The data are utilized to estimate the Pareto front of the structure-space of a binary copolymer as a function of its composition. The monomer packings in single-molecule solution phase and multimolecular bulk phase are found to be identical. Finally, this work highlights the opportunities of sequence-specific control of macromolecular structure for designing target materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Toward Consistent High-Fidelity Quantum Learning on Unstable Devices via Efficient In-Situ Calibration

In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. What's worse, recent works reveal that the noise on quantum devices is not stable, that is, the noise is dynamically changing over time. This leads to an imminent challenging problem: At run-time, is there a way to efficiently achieve a consistent high-fidelity quantum system on unstable devices? To study this problem, we take quantum learning (a.k.a., variational quantum algorithm) as a vehicle, which has a wide range of applications, such as combinatorial optimization and machine learning. A straightforward approach is to optimize a variational quantum circuit (VQC) with a parameter-shift approach on the target quantum device before using it; however, the optimization has an extremely high time cost, which is not practical at run-time. To address the pressing issue, in this paper, we proposed a novel quantum pulse-based noise adaptation framework, namely QuPAD. In the proposed framework, first, we identify that the CNOT gate is the fidelity bottleneck of the conventional VQC, and we employ a more robust parameterized multi-qubit gate (i.e., Rzx gate) to replace CNOT gate. Second, by benchmarking Rzx gate with different parameters, we build a fitting function for each coupling qubit pair, such that the deviation between the theoretic output of Rzx gate and its on-device output under a given pulse amplitude and duration can be efficiently predicted. On top of this, an evolutionary algorithm is devised to identify the pulse amplitude and duration of each Rzx gate (i.e., calibration) and find the quantum circuits with high fidelity. Experiments show that the runtime on quantum devices of QuPAD with 8–10 qubits is less than 15 minutes, which is up to 270 x faster than the parameter-shift approach. In addition, compared to the vanilla VQC as a baseline, QuPAD can achieve 59.33% accuracy gain on a classification task, and average 66.34% closer to ground state energy for molecular simulation.

Hu, Zhirui↗
DOE OSTI2023

Evolutionary Architecture Search for Generative Adversarial Networks Based on Weight Sharing

Generative adversarial networks (GANs) are a powerful generative technique but frequently face challenges with training stability. Network architecture plays a significant role in determining the final output of GANs, but designing a fine architecture demands extensive domain expertise. This article aims to address this issue by searching for high-performance generator’s architectures through neural architecture search (NAS). The proposed approach, called evolutionary weight sharing GANs (EWSGAN), is based on weight sharing and comprises two steps. First, a supernet of the generator is trained using weight sharing. Second, a multiobjective evolutionary algorithm (MOEA) is employed to identify optimal subnets from the supernet. These subnets inherit weights directly from the supernet for fitness assessment. Two strategies are used to stabilize the training of the generator supernet: 1) a fair single-path sampling strategy and 2) a discarding strategy. Experimental results indicate that the architecture searched by our method achieved a new state-of-the-art among NAS–GAN methods with a Fréchet inception distance (FID) of 9.09 and an inception score (IS) of 8.99 on the CIFAR-10 dataset. Finally, it also demonstrates competitive performance on the STL-10 dataset, achieving FID of 21.89 and IS of 10.51.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Distributed Sensor Coordination for Advanced Energy Systems

Motivation: The ability to collect key system level information is critical to the safe, efficient and reliable operation of advanced power systems. Recent advances in sensor technology have enabled some level of decision making directly at the sensor level. However, coordinating large numbers of sensors, particularly heterogeneous sensors, to achieve system level objectives such as predicting plant efficiency, reducing downtime or predicting outages requires sophisticated coordination algorithms. Indeed, a critical issue in such systems is how to ensure the interaction of a large number of heterogenous system components do not interfere with one another and lead to undesirable behavior. Objectives and Contributions: The long-term objective of this work is to provide sensor deployment, coordination and networking algorithms for large numbers of sensors to ensure the safe, reliable, and robust operation of advanced energy systems. Our two specific objectives are to: 1. Derive sensor performance metrics for heterogeneous sensor networks. 2. Demonstrate effectiveness, scalability and reconfigurability of heterogeneous sensor network in advanced power systems. The key technical contribution of this work is to push the coordination step to the design of the objective functions of the sensors, allowing networks of heterogeneous sensors to be controlled. By ensuring that the control and coordination is not specific to particular sensor hardware, this approach enables the design and operation of large heterogeneous sensor networks. In addition to the coordination coordination mechanism, this approach allows the system to be reconfigured in response to changing needs (e.g., sudden external events requiring new responses) or changing sensor network characteristics (e.g., sudden changes to plant condition). Impact: The impact of this work extends to a large class of problems relevant to the National Energy Technology Laboratory including sensor placement, heterogeneous sensor coordination, and sensor network control in advanced power systems. Each application has specific needs, but they all share the one crucial underlying problem: how to ensure that the interactions of a large number of heterogenous agents lead to coordinated system behavior. This proposal describes a new paradigm that addresses that very issue in a systematic way. Key Results and Findings: All milestones have been completed. Our results demonstrate that by properly shaping agent objective functions, we can develop large (up to 10,000 devices) heterogeneous sensor networks with key desirable properties. The first milestone shows that properly choosing agent-specific objective functions increases system performance by up to 99.9% compared to global evaluations. The second milestone shows evolutionary algorithms learn excellent sensor network coordination policies prior to network deployment, and these policies can be refined online once the network is deployed. The third milestone shows the resulting sensor networks networks are extremely robust to sensor noise, where networks with up to 25% sensor noise are capable of providing measurements with errors on the order of 10 -3 . The fourth milestone shows the resulting sensor networks are extremely robust to sensor failure, with 25% of the sensors in the system failing resulting in no significant performance losses after system reconfiguration.

42 ENGINEERING↗
DOE OSTI2017

DDT Polymorphism and the Lethality of Crystal Forms

Abstract DDT (1,1,1‐trichloro‐2,2‐bis(4‐chlorophenyl)ethane), a contact insecticide with a rich and controversial history since its activity was discovered in 1939, has long been thought to be monomorphic. Herein we report the discovery and characterization of a second polymorph, designated Form II, which can be isolated as single crystals, but converts very slowly at room temperature to the form reported previously, now designated as Form I. Computations based on an evolutionary algorithm for crystal structure prediction revealed that Forms I and II are among the four lowest energy crystal structures of fifty calculated. A preliminary study of the contact insecticidal activity toward fruit flies (Drosophila melanogaster) indicates that Form II is more active, suggesting opportunities for more effective solid‐state formulations that would allow reduced amounts of DDT, thereby minimizing environmental impact.

Yang, Jingxiang↗
DOE OSTI2017

DDT Polymorphism and the Lethality of Crystal Forms

DDT (1,1,1-trichloro-2,2-bis(4-chlorophenyl)ethane), a contact insecticide with a rich and controversial history since its activity was discovered in 1939, has long been thought to be monomorphic. Herein we report the discovery and characterization of a second polymorph, designated Form II, which can be isolated as single crystals, but converts very slowly at room temperature to the form reported previously, now designated as Form I. Computations based on an evolutionary algorithm for crystal structure prediction revealed that Forms I and II are among the four lowest energy crystal structures of fifty calculated. In this work, a preliminary study of the contact insecticidal activity toward fruit flies (Drosophila melanogaster) indicates that Form II is more active, suggesting opportunities for more effective solid-state formulations that would allow reduced amounts of DDT, thereby minimizing environmental impact.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

A GPU‐Accelerated Generative Adversarial Model for Causal Inference

We develop a GPU-accelerated machine learning generative adversarial model designed to facilitate causal inferences from observational data. Our model's theoretical framework is conceptualized in a manner that is amenable to being operable and scalable for high-performance computing platforms. We leverage GPU acceleration to develop a parallel evolutionary algorithm to achieve large-scale parallel computation of the model within a now widely accessible computing platform. This capability both enhances computational speedup and efficiency and also extends the use of the model to a broader range of substantive research domains while maintaining the underlying theoretical properties of the model.

GPU↗
DOE OSTI2018

Semi-automatic Methods for Airway and Adjacent Vessel Measurement in Bronchiectasis Patterns in Lung HRCT Images of Cystic Fibrosis Patients

Airway and vessel characterization of bronchiectasis patterns in lung high-resolution computed tomography (HRCT) images of cystic fibrosis (CF) patients is very important to compute the score of disease severity. We propose a hybrid and evolutionary optimized threshold and model-based method for characterization of airway and vessel in lung HRCT images of CF patients. First, the initial model of airway and vessel is obtained using the enhanced threshold-based method. Then, the model is fitted to the actual image by optimizing its parameters using particle swarm optimization (PSO) evolutionary algorithm. The experimental results demonstrated the outperformance of the proposed method over its counterpart in R-squared, mean and variance of error, and run time. Moreover, the proposed method outperformed its counterpart for airway inner diameter/vessel diameter (AID/VD) and airway wall thickness/vessel diameter (AWT/VD) biomarkers in R-squared and slope of regression analysis.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2018

Dose–volume histogram evaluation scheme for beam orientations in intensity-modulated radiation therapy

Beam orientations in intensity-modulated radiation therapy (IMRT) is an important, but difficult NP-hard optimization problem. A considerable part of this difficulty is due to the essential prerequisite of defining, appropriately, counter-intuitive criteria for a mathematical plan evaluation that coincides with the clinical judgment of the considered plan. Moreover, the quality of beam directions depends heavily on their intensities. Usually a stochastic selector is utilized for optimizing beam orientations, and the intensities are thus calculated many thousands of times, each time for a different selection of beam directions, resulting in excessive time complexity. Therefore, selecting an appropriate set of beam directions in IMRT is still a time-consuming manual trial-and-error search procedure that depends on intuition and empirical knowledge. To overcome these difficulties, this work utilizes the concept of dose–volume histogram (DVH), which is one of the main recognized quantitative measurement tools used for plan judgment, and presents a DVH evaluation scheme that parallelizes plan evaluation with clinical plan judgment. This scheme is then utilized to optimize the intensities of each individual beam, enabling it to be represented by its DVHs, produced for the different irradiated volumes. Finally, an evolutionary algorithm is employed to search for the best combination of those DVHs reflecting the clinical optimal. The presented methods have been applied to three real clinical examples. In comparison to the standard equally spaced beam plans, improvements were reported in all three cases. In comparison with the greedy algorithm, improvements were reported in those examples requiring more than five beam directions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2025

Multi-objective optimization of sustainable aviation fuel production pathways in the U.S. Corn Belt

As a potential source of low-carbon transportation energy, biofuels offer certain advantages over vehicle electrification (e.g., lower societal vulnerability to grid failures, and improved range of sustainable aviation), but also several challenges, including cost, carbon intensity, and land usage. There are also well-founded concerns that biofuel supply chains could be disrupted if extreme weather events impact feedstock yields. In this paper, we explore the use of multi-objective optimization to identify biofuel production pathways that balance cost, greenhouse gas emissions, and supply vulnerability to extreme weather. We compare the use of three different many-objective evolutionary algorithms and linear programming in optimizing biomass cultivation decisions in the U.S. Corn Belt under weather uncertainty using historical, modeled, and synthetic yield data. We consider four feedstock choices (corn, soy, switchgrass, and algae) with two land types (agricultural and marginal lands) and evaluate decisions using three alternative spatial resolutions (ranging from the USDA agricultural district level to the state level). Results show that feedstock choice is the primary driver of objective performance (i.e., the position and shape of 3D, approximate Pareto frontiers). Spatial diversification is a less effective tool in reducing exposure to weather-caused drops in crop yield.

09 BIOMASS FUELS↗
DOE OSTI2018

Toward First-Principles Design of Organic Nonlinear Optical Materials: Crystal Structure Prediction and Halogen Bonding Impact on Hyperpolarizabilities of 2-Iodo-3-hydroxypyridine

Computational methods can potentially accelerate development of more efficient organic materials for second harmonic generation. Here, we test the method that includes the evolutionary algorithm for predicting crystal structure and prognosis of nonlinear optical properties based on the predicted structure. For this test, we selected 2-iodo-3-hydroxypyridine, which exhibits second harmonic generation intensity comparable to that of urea. We performed global minimization of the lattice energy and found the experimental structure when many-body dispersion correction is added to the density functional theory values. We analyzed geometric preferences of the halogen bonding in predicted virtual polymorphs. We also found linear correlation between the lengths of the iodine–iodine halogen bonds and calculated second order susceptibilities.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Machine-Learning-Based Predictive Modeling of Glass Transition Temperatures: A Case of Polyhydroxyalkanoate Homopolymers and Copolymers

Polyhydroxyalkanoate-based polymers—being ecofriendly, biosynthesizable, and economically viable and possessing a broad range of tunable properties—are currently being actively pursued as promising alternatives for petroleum-based plastics. The vast chemical complexity accessible within this class of polymers gives rise to challenges in the rational discovery of novel polymer chemistries for specific applications. Here, the burgeoning field of polymer informatics addresses this challenge via providing tools and strategies for accelerated property prediction and materials design via surrogate machine-learning models built on reliable past data. In this contribution, we use glass transition temperature T g as an example target property to demonstrate promise of the data-enabled route to accelerated learning of accurate structure–property mappings in PHA-based polymers. Our analysis uses a data set of experimentally measured T g values, polymer molecular weights, and a polydispersity index for PHA-based homo- and copolymers that was carefully assembled from the literature. A fingerprinting scheme that captures key properties based on topology, shape, and charge/polarity of specific chemical units or motifs forming the polymer backbone was devised to numerically represent the polymers. A validated statistical learning model is then developed to allow for a mapping of the polymer fingerprints onto the property space in a physically meaningful and reliable manner. Once developed, the model can not only rapidly predict the property of new PHA polymers but also provide uncertainties underlying the predictions. The model is further combined with an evolutionary-algorithm-based search strategy to efficiently identify multicomponent polymer compositions with a prespecified T g . While the present contribution is focused specifically on T g , the surrogate model development approach put forward here is general and can, in principle, be extended to a range of other properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Unveiling a Novel, Cation-Rich Compound in a High-Pressure Pb–Te Binary System

Because of the common oxidation states of group IV elements (+2 or +4) and group VI elements (–2), 1:1 and 1:2 are two typical stoichiometries found in the IV–VI compounds. Particularly, in the Pb–Te binary system, the 1:1 stoichiometric PbTe is believed to be the only stable compound. Herein, using evolutionary algorithms, density functional theory, a laser-heated diamond anvil cell, and synchrotron X-ray diffraction experiments, we discovered a novel Pb–Te compound with an unexpected stoichiometry of 3:2 above 20 GPa. This tetragonal Pb 3 Te 2 is the one of the very few cation-rich compounds that has ever been discovered in the entire IV–VI binary system. Further analyses based on electron density distribution, electron localization function, and Bader charge have shown that this newly discovered compound has a mixed character of chemical bonding with a decreased ionicity. By further calculating the electron–phonon interaction, Pb 3 Te 2 is predicted to exhibit a superconducting transition at low temperatures. Lastly, the discovery of Pb 3 Te 2 paves the way for further explorations of other novel cation-rich IV–VI group compounds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2013

Pressure-Induced Valence and Structural Changes in YbMn 2 Ge 2 -Inelastic X-ray Spectroscopy and Theoretical Investigations

The pressure-induced valence change of Yb in YbMn 2 Ge 2 has been studied by high pressure inelastic X-ray emission and absorption spectroscopy in the partial fluorescence yield mode up to 30 GPa. The crystal structure of YbMn 2 Ge 2 has been investigated by high pressure powder X-ray diffraction experiments up to 40 GPa. The experimental investigations have been complemented by first principles density functional theoretical calculations using the generalized gradient approximation with an evolutionary algorithm for structural determination. The Yb valence and magnetic structures have been calculated using the self-interaction corrected local spin density approximation. The X-ray emission results indicate a sharp increase of Yb valence from v = 2.42(2) to v = 2.75(3) around 1.35 GPa, and Yb reaches a near trivalent state (v = 2.95(3)) around 30 GPa. Further, a new monoclinic P1 type high pressure phase is found above 35 GPa; this structure is characterized by the Mn layer of the ambient (I4/mmm) structure transforming into a double layer. The theoretical calculations yield an effective valence of v = 2.48 at ambient pressure in agreement with experiment, although the pure trivalent state is attained theoretically at significantly higher pressures (above 40 GPa).

Kumar, Ravhi S↗