Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Global optimization”

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 55 records · Page 3

Introduction to and comparison of deep learning and optimization approaches to analytical wake modeling of a tilted wind turbine

This paper introduces innovative optimization and deep learning techniques to enhance the prediction of complex wake dynamics in the downstream wind velocity of tilted wind turbines. Traditional methods for calibrating the Bastankhah wake model often lead to increased errors in wind velocity distribution due to overfitting of the local wake characteristics. To address this issue, we propose an additional global optimization step to reduce errors in wind velocity predictions with respect to various wake parameters. Despite this improvement, the Bastankhah model's axisymmetric Gaussian wake shape limits its accuracy for complex wake structures. Therefore, we also propose a deep learning approach, which demonstrates promising results by accurately modeling complex wake shapes across a broader range of tilt angles with minimal computational cost. The deep learning approach achieves near-identical predictions to high-fidelity large-eddy simulations, representing a promising advancement in wake modeling.

17 WIND ENERGY↗

Optimal Traffic Signal Control Using Priority Metric Based on Real-Time Measured Traffic Information

Optimizing traffic control systems at traffic intersections can reduce network-wide fuel consumption as well as improve traffic flow. While traffic signals have conventionally been controlled based on predetermined schedules, various adaptive control systems have been developed recently using advanced sensors such as cameras, radars, and LiDARs. By utilizing rich traffic information enabled by the advanced sensors, more efficient or optimal traffic signal control is possible in response to varying traffic conditions. This paper proposes an optimal traffic signal control method to minimize network-wide fuel consumption utilizing real-time traffic information provided by advanced sensors. This new method employs a priority metric calculated by a weighted sum of various factors, including the total number of vehicles, total vehicle speed, vehicle waiting time, and road preference. Genetic Algorithm (GA) is used as a global optimization method to determine the optimal weights in the priority metric. In order to evaluate the effectiveness of the proposed method, a traffic simulation model is developed in a high-fidelity traffic simulation environment called SUMO, based on a real-world traffic network. The traffic flow within this model is simulated using actual measured traffic data from the traffic network, enabling a comprehensive assessment of the novel optimal traffic signal control method in realistic conditions. The simulation results show that the proposed priority metric-based real-time traffic signal control algorithm can significantly reduce network-wide fuel consumption compared to the conventional fixed-time control and coordinated actuated control methods that are currently used in the modeled network. Additionally, incorporating truck priority in the priority metric leads to further improvements in fuel consumption reduction.

47 OTHER INSTRUMENTATION↗

Optimal economic dispatch policy for prosumer with energy storage considering self-consumption demand

This paper analyzed the effects of self-consumption demand on the joint economic dispatch of prosumers (energy consumers who are also producers), particularly for prosumers with both energy storage and distributed energy sources (DERs). Studies in the existing literature on the economic dispatch scheduling policy of energy storage, mostly from the perspective of electricity merchants, do not address the impacts of self-consumption demand. However, due to the intermittent and high levels of uncertainty regarding DERs generation and the dynamic demand of the prosumer, production and consumption are not always simultaneous; there are two possible scenarios in each period depending on whether DERs generation can meet prosumers' self-consumption or not. Incorporating the self-consumption demand will pose modeling challenges since these two scenarios cannot occur simultaneously in each period, and different scenarios require different decisions for prosumers. Further, this paper analyzed the two scenarios separately to find the optimal storage scheduling strategy, and the results were combined to get the optimal global solution. We focused on prosumers' economic decision-making while considering self-consumption demand and the physical constraints of a battery based on dynamic programming. Our study showed that the feasible state of charge (SOC) range of storage can be segmented into several sub-ranges by SOC reference points under the above two scenarios. As a result, a prosumer's optimal scheduling can be uniquely and conveniently selected based on the sub-ranges within which the current SOC falls. The results, therefore, provided multistage decision-making guidance for prosumers with energy storage.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Surrogate modeling and optimization of the leaching process in a rare earth elements recovery plant

