Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer experiments”

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 361 records · Page 20

Pyomo : Python Optimization Modeling Objects.

The Python Optimization Modeling Objects (Pyomo) package [1] is an open source tool for modeling optimization applications within Python. Pyomo provides an objected-oriented approach to optimization modeling, and it can be used to define symbolic problems, create concrete problem instances, and solve these instances with standard solvers. While Pyomo provides a capability that is commonly associated with algebraic modeling languages such as AMPL, AIMMS, and GAMS, Pyomo's modeling objects are embedded within a full-featured high-level programming language with a rich set of supporting libraries. Pyomo leverages the capabilities of the Coopr software library [2], which integrates Python packages (including Pyomo) for defining optimizers, modeling optimization applications, and managing computational experiments. A central design principle within Pyomo is extensibility. Pyomo is built upon a flexible component architecture [3] that allows users and developers to readily extend the core Pyomo functionality. Through these interface points, extensions and applications can have direct access to an optimization model's expression objects. This facilitates the rapid development and implementation of new modeling constructs and as well as high-level solution strategies (e.g. using decomposition- and reformulation-based techniques). In this presentation, we will give an overview of the Pyomo modeling environment and model syntax, and present several extensions to the core Pyomo environment, including support for Generalized Disjunctive Programming (Coopr GDP), Stochastic Programming (PySP), a generic Progressive Hedging solver [4], and a tailored implementation of Bender's Decomposition.

99 GENERAL AND MISCELLANEOUS↗

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modeling Subsurface Performance of a Geothermal Reservoir Using Machine Learning

Geothermal power plants typically show decreasing heat and power production rates over time. Mitigation strategies include optimizing the management of existing wells—increasing or decreasing the fluid flow rates across the wells—and drilling new wells at appropriate locations. The latter is expensive, time-consuming, and subject to many engineering constraints, but the former is a viable mechanism for periodic adjustment of the available fluid allocations. In this study, we describe a new approach combining reservoir modeling and machine learning to produce models that enable such a strategy. Our computational approach allows us, first, to translate sets of potential flow rates for the active wells into reservoir-wide estimates of produced energy, and second, to find optimal flow allocations among the studied sets. In our computational experiments, we utilize collections of simulations for a specific reservoir (which capture subsurface characterization and realize history matching) along with machine learning models that predict temperature and pressure timeseries for production wells. We evaluate this approach using an “open-source” reservoir we have constructed that captures many of the characteristics of Brady Hot Springs, a commercially operational geothermal field in Nevada, USA. Selected results from a reservoir model of Brady Hot Springs itself are presented to show successful application to an existing system. In both cases, energy predictions prove to be highly accurate: all observed prediction errors do not exceed 3.68% for temperatures and 4.75% for pressures. In a cumulative energy estimation, we observe prediction errors that are less than 4.04%. A typical reservoir simulation for Brady Hot Springs completes in approximately 4 h, whereas our machine learning models yield accurate 20-year predictions for temperatures, pressures, and produced energy in 0.9 s. This paper aims to demonstrate how the models and techniques from our study can be applied to achieve rapid exploration of controlled parameters and optimization of other geothermal reservoirs.

15 GEOTHERMAL ENERGY↗

Evaluation of HEU-Beryllium Benchmark Experiments to Improve Computational Analysis of Space Reactors

An assessment was previously performed to evaluate modeling capabilities and quantify preliminary biases and uncertainties associated with the modeling methods and data utilized in designing a nuclear reactor such as a beryllium-reflected, highly-enriched-uranium (HEU)-O 2 fission surface power (FSP) system for space nuclear power. The conclusion of the previous study was that current capabilities could preclude the necessity of a cold critical test of the FSP; however, additional testing would reduce uncertainties in the beryllium and uranium cross-section data and the overall uncertainty in the computational models. A series of critical experiments using HEU metal were performed in the 1960s and 1970s in support of criticality safety operations at the Y-12 Plant. Of the hundreds of experiments, three were identified as fast-fission configurations reflected by beryllium metal. These experiments have been evaluated as benchmarks for inclusion in the International Handbook of Evaluated Criticality Safety Benchmark Experiments (IHECSBE). Further evaluation of the benchmark experiments was performed using the sensitivity and uncertainty analysis capabilities of SCALE 6. The data adjustment methods of SCALE 6 have been employed in the validation of an example FSP design model to reduce the uncertainty due to the beryllium cross section data.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Dynamic Motions of Topological Defects in Nematic Liquid Crystals under Spatial Confinement

