Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic 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 1,081 records · Page 60

Modeling and Analysis of DC Microgrids as Stochastic Hybrid Systems

This study proposes a method of predicting the influence of random load behavior on the dynamics of dc microgrids and distribution systems. This is accomplished by combining stochastic load models and deterministic microgrid models. Together, these elements constitute a stochastic hybrid system. The resulting model enables straightforward calculation of dynamic state moments, which are used to assess the probability of desirable operating conditions. Specific consideration is given to systems based on the dual active bridge (DAB) topology. Bounds are derived for the probability of zero voltage switching (ZVS) in DAB converters. A simple example is presented to demonstrate how these bounds may be used to improve ZVS performance as an optimization problem. In conclusion, predictions of state moment dynamics and ZVS probability assessments are verified through comparisons to Monte Carlo simulations.

42 ENGINEERING↗

Kinetic model development and Bayesian uncertainty quantification for the complete reduction of Fe-based oxygen carriers with CH 4 , CO, and H 2 for chemical looping combustion

In this work, three kinetic models are developed and calibrated for the complete multi-step reduction of an Fe-based oxygen carrier (OC) particle with CH 4 , CO, and H 2 , using data from thermogravimetric analysis. The complete reduction rate profiles exhibit complex dynamics whose trajectory is significantly different depending on the reducing gas. A Bayesian model building and parameter estimation framework is applied for simultaneous parameter and model structure uncertainty quantification. The final models show excellent agreement between model predictions and calibration data, as well as new data not used for calibration (for the reduction of the OC with CH 4 ). Parameter uncertainty is quantified by determining joint posterior distribution, and model structure uncertainty is addressed by incorporating Gaussian process stochastic functions (represented by Bayesian smoothing splines) into the kinetic models. The final kinetic models with discrepancy functions are readily employable in equation-oriented simulation and optimization platforms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Open-loop control of noise amplification in a separated boundary layer flow

Linear optimal gains are computed for the subcritical two-dimensional separated boundary-layer flow past a bump. Very large optimal gain values are found, making it possible for small-amplitude noise to be strongly amplified and to destabilize the flow. The optimal forcing is located close to the summit of the bump, while the optimal response is the largest in the shear layer. The largest amplification occurs at frequencies corresponding to eigenvalues which first become unstable at higher Reynolds number. Nonlinear direct numerical simulations show that a low level of noise is indeed sufficient to trigger random flow unsteadiness, characterized here by large-scale vortex shedding. Next, a variational technique is used to compute efficiently the sensitivity of optimal gains to steady control (through source of momentum in the flow, or blowing/suction at the wall). A systematic analysis at several frequencies identifies the bump summit as the most sensitive region for control with wall actuation. Based on these results, a simple open-loop control strategy is designed, with steady wall suction at the bump summit. Linear calculations on controlled base flows confirm that optimal gains can be drastically reduced at all frequencies. Nonlinear direct numerical simulations also show that this control allows the flow to withstand a higher level of stochastic noise without becoming nonlinearly unstable, thereby postponing bypass transition. In the supercritical regime, sensitivity analysis of eigenvalues supports the choice of this control design. Full restabilization of the flow is obtained, as evidenced by direct numerical simulations and linear stability analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Noise-aware circuit compilations for a continuously parameterized two-qubit gateset

State-of-the-art noisy-intermediate-scale quantum processors are currently implemented across a variety of hardware platforms, each with their own distinct gatesets. As such, circuit compilation should not only be aware of but also deeply connect to the native gateset and noise properties of each. Trapped-ion processors are one such platform that provides a gateset that can be continuously parameterized across both one- and two-qubit gates. Here we use the Quantum Scientific Computing Open User Testbed to study noise-aware compilations focused on continuously parameterized two-qubit 𝑍⁢𝑍 gates (based on the Mølmer-Sørensen interaction) using $\scriptsize{SUPERSTAQ}$, a quantum software platform for hardware-aware circuit compiler optimizations. We discuss the realization of 𝑍⁢𝑍 gates with arbitrary angle on the all-to-all connected trapped-ion system. Then we discuss a variety of different compiler optimizations that innately target these 𝑍⁢𝑍 gates and their noise properties. These optimizations include moving from a restricted maximally entangling gateset to a continuously parameterized one, swap mirroring to further reduce the total entangling angle of the operations, focusing the heaviest 𝑍⁢𝑍 angle participation on the best-performing gate pairs, and circuit approximation to remove the least impactful 𝑍⁢𝑍 gates. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits, observing the potential to realize a larger quantum volume as a result of these optimizations. Using differing yet complementary analysis techniques, we observe the distinct improvements in system performance provided by these noise-aware compilations and study the role of stochastic and coherent error channels for each compilation choice.

