Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization methods”

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 343 records · Page 19

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗

Language model-accelerated deep symbolic optimization

Symbolic optimization methods have been used to solve varied challenging and relevant problems such as symbolic regression and neural architecture search. However, the current state of the art typically learns each problem from scratch and is unable to leverage pre-existing knowledge and datasets that are available for many applications. Here, inspired by the similarity between sequence representations learned in natural language processing and the formulation of symbolic optimization as a discrete sequence optimization problem, we propose language model-accelerated deep symbolic optimization (LA-DSO), a method that leverages language models to learn symbolic optimization solutions more efficiently. We demonstrate LA-DSO in two tasks: symbolic regression, which allows us to perform extensive experimentation due to its low computation requirements, and computational antibody optimization, which shows that our proposal accelerates learning in challenging real-world problems.

97 MATHEMATICS AND COMPUTING↗

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗

Temporal network alignment via GoT-WAVE

Abstract Motivation Network alignment (NA) finds conserved regions between two networks. NA methods optimize node conservation (NC) and edge conservation. Dynamic graphlet degree vectors are a state-of-the-art dynamic NC measure, used within the fastest and most accurate NA method for temporal networks: DynaWAVE. Here, we use graphlet-orbit transitions (GoTs), a different graphlet-based measure of temporal node similarity, as a new dynamic NC measure within DynaWAVE, resulting in GoT-WAVE. Results On synthetic networks, GoT-WAVE improves DynaWAVE’s accuracy by 30% and speed by 64%. On real networks, when optimizing only dynamic NC, the methods are complementary. Furthermore, only GoT-WAVE supports directed edges. Hence, GoT-WAVE is a promising new temporal NA algorithm, which efficiently optimizes dynamic NC. We provide a user-friendly user interface and source code for GoT-WAVE. Availability and implementation http://www.dcc.fc.up.pt/got-wave/ Supplementary information Supplementary data are available at Bioinformatics online.

Aparício, David↗

A Flexible Transition State Searching Method for Atmospheric Reaction Systems

The precise and rapid exploration of transition states (TSs) is a major challenge when studying atmospheric reactions due to their complexity. In this work, a Monte Carlo Transition State Search Method (MCTSSM), which integrates Monte Carlo sampling technique with transition state optimization methods using an efficient computer script, has been developed for transition state searches. The efficiency and the potential application in atmospheric reactions of this method have been demonstrated by three types of test suits related to the reactions of atmospheric volatile organic compounds (VOCs): (1) OH addition, (2) OH hydrogen-abstraction, and (3) the other reactive group (e.g. Cl, O3, NO3), especially for the reaction of β-pinene-sCI (stabilized Criegee Intermediates) with water. It was shown that the application of this method with effective restricted parameters has greatly simplified the time-consuming and tedious manual search procedure for transition state (TS) of the bimolecular reaction systems.

Aerosol↗

Tracking the topology of neural manifolds across populations

Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising the possibility of studying how these manifolds relate across populations. However, when the manifolds are nonlinear and possibly code for multiple unknown variables, it is challenging to extract robust and falsifiable information about their relationships. We introduce a framework, called the method of analogous cycles, for matching topological features of neural manifolds using only observed dissimilarity matrices within and between neural populations. We demonstrate via analysis of simulations and in vivo experimental data that this method can be used to correctly identify multiple shared circular coordinate systems across both stimuli and inferred neural manifolds. Conversely, the method rejects matching features that are not intrinsic to one of the systems. Further, as this method is deterministic and does not rely on dimensionality reduction or optimization methods, it is amenable to direct mathematical investigation and interpretation in terms of the underlying neural activity. We thus propose the method of analogous cycles as a suitable foundation for a theory of cross-population analysis via neural manifolds.

97 MATHEMATICS AND COMPUTING↗

GO Competition Challenge 1 Benchmark Approach and Validation Support

At the outset ARPA-e’s grid optimization competition sought to test a hypothesis that modern nonlinear optimization methods had reached a level of performance and reliability necessary to optimize energy grids using nonlinear power flow equations. The results demonstrated by this project and the other participants in the grid optimization competition have demonstrated beyond any shadow of doubt that this hypothesis is true. This result suggest that the mathematical optimization technology now exists to produce a revolution in power grid optimization software, which would improve the efficiency of energy grid operations to the broad benefit of society.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Dynamic Amplitude-Correcting Gradient Estimation Technique to Align X-ray Focusing Optics

