Search NASA⌕ Search

SEARCH · Search NASA

Results for “Work 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 163 records · Page 9

Dynamic Boundary Microgrids Under Privatization Considerations

Microgrids have physical, electrical, and logical (data, network, and ownership) boundaries. To power unserved customer loads during an outage, microgrids can extend the traditional operational boundaries. This can become complex when considering microgrid-to-microgrid (M2M) interactions where sensitive information such as competitive microgrid operational data is not shared. This work proposes an optimization method coordinated between microgrid controllers and distribution management systems that limits data sharing. The method involves a competitive bidding strategy that maximizes unserved load coverage while minimizing resource utilization and sensitive operational data sharing among entities. The work is validated on a two-microgrid system with photovoltaic and energy storage systems and curves of load derived from real world residential buildings datasets. Results show that the proposed method, when applied for three distinct use cases of energy storage sufficiency to cover the predefined boundary and/or the expanded boundary, can successfully select and bid the available load coverage.

Starke, Michael [ORNL] (ORCID:0000000221211195)↗

A large-scale benchmarking of deterministic and stochastic derivative-free optimization algorithms

This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.

36 MATERIALS SCIENCE↗

Expanding the synthetic biology toolbox of Cupriavidus necator for establishing fatty acid production

Abstract The Gram-negative betaproteobacterium Cupriavidus necator is a chemolithotroph that can convert carbon dioxide into biomass. Cupriavidus necator has been engineered to produce a variety of high-value chemicals in the past. However, there is still a lack of a well-characterized toolbox for gene expression and genome engineering. Development and optimization of biosynthetic pathways in metabolically engineered microorganisms necessitates control of gene expression via functional genetic elements such as promoters, ribosome binding sites (RBSs), and codon optimization. In this work, a set of inducible and constitutive promoters were validated and characterized in C. necator, and a library of RBSs was designed and tested to show a 50-fold range of expression for green fluorescent protein (gfp). The effect of codon optimization on gene expression in C. necator was studied by expressing gfp and mCherry genes with varied codon-adaptation indices and was validated by expressing codon-optimized variants of a C12-specific fatty acid thioesterase to produce dodecanoic acid. We discuss further hurdles that will need to be overcome for C. necator to be widely used for biosynthetic processes.

59 BASIC BIOLOGICAL SCIENCES↗

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint

This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

ENERGY PLANNING, POLICY, AND ECONOMY↗

Tailoring resonant magnetic perturbation to optimize fast-ion confinement during ELM control in KSTAR

Abstract 3D resonant magnetic perturbation (RMP) is one promising way to control edge localized modes that can cause excessive material erosion of tokamak first walls. However, RMP can lead to undesired degradation of plasma confinement, including fast-particle losses, which can impact the performance and safety of the reactor. This work investigates the optimization of the poloidal spectrum of the 3D field to optimize fast ion confinement during edge localized mode (ELM) suppression. In the initial step, the validity of the modeling framework is tested against experimental data. Simulations successfully replicate an increase in poloidal limiter temperature with different poloidal spectra. Then, the simulation shows improvement of fast ion confinement with a reduction of core resonant response, while edge resonant magnetic fields are maintained above the threshold to sustain the ELM suppression. Reduction of the core resonant fields keeps the Kolmogorov–Arnold–Moser surface and reduces the fast particle losses due to the stochastic magnetic field lines. The results highlight the potential of edge localization of the resonant fields to enhance the performance of fusion reactors, but further investigation is needed to improve the validation of this approach.

3D field↗

Data-driven simultaneous process optimization and adsorbent selection for vacuum pressure swing adsorption

Technologies for post-combustion carbon capture are essential for the reduction of greenhouse gas emissions to the atmosphere. However, they are still associated with high costs and energy consumption. Intensified processes for carbon capture have the potential to overcome these challenges due to their higher efficiency, lower capital cost, and increased operational flexibility. Here, this work investigates simultaneous optimization of process conditions and adsorbent selection for a modular Vacuum Pressure-Swing Adsorption system designed for CO 2 capture. Both surrogate-based Nonlinear Programming and Mixed-Integer Nonlinear Programming approaches are applied and compared in terms of computational efficiency and solution accuracy. Moreover, process performance results are examined by applying several data analytics techniques to gain insights into the material-process correlations. Data-driven classifiers and neural networks can accurately predict whether a material is likely to satisfy purity, recovery, and energy constraints when operated at optimal process conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The potential of quantum annealing for rapid solution structure identification

Abstract The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing’s performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.

97 MATHEMATICS AND COMPUTING↗

On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials

Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.

Fang, Di [Duke Univ., Durham, NC (United States)]↗

The right conditions for high-precision dynamic temperature and heat capacity measurement via pyrometry and conductivity

