Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution 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 235 records · Page 13

A framework for discrete optimization of stellarator coils

Designing magnets for three-dimensional plasma confinement is a key task for advancing the stellarator as a fusion reactor concept. Stellarator magnets must produce an accurate field while leaving adequate room for other components and being reasonably simple to construct and assemble. In this paper, a framework for coil design and optimization is introduced that enables the attainment of sparse magnet solutions with arbitrary restrictions on where coils may be located. The solution space is formulated as a 'wireframe' consisting of a mesh of interconnected wire segments enclosing the plasma. Two methods are developed for optimizing the current distribution on a wireframe: Regularized Constrained Least Squares, which uses a linear least-squares approach to optimize the currents in each segment, and Greedy Stellarator Coil Optimization, a fully discrete procedure in which loops of current are added to the mesh one by one to achieve the desired magnetic field on the plasma boundary. Examples are presented of solutions obtainable with each method, some of which achieve high field accuracy while obeying spatial constraints that permit easy assembly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ILAW Container Cost Reduction and Optimization Study

This study, performed on behalf of Washington River Protection Solutions (WRPS), examines the potential for making cost savings for the Immobilized Low Active Waste (ILAW) containers over the mission life of the Waste Treatment and Immobilization Plant (WTP). it builds on earlier study assessments 24590-LAW-RPT-M-01-001 Rev 0 ILAW Product Container Specifications Optimization Study and DOE/ORP-2013-02 Rev 0 Decision Analysis of Low-Active Waste Container Finishing Handling System Alternatives. The WTP design and installed equipment has evolved over an extended period ~20 years. Consequently, some of the existing requirements relating the ILAW containers may no longer be applicable under current mission plans where the glass filled containers are placed into the Integrated Disposal Facility (IDF) rather than stacked in an engineered purpose-built ventilated store as originally envisioned. The study team reviewed available WTP project reference documents to establish the functions the container must perform and assign requirements against each of these functions. With the assumptions that some of the existing WTP contract restrictions would not necessarily apply to the subsequent facility operations contract the container requirements were reviewed to identify those which were ‘hard constraints‘, imposed by regulatory requirements. Initially each of these hard constraints were reviewed, evaluated and documented to see if they precluded the use of an alternate less expensive material of construction, carbon steel, to the existing 304 L stainless steel in the current container specification. That review did not generate any fatal flaws for a change in material of construction to carbon steel allowing the study team to examine the impacts of material cost savings, potential changes to the design and requirements and impacts on interfaces of the containers with the existing WTP process equipment from container receipt, transfers, glass filling, cooling and export. In addition, a change in container target fill level was evaluated and qualitative, and quantitative where feasible, impacts to the container fabrication process assessed. Lastly, additional follow on development or testing activities to support the use of carbon steel were assessed and a recommended path forward with a ROM cost and timescale developed.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Innovative use of CaO in combination with amino acid salt to convert CO 2 as CaCO 3 nanoparticles under mild pH and low temperature

The increasing demand for sustainable CO 2 management has driven the development of innovative methods that can convert point source CO 2 into value-added products. In this study, CaO in combination with amino acid salt was used to convert CO 2 into CaCO 3 nanoparticles. Different from the conventional method where CO 2 diffusion presents a major challenge in reacting with CaO to form CaCO 3 , amino acid salt solvent was applied to absorb CO 2 first and then rapidly reacted with CaO to form CaCO 3 nanoparticles (∼50 nm) at a low temperature (e.g., 60 °C). Our experiments showed that at a glycine (Gly)/NaOH ratio of 2:1 or 3:1, the solution pH values during the CO 2 absorption and conversion were about 8–9 at 60 °C, while at a ratio of 1:1, the solution pH values were about 9–11; without Gly, the solution pH values were about 12. Gly-optimized solvent substantially reduced corrosion risk to reactors. In addition, the use of amino acid (i.e., Gly) led to much smaller CaCO 3 particles, distinctly different chemical phases, and fundamentally different chemical reactions. Moreover, in the presence of Gly, the solution pH was completely reversed and the solution was regenerated for cyclic use when CaO was added. The solvent was recyclable and reusable, highlighting the cost-effectiveness and sustainability of this approach. The Gly-modulated CaCO 3 nanoparticles may have significant potential for industrial applications in the biomedicine, construction, plastics, and rubber industries.

36 MATERIALS SCIENCE↗

Optimizing Solar PV Deployment in Manufacturing: A Morphological Matrix and Fuzzy TOPSIS Approach

