Search NASA⌕ Search

SEARCH · Search NASA

Results for “Simulated annealing”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Parallel simulated annealing with embedded machine learning and multifidelity models for reactor core design

This paper presents extensions to a penalty-free, parallel simulated annealing (SA) algorithm for multi-constrained combinatorial optimization with the aim of embedding multi-fidelity physics models into the annealing procedure. The method uses a low-fidelity, quickly executing model for rapid design space exploration and a high-fidelity model for detailed constraint resolution and on-the-fly bias correction. Machine learning models updated within the annealing procedure were used to bridge the gap between the multi-fidelity models, which led to accurate rapid exploration and efficient detailed constraint resolution. A software implementation of the new multi-fidelity optimization methods, called ML-PSA, was demonstrated on a continuous multi-fidelity optimization problem and a constrained combinatorial PWR lattice design problem. These problems demonstrate some of the features, parallel performance characteristics, and extensible nature of the multi-fidelity SA methods. This paper shows that the developed software and procedure are a general optimization tool that can be applied to a wide variety of scientific and engineering design optimization applications. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Linear stability analysis via simulated annealing and accelerated relaxation

Simulated annealing (SA) is a kind of relaxation method for finding equilibria of Hamiltonian systems. A set of evolution equations is solved with SA, which is derived from the original Hamiltonian system so that the energy of the system changes monotonically while preserving Casimir invariants inherent to noncanonical Hamiltonian systems. The energy extremum reached by SA is an equilibrium. Since SA searches for an energy extremum, it can also be used for stability analysis when initiated from a state where a perturbation is added to an equilibrium. The procedure of the stability analysis is explained, and some examples are shown. Because the time evolution is computationally time consuming, efficient relaxation is necessary for SA to be practically useful. An acceleration method is developed by introducing time dependence in the symmetric kernel used in the double bracket, which is part of the SA formulation described here. An explicit formulation for low-beta reduced magnetohydrodynamics (MHD) in cylindrical geometry is presented. In conclusion, since SA for low-beta reduced MHD has two advection fields that relax, it is important to balance the orders of magnitude of these advection fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Simulated annealing of reduced magnetohydrodynamic systems

Theory of simulated annealing (SA), a method for equilibrium and stability analyses for Hamiltonian systems, is reviewed. The SA explained in this review is based on a double bracket formulation that derives from Hamiltonian structure. In addition to general theoretical aspects, the explicit formulation as well as numerical applications are presented. Both finite and infinite degree-of-freedom systems are treated, in particular, the heavy top, a toy model mimicking low-beta reduced magnetohydrodynamics (MHD) and low- and high-beta reduced MHD. Furthermore, the numerical results successfully demonstrate the usefulness of SA for equilibrium and stability analyses. At the same time, the results raise some future issues that are discussed in the paper.

Poisson Bracket↗
DOE OSTI2022

Transient Storage Model Parameter Optimization Using the Simulated Annealing Method

Hyporheic exchange in streams is critical to ecosystem functions such as nutrient cycling along river corridors, especially for slowly moving or small stream systems. The transient storage model (TSM) has been widely used for modeling of hyporheic exchange. TSM calibration, for hyporheic exchange, is typically used to estimate four parameters, including the mass exchange rate coefficient, the dispersion coefficient, stream cross-sectional area, and hyporheic zone cross-sectional area. Prior studies have raised concerns regarding the non-uniqueness of the inverse problem for the TSM, that is, the occurrence of different parameter vectors resulting in TSM solution that reproduces the observed in-stream tracer break through curve (BTC) with the same error. This leads to practical non-identifiability in determining the unknown parameter vector values even when global-optimal values exist, and the parameter optimization becomes practically non-unique. To address this problem, we applied the simulated annealing method to calibrate the TSM to BTCs, because it is less susceptible to local minima-induced non-identifiability. A hypothetical (or synthetic) tracer test data set with known parameters was developed to demonstrate the capability of the simulated annealing method to find the global minimum parameter vector, and it identified the “hypothetically-true” global minimum parameter vector even with input data that were modified with up to 10% noise without increasing the number of iterations required for convergence. The simulated annealing TSM was then calibrated using two in-stream tracer tests conducted in East Fork Poplar Creek, Tennessee. In conclusion, simulated annealing was determined to be appropriate for quantifying the TSM parameter vector because of its search capability for the global minimum parameter vector.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Qubit Assignment Using Time Reversal