Abstract Topological defects (TDs) have become a sensational topic due to their significant influence on the unusual optical and physiochemical characteristics of the material. To facilitate their application across a wide range of disciplines it is desirable to analyze and gain fundamental understanding of TDs in both equilibrium and nonequilibrium systems. Liquid crystals (LCs) are considered an ideal system for study given the direct visualization of TDs and a straightforward analyzation process. In addition to the equilibrium morphology of LC TDs, it is also of great interest to track and control the formation and annihilation of defects during thermodynamic processes. However, controlling the dynamic behavior of formed defects remains a challenge. Here, nematic LCs confined in a cell exhibiting surfaces with periodic anchoring conditions containing surface topography are relied on. The effects of patterned surface characteristics such as width, periodicity, and degree of curvature on defects dynamic motion, stabilization, and annihilation are explored. The computational experiments recapitulate the TDs transition path and provide free energy‐based predictions of critical distances for defect annihilation. Taken together, this simple approach offers a promising opportunity to control the dynamics of TDs in LCs through chemical patterned surfaces with topography.

36 MATERIALS SCIENCE↗

Accelerating k-NN Algorithm with Hybrid MPI and OpenSHMEM

Machine Learning algorithms are benefiting from the continuous improvement of programming models, including MPI, MapReduce and PGAS. k-Nearest Neighbors (k-NN) algorithm is a widely used machine learning algorithm, applied to supervised learning tasks such as classification. Several parallel implementations of k-NN have been proposed in the literature and practice. However, on high-performance computing systems with high-speed interconnects, it is important to further accelerate existing designs of the k-NN algorithm through taking advantage of scalable programming models. To improve the performance of k-NN on large-scale environment with InfiniBand network, this paper proposes several alternative hybrid MPI+OpenSHMEM designs and performs a systemic evaluation and analysis on typical workloads. The hybrid designs leverage the one-sided memory access to better overlap communication with computation than the existing pure MPI design, and propose better schemes for efficient buffer management. The implementation based on k-NN program from MaTEx with MVAPICH2-X (Unified MPI+PGAS Communication Runtime over InfiniBand) shows up to 9.0% time reduction for training KDD Cup 2010 workload over 512 cores, and 27.6% time reduction for small workload with balanced communication and computation. Experiments of running with varied number of cores show that our design can maintain good scalability.

Lin, Jian↗

Experimental characterization and atomistic modeling of interfacial void formation and detachment in short pulse laser processing of metal surfaces covered by solid transparent overlayers

The short pulse laser interaction with metal surfaces covered by solid transparent overlayers is investigated in experiments and atomistic simulations, with a particular aim of revealing the mechanisms responsible for structural modification of the metal–overlayer interfacial regions. Experimental characterization of Al–silica targets modified by single-pulse laser irradiation with the pulse duration of 10 ps reveals the transitions from the generation of extended interfacial voids with internal nanoscale surface roughness to the partial detachment of the overlayer from the metal substrate, and to the cracking/chipping or complete removal of the overlayer as the laser fluence increases. The mechanisms responsible for the appearance, growth, and percolation of the interfacial voids leading to the detachment of the overlayer from the metal substrate are investigated in a large-scale atomistic simulation. The results of the simulation demonstrate that the processes of nucleation and growth of the interfacial voids are driven by the dynamic relaxation of laser-induced stresses proceeding simultaneously with rapid phase transformations and temperature variation in the interfacial region. The growth and coalescence of the interfacial voids results in the formation of liquid bridges connecting the overlayer and the metal substrate, whereas solidification of the transient liquid structures produced by the breakup of the liquid bridges may be responsible for the formation of the nanoscale roughness of the interfacial voids observed in experiments. Computational analysis of the effect of preexisting interfacial voids reveals a complex dynamic picture of the initial expansion and subsequent compaction of the surface region of the metal substrate and suggests a possible scenario for the formation of voids below the metal–overlayer interface.

Materials Science↗

Chance-constrained economic dispatch with renewable energy and storage

Increased penetration of renewables, along with uncertainties associated with them, have transformed how power systems are operated. High levels of uncertainty means that it is not longer possible to guarantee operational feasibility with certainty, instead constraints are required to be satisfied with high probability. We present a chance-constrained economic dispatch model that efficiently integrates energy storage and high renewable penetration to satisfy renewable portfolio requirements. Specifically, it is required that wind energy contributes at least a prespecified ratio of the total demand and that the scheduled wind energy is dispatchable with high probability. We develop an approximated partial sample average approximation (PSAA) framework to enable efficient solution of large-scale chanceconstrained economic dispatch problems. Computational experiments on the IEEE-24 bus system show that the proposed PSAA approach is more accurate, closer to the prescribed tolerance, and about 100 times faster than sample average approximation. Improved efficiency of our PSAA approach enables solution of WECC-240 system in minutes.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A multi-stage stochastic programming model for adaptive biomass processing operation under uncertainty