Noise↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints

A novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems is proposed and it considers a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen’s inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improves upon the standard Benders’ algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen’s inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. But, the decomposition phase is required to attain optimality gaps. Moreover, use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately.

97 MATHEMATICS AND COMPUTING↗

Stochastic control with rough paths

We study a class of controlled differential equations driven by rough paths (or rough path realizations of Brownian motion) in the sense of Lyons. It is shown that the value function satisfies a HJB type equation; we also establish a form of the Pontryagin maximum principle. Deterministic problems of this type arise in the duality theory for controlled diffusion processes and typically involve anticipating stochastic analysis. We make the link to old work of Davis and Burstein (Stoch Stoch Rep 40:203–256, 1992) and then prove a continuous-time generalization of Roger’s duality formula [SIAM J Control Optim 46:1116–1132, 2007]. The generic case of controlled volatility is seen to give trivial duality bounds, and explains the focus in Burstein–Davis’ (and this) work on controlled drift. Our study of controlled rough differential equations also relates to work of Mazliak and Nourdin (Stoch Dyn 08:23, 2008).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Andromeda (M31) optical and infrared disk survey. I. Insights in wide-field near-IR surface photometry

We present wide-field near-infrared J and K{sub s} images of the Andromeda Galaxy (M31) taken with WIRCam at the Canada-France-Hawaii Telescope as part of the Andromeda Optical and Infrared Disk Survey. This data set allows simultaneous observations of resolved stars and near-infrared (NIR) surface brightness across M31's entire bulge and disk (within R = 22 kpc), permitting a direct test of the stellar composition of near-infrared light in a nearby galaxy. Here we develop NIR observation and reduction methods to recover a uniform surface brightness map across the 3° × 1° disk of M31 with 27 WIRCam fields. Two sky-target nodding strategies are tested, and we find that strictly minimizing sky sampling latency cannot improve background subtraction accuracy to better than 2% of the background level due to spatio-temporal variations in the NIR skyglow. We fully describe our WIRCam reduction pipeline and advocate using flats built from night-sky images over a single night, rather than dome flats that do not capture the WIRCam illumination field. Contamination from scattered light and thermal background in sky flats has a negligible effect on the surface brightness shape compared to the stochastic differences in background shape between sky and galaxy disk fields, which are ∼0.3% of the background level. The most dramatic calibration step is the introduction of scalar sky offsets to each image that optimizes surface brightness continuity. Sky offsets reduce the mean surface brightness difference between observation blocks from 1% to <0.1% of the background level, though the absolute background level remains statistically uncertain to 0.15% of the background level. We present our WIRCam reduction pipeline and performance analysis to give specific recommendations for the improvement of NIR wide-field imaging methods.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimal investment strategies for distributed generation in distribution networks with real option analysis

Efficient and well‐timed investment in distributed generation (DG) in distribution networks in the electricity market environment presents a big challenge for distribution companies. In this study, a real option valuation framework is proposed to determine the optimal investment strategies for DG including the investment location, size, and timing. Within the proposed framework, the profit from investing in DG is modelled, where the benefits include the operation cost savings and capacity update deferral benefit compared with a no‐DG‐investment scenario over the study period. Future power demands and electricity prices are modelled as stochastic variables. The candidate DG investment plans are considered as multiple mutually exclusive options, and the corresponding managerial flexibility for seizing opportunities and mitigating risk of loss upon an unfavourable unfolding of future uncertainties is assessed with real option analysis using the extended least square Monte Carlo method. The distribution of future investment strategies and optimal initial investment threshold levels under various scenarios are analysed in a case study to demonstrate the characteristics of the proposed framework and methodology.

Zou, Bo↗

Learning-accelerated discovery of immune-tumour interactions

We present an integrated framework for enabling dynamic exploration of design spaces for cancer immunotherapies with detailed dynamical simulation models on high-performance computing resources. Our framework combines PhysiCell, an open source agent-based simulation platform for cancer and other multicellular systems, and EMEWS, an open source platform for extreme-scale model exploration. We build an agent-based model of immunosurveillance against heterogeneous tumours, which includes spatial dynamics of stochastic tumour–immune contact interactions. We implement active learning and genetic algorithms using high-performance computing workflows to adaptively sample the model parameter space and iteratively discover optimal cancer regression regions within biological and clinical constraints.

60 APPLIED LIFE SCIENCES↗