As quantum computers with large numbers of qubits become increasingly available, experiments executed on a given device may not utilize all available qubits. In this case, the outcome of executing a quantum program will depend on the ability to efficiently select a subset of high-performing physical qubits. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while relying on standard device benchmarks provides incomplete information about the performance of any specific program. Furthermore, the number of possible assignments grows combinatorially in the number of qubits on the device and in the program, motivating the use of heuristic optimization techniques. We demonstrate a practical solution to the problem of qubit assignment by using simulated annealing with a cost function based on the Loschmidt echo, a diagnostic that measures the reversibility of a quantum process. We provide theoretical justification for this choice of cost function by demonstrating that the optimal qubit assignment coincides with the optimal qubit assignment based on state fidelity in the weak error limit, and we provide experimental justification using diagnostics performed on Google’s superconducting qubit devices. We then establish the performance of simulated annealing for qubit assignment using classical simulations of noisy devices as well as optimization experiments performed on a quantum processor. Our results demonstrate that the use of Loschmidt echoes and simulated annealing provides a scalable and flexible approach to optimizing qubit assignment on near-term hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Generalized spin σ -SCF method

We introduce a generalization of the σ-SCF method to approximate noncollinear spin ground and excited single-reference electronic states by minimizing the Hamiltonian variance. The new method is based on the σ-SCF method, originally proposed by Ye et al. [J. Chem. Phys. 147, 214104 (2017)], and provides a prescription to determine ground and excited noncollinear spin states on an equal footing. Our implementation was carried out utilizing an initial simulated annealing stage followed by a mean-field iterative self-consistent approach to simplify the cumbersome search introduced by generalizing the spin degrees of freedom. The simulated annealing stage ensures a broad exploration of the Hilbert space spanned by the generalized spin single-reference states with random complex element-wise rotations of the generalized density matrix elements in the simulated annealing stage. The mean-field iterative self-consistent stage employs an effective Fockian derived from the variance, which is utilized to converge tightly to the solutions. This process helps us to easily find complex spin structures, avoiding manipulating the initial guess. As proof-of-concept tests, we present results for Hn (n = 3–7) planar rings and polyhedral clusters with geometrical spin frustration. We show that most of these systems have noncollinear spin excited states that can be interpreted in terms of geometric spin frustration. These states are not directly targeted by energy minimization methods, which are meant to converge to the ground state. This stresses the capability of the σ-SCF methodology to find approximate noncollinear spin structures as mean-field excited states.

Chemistry↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Group structure selection with random forests

Choosing an appropriate group structure for multigroup transport is far from an exact science. For some applications, one blindly uses a group structure developed years ago by forgotten methods. Furthermore, one sometimes uses the same group structure for a variety of problems, even if the group structure was originally developed with a certain application in mind. In this work, we create optimized group structures with simulated annealing for critical assembly test problems and apply a random forest regressor with bagging to choose the best group structure based on parameters of the different test problems. The optimized group structures were generated using a simulated annealing optimizer for several simple, spherical, and unreflected problems. The optimization was performed to minimize a cost function that included fission rate, absorption rate, leakage, and k{sub eff}. A random forest regressor was then trained on a set of International Criticality Safety Benchmark Evaluation Project inputs and used to select one of these six group structures. The trained machine learning model chose the best group structure 65% of the time, and one of the three best 89% of the time. Furthermore, it decreased the L2 error over all test problems by a factor of 25 when compared to the standard Los Alamos 70-group structure. In other words, the model chose group structure that were far more appropriate for the test problems than the traditional LANL group structure. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Optimizing the shape of photometric redshift distributions with clustering cross-correlations

We present an optimization method for the assignment of photometric galaxies to a chosen set of redshift bins. This is achieved by combining simulated annealing, an optimization algorithm inspired by solid-state physics, with an unsupervised machine learning method, a self-organizing map (SOM) of the observed colours of galaxies. Starting with a sample of galaxies that is divided into redshift bins based on a photometric redshift point estimate, the simulated annealing algorithm repeatedly reassigns SOM-selected subsamples of galaxies, which are close in colour, to alternative redshift bins. We optimize the clustering cross-correlation signal between photometric galaxies and a reference sample of galaxies with well-calibrated redshifts. Depending on the effect on the clustering signal, the reassignment is either accepted or rejected. By dynamically increasing the resolution of the SOM, the algorithm eventually converges to a solution that minimizes the number of mismatched galaxies in each tomographic redshift bin and thus improves the compactness of their corresponding redshift distribution. This method is demonstrated on the synthetic Legacy Survey of Space and Time cosmoDC2 catalogue. We find a significant decrease in the fraction of catastrophic outliers in the redshift distribution in all tomographic bins, most notably in the highest redshift bin with a decrease in the outlier fraction from 57 percent to 16 percent.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Charged particle tracking with quantum annealing optimization