The growing energy demand of the industrial sector and the need for sustainable solutions highlight the importance of efficient decision making in solar photovoltaic (PV) implementation. Selecting optimal PV configuration is complex due to the interdependent technical, economic, environmental, and social factors involved. This study introduces an integrated decision-making method combining a morphological matrix and fuzzy TOPSIS to systematically select and rank optimal PV system configurations for manufacturing firms. While the morphological matrix exhaustively examines possible design solutions based on sensing, smart, sustainable, and social (S4) attributes, the fuzzy TOPSIS method ranks the alternatives by handling uncertainty in decision making. A case study conducted in a Mexican manufacturing company validates the methodology’s effectiveness. The optimal PV configuration identified comprehensively addresses operational and sustainability criteria, covering all lifecycle stages. This approach demonstrates quantitative superiority and greater robustness compared to existing fuzzy TOPSIS-based methods for solar PV applications. The findings highlight the practical value of data-driven, multi-criteria decision making for industrial solar energy adoption, enhancing project feasibility, cost efficiency, and environmental compliance. Future research will incorporate discrete event simulation (DES) to further refine energy consumption strategies in manufacturing.

Briceño, Citlaly Pérez↗

Mechanisms of Metal Additive-Induced Ordering During SNIPS Membrane Formation

Isoporous membranes can be fabricated by combining self-assembly with nonsolvent induced phase separation (SNIPS) using an amphiphilic block copolymer like polystyrene-b-poly(4-vinylpyridine) (SV). Poly(4-vinylpyridine) (V) is known to complex with metal salts, which are hypothesized to stabilize solution ordering and preserve structure during casting. We explored how the molar ratio of metal additive to the poly(4-vinylpyridine) block affected the final membrane morphology via scanning electron microscopy (SEM). Dynamic light scattering (DLS), small-angle X-ray scattering (SAXS), and in situ grazing-incidence SAXS were used to track changes in solution ordering and chain conformation as a function of the molar ratio of the additive to the V block. Additives induced aggregation, promoted the formation of more compact conformations in solution, and facilitated micelle ordering onto lattices at optimal ratios. Furthermore, these experimental results were supported by random phase approximation calculations, which helped explain how the thermodynamic order–disorder transition shifts with additive binding strength. Stronger additive–polymer interactions reduced the block copolymer volume fraction required for ordering in solution, allowing ordered domains to form at lower polymer concentrations.

Additives↗

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning models for PDE constrained optimization

Partial differential equation (PDE)-constrained optimization problems arise in a variety of scientific and engineering applications, such as topology optimization, electrodynamics, fluid dynamics, and structural dynamics. However, these problems are often challenging and computationally expensive to solve, due to the need to solve the PDEs within the optimization loop. One approach to reducing the computational cost of these methods while providing convergence guarantees is through inexact trust region methods; this method uses lower fidelity solutions of the PDE at early stages of the optimization and adjusts the required accuracy of inexact PDE solvers as the optimization progresses. In this work, we explore the use of machine learning based surrogate models with these inexact trust region methods. We first demonstrate the potential of this approach by using Gaussian processes as the surrogate model and test this on a simple PDE-constrained optimization problem. We then document explorations into improving the computational costs of evolutional deep neural network / neural Galerkin methods, with the eventual goal of using these methods with the inexact trust region algorithms. We are able to speed up these approaches, albeit at the cost of lower accuracy.

97 MATHEMATICS AND COMPUTING↗

Noise-aware optimization in nominally identical manufacturing and measuring systems for high-throughput parallel workflows

Device-to-device variability in experimental noise critically impacts reproducibility, especially in automated, high-throughput systems like additive manufacturing farms. While manageable in small labs, such variability can escalate into serious risks at larger scales, such as architectural 3D printing, where noise may cause structural or economic failures. This contribution presents a noise-aware decision-making algorithm that quantifies and models device-specific noise profiles to manage variability adaptively. It uses distributional analysis and pairwise divergence metrics with clustering to choose between single-device and robust multi-device Bayesian optimization strategies. Unlike conventional methods that assume homogeneous devices or enforce generic robustness, the proposed framework explicitly determines whether shared optimization across devices is appropriate based on the degree of inter-device noise heterogeneity. This enables improved performance, reproducibility, and efficiency. An experimental case study involving three nominally identical 3D printers (same brand, model, and close serial numbers) demonstrates reduced redundancy, lower resource usage, and improved reliability, along with improved convergence stability and solution quality through the selection of the appropriate optimization strategy based on the degree of inter-device noise heterogeneity. Overall, this framework establishes a general approach for precision- and resource-aware optimization in scalable, automated experimental platforms, demonstrated here on a representative multi-device 3D printing case study.

Schenk, Christina↗

Low-depth Clifford circuits approximately solve MaxCut

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to ∼ 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW. Published by the American Physical Society 2024

Muñoz-Arias, Manuel H. (ORCID:000000025711029X)↗

Demonstration of a 228 Ra/ 228 Ac isotope generator