Critical minerals (CMs) and Rare Earth Elements (REEs) play a vital role in crucial infrastructure technologies such as renewable energy generation and batteries. Recovering them from waste materials has recently been found to significantly reduce environmental impact and supply chain costs related to these materials. In this work, we investigate surrogate modeling techniques aimed to simplify the modeling, simulation, and optimization of the leaching processes involved in CM and REE recovery flowsheets. As there is currently a lack of systematic studies on this topic, we perform extensive computational testing to ascertain which surrogate models are easier to construct and offer high predictive accuracy. Further, our results suggest that sparse quadratic models balance predictive accuracy and computational efficiency. Training and using these surrogates for global optimization of the leaching process requires two orders of magnitude fewer measurements and is up to four orders of magnitude faster than optimizing the original simulation using equation-oriented optimization or derivative-free optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable deep learning for watershed model calibration

Watershed models such as the Soil and Water Assessment Tool (SWAT) consist of high-dimensional physical and empirical parameters. These parameters often need to be estimated/calibrated through inverse modeling to produce reliable predictions on hydrological fluxes and states. Existing parameter estimation methods can be time consuming, inefficient, and computationally expensive for high-dimensional problems. In this paper, we present an accurate and robust method to calibrate the SWAT model (i.e., 20 parameters) using scalable deep learning (DL). We developed inverse models based on convolutional neural networks (CNN) to assimilate observed streamflow data and estimate the SWAT model parameters. Scalable hyperparameter tuning is performed using high-performance computing resources to identify the top 50 optimal neural network architectures. We used ensemble SWAT simulations to train, validate, and test the CNN models. We estimated the parameters of the SWAT model using observed streamflow data and assessed the impact of measurement errors on SWAT model calibration. We tested and validated the proposed scalable DL methodology on the American River Watershed, located in the Pacific Northwest-based Yakima River basin. Our results show that the CNN-based calibration is better than two popular parameter estimation methods (i.e., the generalized likelihood uncertainty estimation [GLUE] and the dynamically dimensioned search [DDS], which is a global optimization algorithm). For the set of parameters that are sensitive to the observations, our proposed method yields narrower ranges than the GLUE method but broader ranges than values produced using the DDS method within the sampling range even under high relative observational errors. The SWAT model calibration performance using the CNNs, GLUE, and DDS methods are compared using R 2 and a set of efficiency metrics, including Nash-Sutcliffe, logarithmic Nash-Sutcliffe, Kling-Gupta, modified Kling-Gupta, and non-parametric Kling-Gupta scores, computed on the observed and simulated watershed responses. The best CNN-based calibrated set has scores of 0.71, 0.75, 0.85, 0.85, 0.86, and 0.91. The best DDS-based calibrated set has scores of 0.62, 0.69, 0.8, 0.77, 0.79, and 0.82. The best GLUE-based calibrated set has scores of 0.56, 0.58, 0.71, 0.7, 0.71, and 0.8. The scores above show that the CNN-based calibration leads to more accurate low and high streamflow predictions than the GLUE and DDS sets. Our research demonstrates that the proposed method has high potential to improve our current practice in calibrating large-scale integrated hydrologic models.

54 ENVIRONMENTAL SCIENCES↗

Decomposition and Algorithmic Approaches for Solving Large-Scale Process Family Design Problems

Our most recent work expands the water desalination case study from 76 variants to 10,897 variants using the equation-oriented model built in Pyomo as part of the PARETO project. Using the discretization formulation presented in Stinchfield (2024a), rather than solving for all 10,897 variants simultaneously, we decompose the formulation into subproblems containing subsets of variants from the process family. We solve the overall problem with Progressive Hedging (PH) deployed in parallel on a distributed HPC cluster using the open-source Python package mpi-sppy (Knueven et al., 2023). This approach allowed us to solve this process family design problem to ~1.5% relative optimality gap in about 5 hours; in comparison, Gurobi reached ~50% relative optimality gap in about 6 hours (Stinchfield et al., 2024b). However, this approach still requires discretization of the common unit module design ranges; additionally, PH acts as a heuristic for MILP’s with gap-closing capabilities. Ideally, we would not have to use ML surrogates or discretization to solve this problem, instead solving the process family design problem with the equation-oriented model directly to achieve the most accurate results. However, recall that we did not consider solving the MINLP directly due to complexity and size. In this work, we aim to decompose and solve this large-scale MINLP using a Structured Nonlinear Global Optimization algorithm presented by Cao and Zavala (2019).

Stinchfield, Georgia↗

Neural architecture search via similarity adaptive guidance

Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.

97 MATHEMATICS AND COMPUTING↗

Multimodal parameter spaces of a complex multi-channel neuron model