Abstract At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for physics analysis will need to be upgraded to scale with track density. Quantum annealing has shown promise in its ability to solve combinatorial optimization problems amidst an ongoing effort to establish evidence of a quantum speedup. As a step towards exploiting such potential speedup, we investigate a track reconstruction approach by adapting the existing geometric Denby-Peterson (Hopfield) network method to the quantum annealing framework for HL-LHC conditions. We develop additional techniques to embed the problem onto existing and near-term quantum annealing hardware. Results using simulated annealing and quantum annealing with the D-Wave 2X system on the TrackML open dataset are presented, demonstrating the successful application of a quantum annealing algorithm to the track reconstruction challenge. We find that combinatorial optimization problems can effectively reconstruct tracks, suggesting possible applications for fast hardware-specific implementations at the HL-LHC while leaving open the possibility of a quantum speedup for tracking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Automated design of an additive manufactured compact broadband antenna for plasma reflectometry

Broadband antennas operating in the gigahertz frequency range are regularly used for plasma reflectometry diagnostics. Due to a lack of space and unique diagnostic constraints, these antennas are often custom in design and frequency range. Recent advances in additive manufacturing of high temperature copper alloys allow for expanded freedom in design of these diagnostic antennas. In this work, a heuristic simulated annealing algorithm is used alongside 3-D finite element simulation to automate the design of a double ridged rectangular horn antenna for a reflectometry diagnostic on the DIII-D tokamak. Optimization of antenna performance given the design constraints results in a compact broadband (6-20+ GHz) antenna design. Measured transmission from the additively manufactured antenna matches simulation within reasonable error, and experimental plasma electron density profiles from the DIII-D high-field side scrape-off layer are shown.

Additive manufacturing↗
DOE OSTI2026

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗
DOE OSTI2021

Distance‐based reconstruction of protein quaternary structures from inter‐chain contacts

Abstract Predicting the quaternary structure of protein complex is an important problem. Inter‐chain residue‐residue contact prediction can provide useful information to guide the ab initio reconstruction of quaternary structures. However, few methods have been developed to build quaternary structures from predicted inter‐chain contacts. Here, we develop the first method based on gradient descent optimization (GD) to build quaternary structures of protein dimers utilizing inter‐chain contacts as distance restraints. We evaluate GD on several datasets of homodimers and heterodimers using true/predicted contacts and monomer structures as input. GD consistently performs better than both simulated annealing and Markov Chain Monte Carlo simulation. Starting from an arbitrarily quaternary structure randomly initialized from the tertiary structures of protein chains and using true inter‐chain contacts as input, GD can reconstruct high‐quality structural models for homodimers and heterodimers with average TM‐score ranging from 0.92 to 0.99 and average interface root mean square distance from 0.72 Å to 1.64 Å. On a dataset of 115 homodimers, using predicted inter‐chain contacts as restraints, the average TM‐score of the structural models built by GD is 0.76. For 46% of the homodimers, high‐quality structural models with TM‐score ≥ 0.9 are reconstructed from predicted contacts. There is a strong correlation between the quality of the reconstructed models and the precision and recall of predicted contacts. Only a moderate precision or recall of inter‐chain contact prediction is needed to build good structural models for most homodimers. Moreover, GD improves the quality of quaternary structures predicted by AlphaFold2 on a Critical Assessment of Techniques for Protein Structure Prediction–Critical Assessments of Predictions of Interactions dataset.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling

A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.

Moltex static salt reactor↗
DOE OSTI2025

A strategy for automated core design to increase economic viability and minimize fuel fragmentation, relocation, and dispersal susceptibility in high-burnup cores

The nuclear industry aims to increase the cycle length of pressurized water reactors from 18 to 24 months to increase power plant capacity factors and economic viability. These cycle length extensions will inherently require fuel rods to exceed the current peak rod average burnup limit of 62 GWd/MTU. A chief concern of operating beyond the current burnup limit is the fuel fragmentation, relocation, and dispersal (FFRD) phenomenon in which pulverized fuel fragments can axially relocate and escape through a burst in the cladding formed during a loss-of-coolant accident. In this work, we demonstrate an approach for automating core design employing an optimization tool based on a penalty-free, parallel simulated annealing algorithm to produce pressurized water reactor core designs with two different optimization objectives. The two objectives were to produce core designs with (1) mitigated FFRD susceptibility while achieving 24-month cycle lengths (2) maximum cycle length with no regard for the likelihood of FFRD. Batch size was considered in tandem with both cases to maximize economic viability. The PARCS nodal model was the primary reactor physics tool used in the optimizations and used nuclear cross sections calculated with 2D Polaris lattice physics models. Reactor performance and safety characteristics of the optimized cores were verified using high-fidelity Virtual Environment for Reactor Applications models. The core designs produced by the optimization tool are compared with each other and to a high-burnup core design produced and analyzed in previous works to highlight the fuel management strategies that may enhance high-burnup reactor safety and economic viability. The optimized cores satisfied their respective objective functions, producing a maximum cycle length of 720 effective full-power days in one core design and one that may reduce FFRD susceptibility by up to 50% based on the first-order approximation to FFRD risk formulated in this work. The optimized cores met most constraints but exceeded the hot channel factor limit, especially in FFRD cases where fresh fuel carried more power. Furthermore, this highlights the need for future lattice-level optimizations and broader assembly options.