An isotope generator to produce 228 Ac from 228 Ra was developed using a cation exchange resin column eluted with an acetate-diethylenetriaminpentaacetic acid buffer. Here, the elution behavior of 228 Ac on the column was studied with solutions of various pHs to select the optimal conditions. Two identical isotope generators were eluted for 47 days with over 100 mL of eluant with no detectable 228 Ra breakthrough and high 228 Ac yields (∼95%). The separation requires only biocompatible reagents and is performed at pH 4.6, conditions suitable for radiopharmaceutical studies of Ac.

and nuclear chemistry↗

Data-Driven Kinetic Reaction Networks for Separation Chemistry

Understanding complex, multistep chemical reactions at the molecular level is a major challenge whose solution would greatly benefit the design and optimization of numerous chemical processes. The separation of rare-earth (4f) and actinide (5f) elements is an example where improving our chemical understanding is important for designing and optimizing new chemistries, even with a limited number of observations. Here, in this work, we leverage data-driven artificial intelligence and machine-learning approaches to develop kinetic reaction networks that describe the liquid–liquid extraction mechanism of uranium using N,N-di-2-ethylhexyl-isobutyramide (DEHiBA). Specifically, we compare and contrast the properties of two classes of models: (1) purely data-driven models that are regularized using chemistry-agnostic, L1 regression and (2) chemistry-informed models that are regularized using relative reaction energies provided by quantum mechanical calculations. We observe that purely data-driven models are unbiased, simple, and accurate in their predictions of experimental measurements when provided with sufficient data but are difficult to fully constrain and interpret. In contrast, chemistry-informed models exhibit significantly improved chemical interpretability and consistency, providing a detailed description of the separation process while achieving high accuracy through ensemble averaging. Overall, the dominant species predicted to be extracted into the organic phase is UO 2 (NO 3 ) 2 (DEHiBA) 2 , agreeing with experimental slope analysis, thermodynamic modeling, EXAFS, and crystal structures. This work demonstrates that leveraging the fundamental structure of the problem can lead to efficient learning schemes that provide both accurate predictions and chemical insights at a low computational cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Separation and Recovery of High-Purity Dysprosium from Electric Vehicle Scrap Permanent Magnets Using Cyanex 572, a Cationic Extractant in a Membrane Solvent Extraction Process

Rare earth elements (REEs), especially heavy rare earth elements such as dysprosium (Dy), have gained immense attention globally due to their widespread use in many state-of-the-art technologies. Consequently, demand for REEs is increasing rapidly in comparison to their supply. Recycling of REEs from end-of-life (EoL) electronic waste (e-waste) can help to mitigate the increasing gap between the demand and supply of REEs. This study reports the separation and recovery of high-purity Dy from various feedstocks such as scrap permanent magnets (SPMs), electric vehicle (EV) magnets, and mixed rare earth oxides (REOs) using an economically viable and scalable membrane solvent extraction (MSX) process. First, the optimized conditions (organic phase composition and feed solution acid concentration) for the separation of Dy from light REEs such as neodymium (Nd) and praseodymium (Pr) were evaluated using liquid–liquid extraction. Thereafter, a multistage MSX process was developed to separate high purity (>99.5 wt %) Dy from Nd and Pr using Cyanex 572, a cationic extractant. Using feedstocks with varying initial compositions, the MSX process obtained 100% pure Dy with 63–96% Dy recovery in three to six stages with a maximum extraction rate of 2.9 g m–2 h –1 . Purity of the recovered Dy was confirmed via additional characterization such as scanning electron microscopy, energy dispersive X-ray spectroscopy, and X-ray diffraction. This novel MSX process holds immense potential for industry deployment for the separation of heavy and light rare REEs from a wide range of e-waste.

electrical vehicle magnets↗

Analytical Identification Method of Generalized Short‐Circuit Ratio Using Phasor Measurement Units

This paper introduces a novel analytical approach for the identification of the admittance matrix and the generalized short-circuit ratio (gSCR) in power systems integrated with renewable energy sources. The proposed method leverages voltage and current measurements from phasor measurement units (PMUs) to construct a least squares objective function, which is then solved using matrix calculus and partial derivatives. Unlike conventional optimization algorithms, this approach provides an analytical solution that substantially reduces data requirements, enabling the efficient and accurate identification of the gSCR with smaller datasets. Additionally, its fixed computational complexity allows for real-time updates as new data are collected, ensuring continuous refinement of the system of equations and enabling rapid, precise gSCR calculations. The method also exhibits strong robustness against measurement noise, making it well-suited for practical applications in dynamic power systems. The combination of reduced data requirements, real-time adaptability, noise robustness and fixed computational load establishes this method as a highly efficient and reliable tool for real-time power system stability analysis. Case studies on an EPRI 36-bus system demonstrate the method's effectiveness, highlighting its accuracy in closely matching true gSCR values, even under diverse disturbances and noisy conditions.