Variations of physical and chemical characteristics of biomass reduce equipment utilization and increase operational costs of biomass processing. Biomass processing facilities use sensors to monitor the changes in biomass characteristics. Integrating sensory data into the operational decisions in biomass processing will increase its flexibility to the changing biomass conditions. In this paper, we propose a multi-stage stochastic programming model that minimizes the expected operational costs by identifying the initial inventory level and creating an operational decision policy for equipment speed settings. These policies take the sensory information data and the current biomass inventory level as inputs to dynamically adjust inventory levels and equipment settings according to the changes in the biomass' characteristics. We ensure that a prescribed target reactor utilization is consistently achieved by penalizing the violation of the target reactor feeding rate. A case study is developed using real-world data collected at Idaho National Laboratory's biomass processing facility. We show the value of multi-stage stochastic programming from an extensive computational experiment. Our sensitivity analysis indicates that updating the infeed rate of the system, the processing speed of equipment, and bale sequencing based on the moisture level of biomass improves the processing rate of the reactor and reduces operating costs.

09 BIOMASS FUELS↗

Efficient Surrogate Model Development: Impact of Sample Size and Underlying Model Dimensions

This study compares eight surrogate-model construction approaches using computational experiments. Here, the construction approaches considered include: Artificial Neural Networks (ANNs), Automated Learning of Algebraic Models using Optimization (ALAMO), Radial Basis Networks (RBNs), Extreme Learning Machines (ELMs), Gaussian Progress Regression (GPR), Random Forests (RFs), Support Vector Regression (SVR), and Multivariate Adaptive Regression Splines. Each approach is used to construct surrogate models for predicting the outputs of thirty-four test functions. The data used to construct surrogate models were generated using Latin Hypercube Sampling (LHS), Halton and Sobol sampling methods. We studied the impact of sampling method, sample size, and challenge function characteristics on the accuracy of surrogate model predictions. Our results revealed that for smaller sample sizes, on average, surrogate models trained using the data points generated by Sobol sequences provided the best estimation for all surrogate model construction approaches. As the sample size increased, the impact of sampling methods diminished. The comparison of surrogate-modeling construction approaches at large sample sizes revealed that surrogate models trained using ANN, ALAMO, and ELM yielded smaller root mean squared error and higher adjusted R-squared values than the models trained using the rest of the approaches.

42 ENGINEERING↗

Optimization of battery swapping infrastructure for e-commerce drone delivery

Drone delivery is widely-researched to alter the current e-commerce delivery convention for providing short delivery lead times. Yet, flight range of drones, constrained by the available battery technology, sets a milestone toward realizing the sole-drone delivery. To tackle with the flight range limitation, locating automated battery swapping machines (ABSM) have been proposed and a few studies modeled the problem. Using the ABSMs, drones can be loaded with fully-charged batteries along the route to a demand location. Here, we introduce a mixed-integer nonlinear program to model the problem. The objective of the program is to optimally select ABSM locations, determine the delivery-mode choices (drone-only, truck-only, and mixed delivery) of demand locations, find drone delivery routes, and approximate the baseline requirements for the number of drones and batteries needed. The program minimizes the overall delivery system costs including: ABSM, delivery, drone ownership, battery inventory, and service congestion. A cutting-plane method is developed to find exact solutions in finite iterations. Computational experiments showed that the method quickly yields the optimal solution to instances with less than 60 ABSM candidates and 20 demand locations. A case study shows that the optimal drone delivery infrastructure can save almost 20% cost compared to the conventional truck-only delivery. Sensitivity analyses were conducted to reveal the impact of key parameters in the decision-making and found that a decrease in the ABSM and drone costs highly affect the system cost.

25 ENERGY STORAGE↗

Optimizing the design and operation of water networks: Two decomposition approaches