High-brightness X-rays, as produced at synchrotrons and X-ray free electron laser (XFEL) facilities, are used to characterize materials in a variety of scientific experiments. In most cases, effective use of the high-energy light requires precisely-aligned focusing optics; one example being a compound refractive lens (CRL). To align a CRL, the position and rotation must be optimized along four axes. In practice, this is a labor-intensive, time-consuming manual process that can monopolize scarce experimental time at the necessary X-ray facilities. Models of the expected Xray transmission function suggest that this task can be automated; however, the temporally-varying intensity at X-ray free electron laser facilities preclude the direct use of standard implementations of optimization solvers such as steepest descent algorithms. In this paper, we propose a novel technique to estimate the gradient of noisy functions with temporally-varying amplitudes. We construct this dynamicamplitude correction by systematically sampling a fixed central location within the standard finite difference stencil, accounting for the observed changes in time, and normalizing the difference quotients against those fluctuations. In addition to a rigorous error analysis of the sampling technique, we demonstrate its efficacy in stochastic descent optimization methods. Further, we demonstrate how this approach may be implemented to optimize X-ray focusing optics at synchrotrons or XFEL facilities

97 MATHEMATICS AND COMPUTING↗

Bayesian Optimization for Reactor Design Optimization

This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Dispatchability Maximization for Co-Optimized Energy and Reserve Dispatch With Explicit Reliability Guarantee

In this paper, we consider dispatchability as the set of all admissible nodal wind power injections that will not cause infeasibility in real-time dispatch (RTD). Our work reveals that the dispatchability of the affine policy based RTD (AF-RTD) is a polytope whose coefficients are linear functions of the generation schedule and the gain matrix of affine policy. Two mathematical formulations of the dispatchability maximized energy and reserve dispatch (DM-ERD) are proposed. The first one maximizes the distance from the forecast to the boundaries of the dispatchability polytope subject to the available production cost or reserve cost. Provided the forecast value and variance of wind power, the generalized Gauss inequality (GGI) is adopted to evaluate the probability of infeasible RTD without the exact probability distribution of wind power. Combining the first formulation and the GGI approach, the second one minimizes the total cost subject to a desired reliability level through dispatchability maximization. Efficient convex optimization based algorithms are developed to solve these two models. Different from the conventional robust optimization method, our model does not rely on the specific uncertainty set of wind generation and directly optimizes the uncertainty accommodation capability of the power system. The proposed method is also compared with the affine policy based robust energy and reserve dispatch (AR-ERD). Case studies on the PJM 5-bus system illustrate the proposed concept and method. Experiments on the IEEE 118-bus system demonstrate the applicability of our method on moderate sized systems and its scalability to large dimensional uncertainty.

17 WIND ENERGY↗

Automating methods for estimating metabolite volatility

The volatility of metabolites can influence their biological roles and inform optimal methods for their detection. Yet, volatility information is not readily available for the large number of described metabolites, limiting the exploration of volatility as a fundamental trait of metabolites. Here, we adapted methods to estimate vapor pressure from the functional group composition of individual molecules (SIMPOL.1) to predict the gas-phase partitioning of compounds in different environments. We implemented these methods in a new open pipeline called volcalc that uses chemoinformatic tools to automate these volatility estimates for all metabolites in an extensive and continuously updated pathway database: the Kyoto Encyclopedia of Genes and Genomes (KEGG) that connects metabolites, organisms, and reactions. We first benchmark the automated pipeline against a manually curated data set and show that the same category of volatility (e.g., nonvolatile, low, moderate, high) is predicted for 93% of compounds. We then demonstrate how volcalc might be used to generate and test hypotheses about the role of volatility in biological systems and organisms. Specifically, we estimate that 3.4 and 26.6% of compounds in KEGG have high volatility depending on the environment (soil vs. clean atmosphere, respectively) and that a core set of volatiles is shared among all domains of life (30%) with the largest proportion of kingdom-specific volatiles identified in bacteria. With volcalc , we lay a foundation for uncovering the role of the volatilome using an approach that is easily integrated with other bioinformatic pipelines and can be continually refined to consider additional dimensions to volatility. The volcalc package is an accessible tool to help design and test hypotheses on volatile metabolites and their unique roles in biological systems.

59 BASIC BIOLOGICAL SCIENCES↗

Gas-Electrical Grid Coordination for Cross Infrastructure Resilience Enhancement

An electric power grid is exceedingly faced with extreme events, such as physical attacks and natural disasters. In comparison, the underground natural gas pipeline-based transportation network is considered less vulnerable to such environmental threats. We consider that the overhead power transmissions can be hardened by replacing segments of electric power system with underground natural gas pipelines as an energy transportation system to counter effect extreme events which can damage interdependent infrastructures severely. This project investigates an extension of the power system planning problem considering extreme events and identifies the feasibility of solving this problem with advanced modeling and optimization methods. The proposed planning framework is formulated as a two-stage optimization problem. It is found that the integrated planning introduces the additional cost of pipeline planning and the operation constraints into the power system planning. However, gas pipelines are generally less exposed to extreme events, which can provide a more resilient power transmission for supplying the electrical loads. It is with this potential for enhancing the power grid resilience that the proposed integrated expansion of electricity and natural gas system is considered an optimal layout for the transportation of energy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Deep Learning Prediction of Protein Complex Structures