Cycle length↗
DOE OSTI2025

Increasing the hardness of posiform planting using random QUBOs for programmable quantum annealer benchmarking

Posiform planting is a method for constructing QUBO instances with a unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random Ising models, whose global minimum is computed classically, with posiform planted QUBOs. The unique ground state of the resulting QUBO is the concatenation of (exactly one of) the ground states of each smaller problem. Our method generates QUBO instances that have a unique solution, are native to the hardware graph, and have tunable computational hardness. We use our QUBOs to benchmark three D-Wave quantum annealing processors (with 563–5627 qubits), and compare them against simulated annealing and Gurobi. Surprisingly, we find that the D-Wave ground state sampling success rate is not dependent on the glued random QUBO size, and that some QUBO classes are solved at high success rates at short annealing times on the Zephyr processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Differences In High Burnup Fuel Management Strategies to Minimize FFRD and Increase Economic Viability

The nuclear industry is pursuing approval of an increase in the length of the pressurized water reactor (PWR) cycle from 18 months to 24 months to reduce reactor downtime and enhance the economic competitiveness of nuclear energy. Such an increase in reactor cycle length will require that the maximum rod average burnup exceeds the current regulatory limit of 62 GWd/MTU, and it could peak at approximately 75 GWd/MTU, posing potential reactor safety and performance concerns. One such concern is that fuel fragmentation, relocation, and dispersal (FFRD) could occur during a severe loss-of coolant accident (LOCA) in which a fuel rod balloons and bursts, and pulverized fuel fragments are dispersed throughout the reactor’s primary coolant system. Previous analyses have identified which reactor operating conditions leave the core more susceptible to FFRD and have shown that FFRD susceptibility is strongly linked to fuel rod burnup and linear heat rate (LHR) history. The work described in this report uses an optimization strategy known as parallel simulated annealing (PSA) and a coarse mesh Purdue Advanced Reactor Core Simulator (PARCS) reactor physics model to develop two core fuel loading patterns, each with a different optimization objective. One core optimization maximized the core’s cycle length while still respecting regulatory limits on the radial peaking factor and soluble boron concentration with a peak rod average burnup of 75 GWd/MTU. The second optimization was aimed at minimizing FFRD susceptibility while still targeting a 24-month cycle length and respecting regulatory limits. PARCS model predictions were verified using the high-fidelity Virtual Environment for Reactor Applications (VERA). The two core designs were compared to highlight core design strategies to minimize FFRD susceptibility and to maximize economic viability.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Studying the Collective Functional Response of a Receptor in Alchemical Ligand Binding Free Energy Simulations with Accelerated Solvation Layer Dynamics

Ligand binding free energy simulations (LB-FES) that involve sampling of protein functional conformations have been longstanding challenges in research on molecular recognition. Particularly, modeling of the conformational transition pathway and design of the heuristic biasing mechanism are severe bottlenecks for the existing enhanced configurational sampling (ECS) methods. Inspired by the key role of hydration in regulating conformational dynamics of macromolecules, this report proposes a novel ECS approach that facilitates binding-associated structural dynamics by accelerated hydration transitions in combination with the lambda-exchange of free energy perturbation (FEP). Further, two challenging protein-ligand binding processes involving large configurational transitions of the receptor are studied, with hydration transitions at binding sites accelerated by Hamiltonian-simulated annealing of the hydration layer. Without the need for pathway analysis or ad hoc barrier flattening potential, LB-FES were performed with FEP/lambda-exchange molecular dynamics simulation at a minor overhead for annealing of the hydration layer. The LB-FES studies showed that the accelerated rehydration significantly enhances the collective conformational transitions of the receptor, and convergence of binding affinity calculations is obtained at a sweet-spot simulation time scale. Alchemical LB-FES with the proposed ECS strategy is free from the effort of trial and error for the setup and realizes efficient on-the-fly sampling for the collective functional response of the receptor and bound water and therefore presents a practical approach to high-throughput screening in drug discovery.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