The pursuit of accurate bulk temperature T under extreme conditions has been a long-standing goal of the high pressure science community, complicated by a lack of data to inform models. To reach these extremely high-pressure, high-temperature (high P − T) conditions, a combination of dynamic and heated static experiments (e.g., diamond or gem anvil cel experiments) are used. For example, in a diamond anvil cell (DAC) experiment, a sample placed in the DAC is first pressurized. Following pressurization, the sample T is increased either by heating the entire DAC (usually using resistive heating, and limited to ∼1000K) or by applying intense laser power to the sample surfaces. In a dynamic experiment, the process of pressurizing the sample also heats it. In the case of shock physics experiments, such heating is substantial, easily reaching thousands of Kelvin; in our work we have seen T ∼17000K. Most methods of measuring temperature at ambient are not compatible with experiments under these high-pressure, high-temperature conditions: thermocouples break, melt, or have conductivity properties that differ from ambient where they are calibrated; thermometers would melt; both are too slow. As a result most methods are based on non-contact techniques such as x-ray diffraction broadening, neutron scattering, or optical methods. Of these, optical methods using the visible and near-infrared region of the spectrum are the most commonly used as the sources and detectors are readily available. In the case of optical methods the optical depth, and therefore the measurement location, is limited to the surface. When a window or anvil material is used, heat flows from the sample into the window/anvil. Likewise, if the sample undergoes a change in thermodynamic state, such as expansion upon release, different T may be expected. As a result, the surface or apparent temperature T app measurement will differ from the bulk or interior temperature that is desired. This surface measurement must be related to the bulk measurement using thermal transport models and material models. While it is tempting to conclude that one should just use x-ray methods that directly probe the interior, even these methods have been shown to depend on thermal transport and material models. Regardless of the method used to create the high P − T condition, therefore, we must understand the role of thermal transport and material models upon our interpretation of the T measurement, as well as the errors and uncertainties associated with the choice of models used in the analysis. This is a substantial area of research and this paper is by no means a complete survey of the relevant sources of uncertainty. For example, we have yet to begin to address alternate transport models in a detailed manner (e.g., Tan-Ahrens), or the many models that use additional layers to approximate melting, turbulence, or epitaxial phenomena). Likewise, we have not explored the impact upon uncertainty of thermal models that use temperature-dependent thermal transport coefficients, or the wide range of material models that can be applied. Instead, this paper focuses on using one simple model, the Urtiew-Grover model, to understand the sources of error in T measurement so that we may identify how best to focus future research efforts to return the best improvements and avoid working on over-optimizing a single type of measurement. To this end, we work through some of the best and worst case scenarios for T measurement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

A Novel Active Optimization Approach for Rapid and Efficient Design Space Exploration Using Ensemble Machine Learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) that fits high-level information about the response surface and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected for evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. Additionally, this methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface and, subsequently, to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to conventional optimization techniques, such as particle swarm and genetic algorithm-based optimization techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A novel active optimization approach for rapid and efficient design space exploration using ensemble machine learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) which fits high-level information about the response surface, and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner, is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected to be evaluated using expensive function evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. This methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface. The performance of the new active learning approach is compared with traditional global optimization methods, namely micro-genetic algorithm (pGA) and particle swarm optimization (PSO). It is demonstrated that the new optimizer is able to reach the global optimum much faster with a significantly fewer number of function evaluations. Subsequently, the new optimizer is also applied to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is again found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to particle swarm and genetic algorithm-based optimization techniques.

Machine learning, active learning, design optimiza↗

Optimization of an electron injector for operating high-intensity polarized electron beam

In this work, the simulation and optimization of an electron injector that operates a high-intensity polarized electron beam are presented. The electron injector would provide a single-bunch electron beam at a repetition rate of 1 Hz with a bunch charge of 10 nC, kinetic energy of 400 MeV and an electron spin polarization of 85%. A direct current (DC) high-voltage photogun was employed to produce the 10 nC polarized electron beam with a kinetic energy of 350 keV, beam diameter of 1.44 cm (Gaussian distribution with σ of 0.36 cm) and full bunch length of 1.3 ns (Gaussian distribution with σ of 0.325 ns). The beam was compressed to 6 ps of RMS bunch length using one 114.24 MHz standing-wave sub-harmonic buncher, two 571.2 MHz standing-wave sub-harmonic bunchers and one 2.856 GHz traveling-wave buncher. The beam was accelerated finally to 400 MeV via eight 2.856 GHz traveling-wave Linacs. We performed the beam simulation, and the simulated results showed that the optimized RMS bunch length was 4.65 ps, RMS relative energy spread was 0.48% and normalized RMS transverse emittance was 30.13 mm · mrad at a beam energy of 400 MeV.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Data reduction through optimized scalar quantization for more compact neural networks