One of the most common types of models that helps us to understand neuron behavior is based on the Hodgkin–Huxley ion channel formulation (HH model). A major challenge with inferring parameters in HH models is non-uniqueness: many different sets of ion channel parameter values produce similar outputs for the same input stimulus. Such phenomena result in an objective function that exhibits multiple modes (i.e., multiple local minima). This non-uniqueness of local optimality poses challenges for parameter estimation with many algorithmic optimization techniques. HH models additionally have severe non-linearities resulting in further challenges for inferring parameters in an algorithmic fashion. To address these challenges with a tractable method in high-dimensional parameter spaces, we propose using a particular Markov chain Monte Carlo (MCMC) algorithm, which has the advantage of inferring parameters in a Bayesian framework. The Bayesian approach is designed to be suitable for multimodal solutions to inverse problems. We introduce and demonstrate the method using a three-channel HH model. We then focus on the inference of nine parameters in an eight-channel HH model, which we analyze in detail. We explore how the MCMC algorithm can uncover complex relationships between inferred parameters using five injected current levels. The MCMC method provides as a result a nine-dimensional posterior distribution, which we analyze visually with solution maps or landscapes of the possible parameter sets. The visualized solution maps show new complex structures of the multimodal posteriors, and they allow for selection of locally and globally optimal value sets, and they visually expose parameter sensitivities and regions of higher model robustness. We envision these solution maps as enabling experimentalists to improve the design of future experiments, increase scientific productivity and improve on model structure and ideation when the MCMC algorithm is applied to experimental data.

97 MATHEMATICS AND COMPUTING↗

Influence of counterion substitution on the properties of imidazolium-based ionic liquid clusters

Due to their unique physiochemical properties that may be tailored for specific purposes, ionic liquids (ILs) have been investigated for various applications, including chemical separations, catalysis, energy storage, and space propulsion. The different cations and anions comprising ILs may be selected to optimize a range of desired properties, such as thermal stability, ionic conductivity, and volatility, leading to the designation of certain ILs as designer “green” solvents. The effect of counterions on the properties of ILs is of both fundamental scientific interest and technological importance. Herein, we report a systematic experimental and theoretical investigation of the size, charge, stability toward dissociation, and geometric/electronic structure of 1-ethyl-3-methyl imidazolium (EMIM)-based IL clusters containing two different atomic counterions (i.e., bromide [Br − ] and iodide [I − ]). This work extends our studies of EMIM + cations with atomic chloride (Cl − ) and molecular tetrafluoroborate (BF 4 − ) anions reported previously by Baxter et al. [Chem. Mater. 34, 2612 (2022)] and Zhang et al . [J. Phys. Chem. Lett. 11, 6844 (2020)], respectively. Distributions of anionic IL clusters were generated in the gas phase using electrospray ionization and characterized by high mass resolution mass spectrometry, energy-resolved collision-induced dissociation, and negative ion photoelectron spectroscopy experiments. The experimental results reveal anion-dependent trends in the size distribution, relative abundance, ionic charge state, stability toward dissociation, and electron binding energies of the IL clusters. Complementary global optimization theory provides molecular-level insights into the bonding and electronic structure of a selected subset of clusters, including their low energy structures and electrostatic potential maps, and how these fundamental characteristics are influenced by anion substitution. Collectively, our findings demonstrate how the fundamental properties of ILs, which determine their suitability for many applications, may be tuned by substituting counterions. These observations are critical in the sub-nanometer cluster size regime where phenomena do not scale predictably to the bulk phase, and each atom counts toward determining behavior.

cluster↗

ARPA-E Grid Optimization (GO) Competition Challenge 2

The ARPA-E Grid Optimization (GO) Competition Challenge 2, from 2020 to 2021, expanded upon the problem posed in Challenge 1 by adding adjustable transformer tap ratios, phase shifting transformers, switchable shunts, price-responsive demand, ramp rate constrained generators and loads, and fast-start unit commitment. Furthermore, Challenge 2 was a maximization problem while Challenge 1 was a minimization problem. Specifically, the economic surplus, defined as the benefit of serving load minus the cost of generation, is being maximized. It was expected that the objective value of a given solution should be positive, representing economic gain, but negative objectives from poor solutions were possible. The two code submission feature of Challenge 1 was maintained. Additionally, Divisions 3 and 4 within the competition permitted on/off switching of transmission lines (Divisions 1 and 2 did not). After the initial release of the Problem Formulation on 7/20/2020, ARPA-E Director Lane Genatowski announced Challenge 2 on 9/12/2020. The final May 31, 2021, version of the Problem Formulation was 97 pages long with 299 equations. The Challenge proceeded with 2 non-prize Events and 2 prize Events. Teams receiving Challenge 1 FOA awards and prize money were required to use the prize money to fund their Challenge 2 efforts (Georgia Institute of Technology, Global Optimal Technology, Inc., Lawrence Livermore National Laboratory, Lehigh University, Northwestern University, Artelys, Columbia, Pearl Street Technologies, Pennsylvania State University, and University of Colorado Boulder). For more information on the competition and challenge 2 see the "GO Competition Challenge 2 Information" resource below. Challenge 1 and Challenge 3 information can be found in the resources linked below.