Han, Zelei [Hohai University, Nanjing (China)] (OR↗

Efficient frequency allocation for superconducting quantum processors using improved optimization techniques

Building on previous research on frequency allocation optimization for superconducting circuit quantum processors, this work incorporates several techniques to improve overall solution quality. Here, we introduce constraints and imposed edgewise differences help to improve the optimization results. We also introduce optimization variables for the orientation of each edge, defined as the direction from the control qubit to the target qubit, to be chosen during optimization. To scale up to larger processors, multimodule designs are employed with various boundary conditions, thereby enhancing the collective yield. These enhancements allow for greater flexibility in processor design by eliminating the need for handpicked orientations. We support the efficient assembly of large processors with dense connectivity by choosing the best boundary conditions. Examples demonstrate that, at low computational cost, this optimization approach finds a frequency configuration for a square chip with over 1000 qubits and over 10% yield at much larger dispersion levels than required by previous approaches.

Zhang, Zewen [Argonne National Laboratory (ANL), A↗

Neural Networks for Prediction of Complex Chemistry in Water Treatment Process Optimization

Water chemistry plays a critical role in the design and operation of water treatment processes. Detailed chemistry modeling tools use a combination of advanced thermodynamic models and extensive databases to predict phase equilibria and reaction phenomena. The complexity and formulation of these models preclude their direct integration in equation-oriented modeling platforms, making it difficult to use their capabilities for rigorous water treatment process optimization. Neural networks (NN) can provide a pathway for integrating the predictive capability of chemistry software into equation-oriented models and enable optimization of complex water treatment processes across a broad range of conditions and process designs. Herein, we assess how NN architecture and training data impact their accuracy and use in equation-oriented water treatment models. We generate training data using PhreeqC software and determine how data generation and sample size impact the accuracy of trained NNs. The effect of NN architecture on optimization is evaluated by optimizing hypothetical black-box desalination processes using a range of feed compositions from USGS brackish water data set, tracking the number of successful optimizations, and testing the impact of initial guess on the final solution. Our results clearly demonstrate that data generation and architecture impact NN accuracy and viability for use in equation-oriented optimization problems.

Dudchenko, Alexander V↗

Manufacturability-based optical design optimization for advanced Kirkpatrick–Baez X-ray focusing mirrors

The advanced Kirkpatrick–Baez (AKB) mirror setup is an effective and compelling solution to provide stable X-ray nano-focusing for synchrotron radiation or free-electron laser beamlines. We propose an AKB mirror design optimization approach to mitigate the difficulties associated with mirror fabrication by minimizing the total slope ranges of the four curved mirrors while achieving the expected focusing performance. In the optimization, we have considered geometry constraints to ensure the beam acceptance with the required clear aperture, the diffraction-limited focal size with the adequate numerical aperture, and the desired mirror gaps for adjustment and the necessary working distance for the sample stage. Additionally, practical constraints linked to mirror metrology and fabrication, such as mirror length limits and curvature uncertainty in measurement, are taken into account. Furthermore, progressive objective optimization eliminates the need for any initial guess, fully automating the AKB optimization process. This approach facilitates the development of an elegant Wolter-I or Wolter-III type AKB design solution that satisfies these multiple constraints. In cases where constraints cannot be simultaneously satisfied, the optimization results provide valuable insights into areas where trade-offs need to be considered. Simulations with ray tracing and wavefront propagation validate the optimized AKB design showing high tolerance to the beam incident angle.

36 MATERIALS SCIENCE↗

Quantum Computing in Next-Generation Transportation Optimization

We explore how quantum computing (QC) can advance transportation optimization, with a focus on two high-impact areas: traffic signal control and vehicle electrification with grid integration. As transportation systems grow in complexity, classical optimization methods increasingly struggle to deliver scalable and efficient solutions, particularly for real-time, data-rich environments. This work identifies key challenges within these two domains where QC may offer advantages, particularly in handling combinatorial decision spaces and dynamic constraints. We begin by outlining the limitations of classical approaches for traffic signal control optimization and electric vehicle charging coordination, highlighting where computational limitations arise. Previous quantum formulations are presented and new formulations are proposed to demonstrate how emerging quantum algorithms, including quantum annealing and the Quantum Approximation Optimization Algorithm, could be leveraged to reformulate and address these problems. We also evaluate the suitability of current quantum hardware and discuss recent trends that indicate when QC may become a viable tool for transportation applications. While acknowledging the present limitations of QC technologies, this poster emphasizes the importance of preparing quantum-compatible models today. By reviewing and establishing formulations that align with the strengths of quantum algorithms, researchers and practitioners can better position themselves to take advantage of QC advancements as they occur. This work aims to provide a practical, forward-looking perspective on the near-term potential of quantum computing in transportation optimization.

33 ADVANCED PROPULSION SYSTEMS↗

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