We consider the design and operation of water networks simultaneously. Water network problems can be divided into two categories: the design problem and the operation problem. The design problem involves determining the appropriate pipe sizing and placements of pump stations, while the operation problem involves scheduling pump stations over multiple time periods to account for changes in supply and demand. Our focus is on networks that involve water co-produced with oil and gas. While solving the optimization formulation for such networks, we found that obtaining a primal (feasible) solution is more challenging than obtaining dual bounds using off-the-shelf mixed-integer nonlinear programming solvers. Therefore, we propose two methods to obtain good primal solutions. One method involves a decomposition framework that utilizes a convex reformulation, while the other is based on time decomposition. To test our proposed methods, we conduct computational experiments on a network derived from the PARETO case study.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A branch-and-price algorithm for a team orienteering problem with fixed-wing drones

This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot turns and restricting them to a minimum turn radius. This paper presents the implications of these constraints on the drone routing problem formulation and proposes a systematic technique to address them in the context of the team orienteering problem. Furthermore, a novel branch-and-price algorithm with branching techniques specific to the constraints imposed due to fixed-wing drones are proposed. Extensive computational experiments on benchmark instances corroborating the effectiveness of the algorithms are also presented.

42 ENGINEERING↗

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗

Power-transfer and fixed-point analysis of sawtooth simulations of a current-carrying stellarator

Power-transfer and fixed-point analysis of previous NIMROD simulations (Roberds et al. , Phys. Plasmas , vol. 23, issue 9, 2016, 092513) improved the understanding of the effect of 3D (non-axisymmetric equilibrium) magnetic fields on sawtooth oscillations in the Compact Toroidal Hybrid (CTH) experiment. Computing the locations of order-1 fixed points, their Greene's residues, and local values for the rotational transform results in a description of CTH sawteeth consistent with Kadomtsev's model. A power-transfer analysis quantifies the distribution of energy among toroidal Fourier modes and their nonlinear interactions. The Lorentz power transfer drives sawtooth growth, and it is unambiguously interpreted as the flow of energy from toroidal mode $n'$ to mode $n$ , catalysed by $\boldsymbol {B}_{n-n'}$ . It has been reported previously that the CTH sawtooth frequency increases with the 3D field strength. This is attributed to an increased growth rate of the internal kink that drives sawtooth oscillations. Here, 3D fields remove energy from the kink, eliminating the possibility that these fields are an additional energy source that drives growth. Instead, 3D fields catalyse energy transfer from large-to-small scales, where magnetic reconnection is stronger. It is proposed that this energy transfer increases the reconnection rate at small scales, which is consistent with the increased growth rate observed at higher 3D field strengths.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Tunable Nanostructures from Inverse Surfactants

Hierarchical materials in the natural world are often made through the self-assembly of amphiphilic molecules. Achieving similar structural complexity in synthetic materials requires understanding how various molecular parameters affect assembly behavior. In recent years, inverse surfactants─molecules with hydrophobic head groups and hydrophilic macromolecular tails─have been shown to self-assemble into supramolecular assemblies in aqueous solutions that show promise for a number of applications, including drug delivery. Here, we build an understanding of the morphological phase diagram of inverse surfactants using insights from scattering experiments, computer simulations, and statistical mechanics. The scattering and simulation results reveal that changing the headgroup size is an important molecular knob in controlling morphological transitions. The molecular size ratio of the hydrophobic group to the hydrophilic group emerges as a crucial dimensionless quantity in our theory and plays a determining role in setting the micelle structure and the transition from mesoscale to macroscale aggregates. Our minimal theory is able to qualitatively explain the key features of the morphological phase diagram, including the prevalence of fiber-like structures in comparison to spherical and planar micelles. Together, these findings provide a more complete picture of the molecular dependencies of assemblies of inverse surfactants, which we hope may aid in the de novo design of supramolecular structures.

Christakopoulos, Panagiotis [ORNL] (ORCID:00090004↗

The Martini 3 Lipidome: Expanded and Refined Parameters Improve Lipid Phase Behavior

Lipid membranes are central to cellular life. Complementing experiments, computational modeling has been essential in unraveling complex lipid-biomolecule interactions, crucial in both academia and industry. The Martini model, a coarse-grained force field for efficient molecular dynamics simulations, is widely used to study membrane phenomena but has faced limitations, particularly in capturing realistic lipid phase behavior. Here, we present refined Martini 3 lipid models with a mapping scheme that distinguishes lipid tails that differ by just two carbon atoms, enhancing the structural resolution and thermodynamic accuracy of model membrane systems including ternary mixtures. The expanded Martini lipid library includes thousands of models, enabling simulations of complex and biologically relevant systems. These advancements establish Martini as a robust platform for lipid-based simulations across diverse fields.

Lipids↗