Raw data generation for several existing and planned large physics experiments now exceeds TB/s rates, generating untenable data sets in very little time. Those data often demonstrate high dimensionality while containing limited information. Meanwhile, Machine Learning algorithms are now becoming an essential part of data processing and data analysis. Those algorithms can be used offline for post processing and post data analysis, or they can be used online for real time processing providing ultra low latency experiment monitoring. Both use cases would benefit from data throughput reduction while preserving relevant information: one by reducing the offline storage requirements by several orders of magnitude and the other by allowing ultra fast online inferencing with low complexity Machine Learning models. Moreover, reducing the data source throughput also reduces material cost, power and data management requirements. In this work we demonstrate optimized nonuniform scalar quantization for data source reduction. This data reduction allows lower dimensional representations while preserving the relevant information of the data, thus enabling high accuracy Tiny Machine Learning classifier models for online fast inferences. We demonstrate this approach with an initial proof of concept targeting the CookieBox, an array of electron spectrometers used for angular streaking, that was developed for LCLS-II as an online beam diagnostic tool. We used the Lloyd-Max algorithm with the CookieBox dataset to design an optimized nonuniform scalar quantizer. Optimized quantization lets us reduce input data volume by 69% with no significant impact on inference accuracy. When we tolerate a 2% loss on inference accuracy, we achieved 81% of input data reduction. Finally, the change from a 7-bit to a 3-bit input data quantization reduces our neural network size by 38%.

97 MATHEMATICS AND COMPUTING↗

A Tchebycheff-based multi-objective combined with a PSO–SQP dynamic real-time optimization framework for cycling energy systems

The aim in this work is to develop an optimization framework to address cycling of baseload energy systems due to the penetration of renewables into the grid. The developed strategy corresponds to a multi-objective and dynamic real-time optimization (MOO-DRTO) framework applied to a postcombustion MEA-based CO 2 capture process from a baseload coal-fired power plant under cycling conditions. A Tchebycheff-based method is used for the multi-objective optimization (MOO) component. Also, a hybrid approach consisting of Particle Swarm Optimization (PSO) and Sequential Quadratic Programming (SQP) is implemented for the first time in process systems engineering to solve the dynamic real-time optimization (DRTO) component. The objectives considered in the MOO-DRTO framework are economic and environmental. The proposed MOO-DRTO strategy is successfully implemented and 24-h optimal output trajectories for the carbon capture system under cycling are generated. Also, the optimal compromise is chosen from the Pareto front according to a set of selected weights for the objectives with minimal interaction between the framework and decision maker. The results indicated that the developed framework has potential to be extended to plant-wide optimization applications under cycling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Energy-efficient multimodal mobility networks in transportation digital twins: Strategies and optimization

The study proposes a comprehensive Transportation Mobility (TransitMo) framework covering conceptual design, model formulation, optimization, simulation, and impact analysis of the transportation mobility system. TransitMo is composed of a transportation digital twin developed in Simulation of Urban MObility (SUMO) and an Intelligent Traffic Management and Control Center (ITMCC) that identifies the best ways to improve the movement of people within urban areas using various modes of transportation. This study encompasses advanced modeling techniques, algorithms, and strategic testing to optimize energy efficiency and mobility in a multimodal shared mobility network. TransitMo’s practical applications are exemplified through a city-scaled simulation network in Chattanooga, TN, employing demographic data to analyze historical traffic patterns and forecast future demands. Central to this methodology are three models: the User Preference Model (UP), the Energy Consumption Model (EC), and the System Optimization Model (SO). These models work in concert to iteratively devise the optimal travel incentives and minimize the total system cost in a real-time manner. In conclusion, test results verified that the proposed adaptive incentive program and optimized bus scheduling can improve network performance by increasing public transit ridership.

42 ENGINEERING↗

Gaussian Process Optimization of Sensitivity-Based Similarity Metrics between New Nuclear Applications and New/Existing Benchmarks

Confidently designing safe, new nuclear criticality experiments requires expert judgement, which could take years of experience. Sensitivity/uncertainty (S/U) analysis can be utilized by less experienced individuals to conservatively estimate uncertainties in important parameters, such as k eff , in newly proposed nuclear applications. This type of analysis relies on matching new nuclear applications with existing benchmark experiments. The Whisper-1.1 software package included in MCNP6.2 ®1 contains more than 1,100 International Criticality Safety Benchmark Evaluation Project (ICSBEP) benchmarks. These benchmarks however rarely match new nuclear applications. The number of benchmarks available to match a given set of materials or geometric configurations varies significantly. Furthermore, recently performed benchmark experiments may not have had enough time to be properly documented and published. Benchmarks are vital for determining the accuracy of nuclear data and can assist nuclear physics and evaluators in improving nuclear data libraries. Exhaustively exploring the parameter space using simulations with software such as MCNP is too computationally expensive. In this work, Gaussian process optimization was implemented to reduce the number of simulations needed for optimization over multiple parameters. This optimization scheme was designed to selectively generate new benchmarks with high sensitivity-based similarity metrics to user-defined nuclear applications. Two benchmark models of spherically nested shells containing plutonium, uranium, tantalum, and water were used in the optimization to match an application containing plutonium plates, stacked in a tantalum reflector, surrounded by water.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