Proteins interact to form protein complex to carry out biological functions such as catalytic chemical reaction. Therefore, it is important to develop computational methods to predict protein-protein interaction and the structures of protein complexes to study and enhance protein function. In this project, we successfully developed several deep learning methods to predict inter-protein contacts and the reinforcement learning and optimization methods to reconstruct protein complex structures from predicted inter-chain contacts. The methods were integrated with the MULTICOM protein complex structure prediction system and applied to predict the complex structures of biomass production-related proteins of green algae. During the two and a half years of research and development, all the specific milestones of the project were achieved successfully. 16 publications/manuscripts were produced. 10 software tools were developed. A patent application was submitted. Our MULTICOM predictors leveraging some tools developed in this project were ranked among the top predictors in the 15th Critical Assessment of Techniques for Protein Structure Prediction (CASP15) in 2022.

59 BASIC BIOLOGICAL SCIENCES↗

Employing MACS/ViBRANT as a Surrogate MARVEL Reactor for Startup Reactivity Tuning and Supervisory Control Processes

Advanced nuclear reactors are a key part of the future of nuclear energy both in the United States and globally. They offer unique benefits for various energy-demanding applications, including use in remote locations, compact size, modular manufacturing, remote monitoring, low and/or variable power rating operation, and reliance on novel technologies to enhance operational safety. To achieve economic feasibility, advanced reactors must significantly reduce their workforces in comparison with the current fleet. Achieving this reduction will occur through reducing staff workloads using technology to achieve autonomous or semi-autonomous operations, demonstrated by comprehensive testing and validation activities. These operations will require both software and hardware platforms during the design and testing phases. While simulations are useful during the design phase, their performance can significantly deviate during actual deployment on hardware. This report presents the outcomes of a collaborative technical initiative between the U.S. Department of Energy (DOE) Microreactor Program (MRP) and Advanced Sensors and Instrumentation (ASI) Program. The collaboration utilized the Microreactor Automated Control System (MACS) hardware platform to bridge the gap between theoretical reactor design and actual startup and control operations. Two key use cases were investigated: facilitating the startup testing period and demonstrating supervisory control. The first use case details the key Microreactor Applications Research Validation and Evaluation (MARVEL) reactor startup physics testing activities conducted using the MACS platform. These activities included drum worth measurements, shutdown margin assessment, temperature feedback analysis, and scram time evaluation, as well as unique testing that would apply to the MARVEL reactor to demonstrate the testing methodologies in a low-risk environment. The MACS platform, serving as a surrogate representation of the MARVEL reactor, proved instrumental in performing these tests. The exercise revealed aspects that led to optimized processes, refined hardware design, and enhanced base software capabilities. By maturing methods and technologies in this manner, the initiative promises to reduce wasted time in the actual on-site reactor deployment effort, thereby saving significant time and resources. The second use case focuses on the development and implementation of supervisory control methods aimed at managing core tilt, which can result from asymmetrical operations or manufacturing imperfections in fuel rods or reactivity control devices. A key objective was to assess and compare the use of artificial intelligence (AI) for supervisory control. The effort aimed to define the role of supervisory control to enhance performance without risking control instability. This effort explored three distinct approaches: rules-based (RB) methods, optimization techniques, and reinforcement learning (RL) algorithms. Each approach was evaluated for its ease of implementation, its usability, and its effectiveness in responding to asymmetries in neutron flux. Comparative analysis of these approaches provided valuable insights into their applicability and effectiveness, offering a robust framework for advanced reactor operations. Together, these two use cases highlight the potential of hardware test beds to help streamline the design, operation, and control of advanced nuclear reactors. This collaborative effort underscores the importance of continued innovation and experimentation in achieving the next generation of safe, reliable, and economically viable nuclear energy solutions.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Bridging Equipment Reliability Data and Risk Informed Decisions in a Plant Operation Context