ACOPF↗

Accelerating the Structure Exploration of Diverse Bi–Pt Nanoclusters via Physics‐Informed Machine Learning Potential and Particle Swarm Optimization

Bimetallic Bi–Pt nanoclusters exhibit diverse structural motifs, including core-shell, Janus, and mixed alloy configurations, due to the unique bonding characteristics between Bi and Pt atoms. Using density functional theory refinements from ChIMES physically machine-learned potential and CALYPSO particle swarm optimization global searches, 34 Bi20-Pt20 nanoclusters are systematically classified. The results reveal that Bi atoms predominantly occupy surface sites, driven by charge transfer effects. Cohesive energy trends alone prove insufficient for structure differentiation, necessitating a data-driven approach employing principal component analysis and K-means clustering. Furthermore, vibrational, electronic, and infrared spectral analyses provide additional insights into structure-property relationships. The findings offer an original framework for the automated classification and analysis of bimetallic nanoclusters, enhancing the understanding of their stability and functional properties.

bimetallic nanoparticles↗

Bulk‐Boundary Correspondence of Semimetal Ru 3 Sn 7 and Topological Surface States on Chemically Realistic Terminations

Ru 3 Sn 7 is experimentally demonstrated as an efficient catalyst, with potential utilization of topological surface states for hydrogen evolution reaction. Despite its promising catalytic performance, the topological nature of Ru 3 Sn 7 remains uncertain. Particularly, the bulk-boundary correspondence has not yet been established, hence hindering a rigorous justification of its topologically-protected surface states. In this work, the bulk topology of Ru 3 Sn 7 is detailed using first-principles calculations and the topological quantum chemistry formalism. Ru3Sn7 turns out to be an enforced semimetal possessing symmetry-protected crossings within a set of bands near the Fermi level, which are enforced and prescribed by the violations of symmetry-prescribed compatibility relations. Moreover, the surface states and the associated origin from the same set of entangled bands are identified, thereby establishing the bulk-boundary correspondence. To evaluate the effects of chemical modifications, the response of topological surface states to various surface terminations, stoichiometry, and oxidation is examined. The surface structures are globally optimized, and the phase diagrams for various experimental conditions are built. It is shown that, due to changes in the local chemical environment, the original surface states are significantly altered. Modified surface bands can be observed near the Fermi level on surface terminations that preserve the C 4v symmetry.

36 MATERIALS SCIENCE↗

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

Revisiting point defect thermodynamics in group IVB and VB transition metal carbides

We present a comprehensive re-examination of point defect thermodynamics in group IVB and VB transition metal carbides (TMCs) with the rocksalt structure using a combination of density functional theory (DFT) calculations and a statistical mechanical Wagner-Schottky model within the canonical ensemble. The most stable configurations of point defects were discovered using basin-hopping global optimization, driven by either a machine learning interatomic potential (MLIP) or DFT. A key finding is the identification of previously unreported dicarbon antisites—a C–C dimer occupying a metal site—as the structural (constitutional) defects on the carbon-rich side of stoichiometry in all group IVB and VB TMCs except TaC. Furthermore, dicarbon antisite-containing thermal defect complexes, such as quadruple and interbranch defects, can dominate in TMCs under specific stoichiometric and temperature conditions. In conclusion, by incorporating dicarbon antisites into the defect landscape, this work provides a revised understanding of the thermodynamics of point defects in TMCs.

Carbides↗

Hyperplane decision trees as piecewise linear surrogate models for chemical process design