Seasonal Reconfiguration of Electrical Distribution Systems to Mitigate the Impact of Electric Vehicle Charging

Power grids face challenges in their infrastructure related to the integration of electric vehicles (EV). In particular, EV charging stations may induce instability in key system parameters such as substantial voltage drops, active power losses, and transformer overload due to high demand during charging periods. This article presents a seasonal reconfiguration strategy based on the differential evolution (DE) algorithm, aimed at enhancing system performance under highly variable and stochastic load profiles, particularly those driven by EV charging. The DEA algorithm is hybridized with the find-union (FU) algorithm to efficiently ensure network radiality throughout the optimization process. The proposed methodology is validated on a hybrid distribution system composed of the IEEE 33-bus network, a modified IEEE 13-bus system, and a specific 13-bus microgrid. Results have demonstrated that seasonal reconfiguration significantly reduces active power losses and mitigates transformer loading during critical demand hours, thereby quantifiably increasing the system’s performance. As an integral component of the proposed approach, an analysis of CO2 emissions associated with energy losses is included, allowing a contextualized assessment of the environmental benefits of seasonal reconfiguration in various geographical areas.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Diffusion Probabilistic Modeling for Video Generation

Denoising diffusion probabilistic models are a promising new class of generative models that mark a milestone in high-quality image generation. This paper showcases their ability to sequentially generate video, surpassing prior methods in perceptual and probabilistic forecasting metrics. We propose an autoregressive, end-to-end optimized video diffusion model inspired by recent advances in neural video compression. The model successively generates future frames by correcting a deterministic next-frame prediction using a stochastic residual generated by an inverse diffusion process. We compare this approach against six baselines on four datasets involving natural and simulation-based videos. We find significant improvements in terms of perceptual quality and probabilistic frame forecasting ability for all datasets.

97 MATHEMATICS AND COMPUTING↗

Spanning the Core Design Space with Binary Perturbations - A Mathematical Investigation

A reactor core design engineer, even one with many years of experience or one using advanced fuel pattern optimization software, will likely fine tune the pattern before finalizing the design. Fine tuning can further minimize local enthalpy peaks, optimize reactivity to extend burnup, and add additional margin to limits on reactivity coefficients or heat flux. For reactors that have reached an equilibrium fuel cycle, the number of feeds each cycle is typically the similar to previous cycles as is their placement in the core. It is then the engineer's responsibly to efficiently select the placement of burned assemblies to ensure optimal fuel utilization, satisfy safety limits, and meet cycle energy requirements. One of the engineer's most commonly used tools in this fine tuning investigation is to swap the positions of two assemblies, most likely two previously irradiated ('burned') assemblies since their reactivity is lower than fresh fuel. Such an operation is referred to in this work as a binary perturbation or a 'swap'. If quarter core symmetry is maintained, the perturbation translates to the other three quadrants. Likewise if eighth core symmetry is maintained, the perturbation translates to other seven octants. The question is then, how much of the core design space can binary perturbations possibly span? This work seeks to quantitatively define the space spanned by m number of binary perturbations as a function of variable size through combinatorial principles and computer simulation. The results of this study are useful in understanding the in-core fuel management problem faced by both professionals who employ hand manipulations and those who attempt stochastic solutions of the problem.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Optimization of Thermal Conductance at Interfaces Using Machine Learning Algorithms

We report optimization of thermal transport across the interface of two different materials is critical to micro-/nanoscale electronic, photonic, and phononic devices. Although several examples of compositional intermixing at the interfaces having a positive effect on interfacial thermal conductance (ITC) have been reported, an optimum arrangement has not yet been determined because of the large number of potential atomic configurations and the significant computational cost of evaluation. On the other hand, computation-driven materials design efforts are rising in popularity and importance. Yet, the scalability and transferability of machine learning models remain as challenges in creating a complete pipeline for the simulation and analysis of large molecular systems. In this work we present a scalable Bayesian optimization framework, which leverages dynamic spawning of jobs through the Message Passing Interface (MPI) to run multiple parallel molecular dynamics simulations within a parent MPI job to optimize heat transfer at the silicon and aluminum (Si/Al) interface. We found a maximum of 50% increase in the ITC when introducing a two-layer intermixed region that consists of a higher percentage of Si. Because of the random nature of the intermixing, the magnitude of increase in the ITC varies. We observed that both homogeneity/heterogeneity of the intermixing and the intrinsic stochastic nature of molecular dynamics simulations account for the variance in ITC.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs

Progressive hedging, though an effective heuristic for solving stochastic mixed integer programs (SMIPs), is not guaranteed to converge in this case. Here, we describe BBPH, a branch and bound algorithm that uses PH at each node in the search tree such that, given sufficient time, it will always converge to a globally optimal solution. Additionally, to providing a theoretically convergent “wrapper” for PH applied to SMIPs, computational results demonstrate that for some difficult problem instances branch and bound can find improved solutions after exploring only a few nodes.

97 MATHEMATICS AND COMPUTING↗

Combined Municipal Solid Waste and biomass system optimization for district energy applications

Highlights: • Combined energy conversion of MSW and agricultural residue biomass is examined. • The model optimizes the financial yield of the investment. • Several system specifications are optimally defined by the optimization model. • The application to a case study in Greece shows positive financial yield. • The investment is mostly sensitive on the interest rate, the investment cost and the heating oil price. - Abstract: Municipal Solid Waste (MSW) disposal has been a controversial issue in many countries over the past years, due to disagreement among the various stakeholders on the waste management policies and technologies to be adopted. One of the ways of treating/disposing MSW is energy recovery, as waste is considered to contain a considerable amount of bio-waste and therefore can lead to renewable energy production. The overall efficiency can be very high in the cases of co-generation or tri-generation. In this paper a model is presented, aiming to support decision makers in issues relating to Municipal Solid Waste energy recovery. The idea of using more fuel sources, including MSW and agricultural residue biomass that may exist in a rural area, is explored. The model aims at optimizing the system specifications, such as the capacity of the base-load Waste-to-Energy facility, the capacity of the peak-load biomass boiler and the location of the facility. Furthermore, it defines the quantity of each potential fuel source that should be used annually, in order to maximize the financial yield of the investment. The results of an energy tri-generation case study application at a rural area of Greece, using mixed MSW and biomass, indicate positive financial yield of investment. In addition, a sensitivity analysis is performed on the effect of the most important parameters of the model on the optimum solution, pinpointing the parameters of interest rate, investment cost and heating oil price, as those requiring the attention of the decision makers. Finally, the sensitivity analysis is enhanced by a stochastic analysis to determine the effect of the volatility of parameters on the robustness of the model and the solution obtained.

09 BIOMASS FUELS↗

Mitigating the Impacts of Uncertain Geomagnetic Disturbances on Electric Grids: A Distributionally Robust Optimization Approach

Severe geomagnetic disturbances (GMDs) increase the magnitude of the electric field on the Earth’s surface (E-field) and drive geomagnetically-induced currents (GICs) along the transmission lines in electric grids. These additional currents can pose severe risks, such as current distortions, transformer saturation and increased reactive power losses, each of which can lead to system unreliability. Today several mitigation actions (e.g., changing grid topology) exist that can reduce the harmful GIC effects on the grids. Making such decisions can be challenging, however, because the magnitude and direction of the E-field are uncertain and non-stationary. In this paper, we model uncertain E-fields using the distributionally robust optimization (DRO) approach that determines optimal transmission grid operations such that the worst-case expectation of the system cost is minimized. We also capture the effect of GICs on the nonlinear AC power flow equations. For solution approaches, we develop an accelerated column-and-constraint generation (CCG) algorithm by exploiting a special structure of the support set of uncertain parameters representing the E-field. Extensive numerical experiments based on “epri-21” and “uiuc-150” systems, designed for GMD studies, demonstrate (i) the computational performance of the accelerated CCG algorithm, (ii) the superior performance of distributionally robust grid operations that satisfy nonlinear, nonconvex AC power flow equations and GIC constraints, in comparison with standard stochastic programming-based methods during the out-of-sample testing.

42 ENGINEERING↗

Pyomo.DOE: An open-source package for model-based design of experiments in Python

Predictive mathematical models are a cornerstone of science and engineering. Yet selecting, calibrating, and validating said science-based models often remains an art in practice. Model-based design of experiments (MBDoE) provides a systematic framework to maximize information gain from experiments while minimizing time and resource costs. But MBDoE remains limited to niche application areas, in part because practitioners must integrate expertise in statistics, computational optimization, and modeling. To help reduce this barrier, we introduce Pyomo.DOE, an open-source package for MBDoE. Pyomo.DOE uses a nonlinear sensitivity analysis code k_aug to quickly approximate the Fisher information matrix and leverages a new stochastic programming abstraction. We demonstrate Pyomo.DOE with the first application of MBDoE to fixed-bed breakthrough experiments, which highlights the power of Pyomo.DOE to quantify the value of experimental modifications a priori for large-scale partial differential-algebraic equation (PDAE) models. Here we also provide a mathematical primer on MBDoE targeted at general chemical engineers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