Industry equipment reliability and asset management programs are essential elements that help ensure the safe and economical operation of nuclear power plants. The effectiveness of these programs is addressed in several industry-developed and regulatory programs. The Risk-Informed Asset Management (RIAM) project is tasked to develop tools in support of the equipment reliability and asset management programs at nuclear power plants. These tools are designed to create a direct bridge between component health/lifecycle data and decision making (e.g., maintenance scheduling and project prioritization). The goal of this article is to provide a guide for specific use cases that the RIAM project is targeting. We have grouped uses cases into three main areas. The first area focuses on the analysis of equipment reliability data with a particular emphasis on condition-based data, such as test/surveillance reports and component monitoring data. The second area focuses on the integration of equipment reliability into system/plant reliability models to determine system/plant health and identify the components that are critical to maintain an operational system. Lastly, the third area manages plant resources, such as maintenance activities and replacement scheduling using optimization methods. Here the primary focus is on supporting typical system engineer decisions regarding maintenance activity scheduling and component aging management. This is performed in a risk-informed context where the term “risk” is broadly constructed to include both plant reliability and economics. This framework combines data analytics tools to analyze equipment reliability data with risk-informed methods designed to support system engineer decisions (e.g., maintenance and replacement schedules, optimal maintenance posture) in a customizable workflow.

97 - MATHEMATICS AND COMPUTING↗

Technical Report for Bayesian Optimization and Reinforcement Learning for Beam Polarization Increase in the BNL Hadron Injectors

This project developed and evaluated physics-informed Bayesian learning and machine learning (ML)-based optimization methods for improving beam polarization preservation in the BNL hadron injector chain. The work focused on uncertainty-aware digital twin modeling, Bayesian calibration of accelerator simulations using beam measurements, and data-efficient optimization strategies including Bayesian optimization and reinforcement learning. These methods were applied to injector tuning and RF control problems in realistic accelerator settings to support improved operational robustness and readiness for RHIC operations and future Electron–Ion Collider facilities. No subject inventions were disclosed under this award.

43 PARTICLE ACCELERATORS↗

Comparison of Fuel Loading Pattern Optimization Results using Exhaustive Search for Fresh Fuels and Local Search for Burned Fuels

Fuel loading pattern optimization is a combinatorial optimization problem from the mathematical point of view. However, exhaustive search is impractical because enormous computational cost is necessary due to huge search space. For this reason, various optimization methods have been developed so far, but no methods are able to guarantee to reach the optimum solution. In the present study, search space is divided into subspaces using key parameters that well represent characteristics of a loading pattern and then promising subspaces are extensively searched. In the present method, balance between division of a search space into subspaces and a search method used in a subspace is essential. For example, when the number of division is set to be one, it is equivalent to the exhaustive search thus is impractical. Similarly, when the division to subspaces is too coarse, an optimum (or near optimum) solution cannot be found through local search in each subspace since design space of a subspace is still too large. Contrary, if division to subspaces is too fine, number of subspaces becomes to large thus promising subspaces cannot be found. In the present study, search space is divided focusing on the location of fresh fuel assemblies with gadolinia since it has significant impact on core characteristics. Number of possible loading patterns of gadolinia bearing fresh fuel assemblies is not very large thus exhaustive search is possible. Local fine search is executed by considering location of burned fuels for each loading pattern of gadolinia bearing fresh fuel assembly. If the same solution is obtained by multiple local searches starting from different initial burnt fuel locations (but the same loading patterns for gadolinia bearing fresh fuel assemblies), the obtained solution is highly likely the optimum in the subspace. In more general, the present method is based on the 'divide and conquer' approach, which is familiar in the optimization field. Namely, after division of search space into subspaces and then promising subspace is searched. Once the promising subspace is found, the subspace is further subdivided into subspaces and repeat the above procedures. This method would be efficient when appropriate balance between search space division method and performance of local search is achieved. The previous works utilizes the similar approach. In reference [1], exhaustive search in small region in a core is carried out focusing on loading patterns of gadolinia bearing fresh fuel assemblies. In reference [2], rough exhaustive search based on the 'batch-wise' loading pattern is performed with the assist of the linear programming. By contrast, in the present study, exhaustive search is carried out for loading patterns of gadolinia bearing fresh fuel assemblies. The random Multi-start Local Search (MSLS) with the direct search or the exhaustive binary swap is used to find out optimal solutions in a subspace, which consists of loading patterns having the same arrangement of gadolinia bearing fresh fuel assemblies. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Generalized Stress Inversion Approach With Application to Residual Stress Estimation

In this work develop a generalized stress inversion technique (or the generalized inversion method) capable of recovering stresses in linear elastic bodies subjected to arbitrary cuts. Specifically, given a set of displacement measurements found experimentally from digital image correlation (DIC), we formulate a stress estimation inverse problem as a partial differential equation-constrained optimization problem. We use gradient-based optimization methods, and we accordingly derive the necessary gradient and Hessian information in a matrix-free form to allow for parallel, large-scale operations. By using a combination of finite elements, DIC, and a matrix-free optimization framework, the generalized inversion method can be used on any arbitrary geometry, provided that the DIC camera can view a sufficient part of the surface. We present numerical simulations and experiments, and we demonstrate that the generalized inversion method can be applied to estimate residual stress.

42 ENGINEERING↗