Recent trends in chemical engineering research point towards an increasing reliance on data-driven modeling approaches. Neural networks, for instance, have proven to be accurate when data is plentiful and high-dimensional, but in many cases, they require computationally-intensive training procedures. Here, in this work, we describe hyperplane decision trees (HT) as a highly expressive and low-compute machine learning model architecture. These models are locally linear and have linear decision boundaries, resulting in a piecewise linear model of the data. This property allows them to be converted into mixed-integer linear constraints which can be globally optimized. Our open-source PyTorch implementation of this method is a fast, flexible, and accessible way to build accurate piecewise linear models of data.

Decision trees↗

Protonation Dynamics of Confined Ethanol–Water Mixtures in H-ZSM-5 from Machine Learning-Driven Metadynamics

Zeolites are indispensable heterogeneous catalysts in industrial chemical processes, valued for their strong Brønsted acidity, well-defined microporous frameworks, and tunable pore structures. Their catalytic activity arises primarily from Brønsted acid sites (BAS), typically present as bridging hydroxyl groups (Si–OH–Al). Under aqueous reaction conditions, these protons interact dynamically with water and alcohol molecules, leading to complex solvation and protonation behavior within confined pores. In this study, we investigate the protonation equilibrium occurring between ethanol and water at the BAS of acidic zeolites under varying hydration levels, i.e., C2H5OH–(H2O)n, n=1–4. Local structure was analyzed through an adaptive-learning global optimization algorithm, while enhanced sampling molecular dynamics simulations with Well-Tempered Metadynamics (WMetaD) and machine learning interatomic potentials (MLPs) provide free-energy surfaces (FES) at variable hydration levels. The results reveal a strong dependence of proton localization on the degree of hydration. At low hydration (1 water molecule), the proton resides predominantly on ethanol; with 2 water molecules, it shifts toward water, and at higher hydration (3 or more water molecules), it becomes extensively delocalized over the water cluster. These findings underscore the critical role of solvation in modulating acid site behavior and suggest that a minimum of three water molecules is necessary to fully stabilize the proton on water within the zeolite framework. This solvation threshold has significant implications for catalytic processes, particularly in biomass conversion reactions where alcohol protonation is a key step in dehydration mechanisms.

machine learning↗

Mechanism of Stoichiometrically Governed Titanium Oxide Brownian Tree Formation on Stepped Au(111)

Previously observed formation of substoichiometric titanium oxide dendritic structures across terraces of Au(111) is computationally studied and shown to follow the classical fractal formation mechanism of diffusion-limited aggregation (DLA). Globally optimized gas-phase oxide cluster structures are sampled in a variety of landing formations on gold surfaces and shown to favor isomers driving polymerization to Brownian tree fractal structures. Mobility of Ti 3 O 5 monomers is shown to be extremely high, with diffusion barriers of 0.21 eV or less. Through bonding stabilization, polymerization of these monomers is energetically favorable and irreversible on the 111 terrace but geometrically impossible to propagate along the step edge. Simulated scanning tunneling microscopy (STM) images show strong similarity to experiment. By contrast, observation of Ti 3 O 6 aggregating as wires along step edges is explained by the affinity of oxygen to step edges and statistical arguments for aggregation entropy at the step, in addition to low barriers for monomer diffusion and polymerization.

36 MATERIALS SCIENCE↗

CO (2) Electroreduction on Borated Copper Surfaces: Boron Active Sites, Not Copper

Boron-doped copper has recently emerged as an active and stable catalyst for the electrochemical reduction of CO 2 to value-added C 2 products. Here, in this work, we develop a realistic model of CO electroreduction on surface borides of copper under operational conditions, taking into account the effects of electrode potential, electrolyte environment, and pH. We study the possible reconstruction of the electrocatalyst surface using grand canonical DFT and global optimization to obtain a potential-dependent grand canonical ensemble description of metastable, hydrogen-covered catalyst surfaces. Two key surface configurations, low H coverage (LC, −0.6 V SHE ) and high H coverage (HC, −0.8 V SHE ), dominate this ensemble, with the former being kinetically persistent and C 2 selective under strongly reducing conditions. Nonmetallic boron sites on the surface copper boride are found to bind CO more strongly than copper sites, and mechanistic investigation of CO electroreduction pathways presents a surprisingly unconventional case of boron-centered reactivity in contrast to typical copper-centered reactivity. Neighboring boron sites present along boron chains on the surface copper boride are found to facilitate C−C coupling, thereby driving the high C 2 selectivity of this electrocatalyst.

boron-doped copper↗