Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic optimizations”

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

Uncertainty-Informed Operation Coordination in a Water-Energy Nexus

The widespread deployment of smart heterogeneous technologies and the growing complexity in our modern society calls for effective coordination of the interdependent lifeline networks. In particular, operation coordination of electric power and water infrastructures is urgently needed as the water system is one of the most energy-intensive networks, an interruption in which may quickly evolve into a dramatic societal concern. This paper develops a novel analytic for uncertainty-aware day-ahead operation optimization of the interconnected power and water systems (PaWS). Joint probabilistic constraint (JPC) programming is employed to capture the uncertainties in wind resources and water demand forecasts. The proposed integrated stochastic model is presented as a non-linear non-convex optimization problem, where the non-linear hydraulic constraints in the water network are linearized using piece-wise linearization technique, and the non-convexity is efficiently tackled with a solution methodology to convert the proposed model with JPCs to a tractable mixed-integer linear programming (MILP) formulation that can be quickly solved to optimality. Here, the suggested framework is applied to a 15-node commercial-scale water network jointly operated with a power transmission system using a modified IEEE 57-bus test system. The numerical results demonstrate the of the proposed stochastic framework, resulting in cost reduction (13% on average when compared to the traditional setting) and energy saving of the integrated model under different realizations of uncertain renewable energy sources (RESs) and water demand scenarios. Additionally, the scalability of the proposed model is tested on a modified IEEE 118-bus test system connected to five water networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

H ∞ Control for Energy Dispatch in Autonomous Nanogrid With Communication Delays

This paper proposes an optimal controller and estimator for energy dispatch to balance the power supply and demand considering communication delays. The proposed algorithm involves modeling an autonomous nanogrid (ANG) consisting of distributed energy resources, energy storage systems, loads, an $H$ ∞ controller with a reference power modulation technique, and a state estimator. The ANG was developed to express the dynamic supply-demand energy balance of a nanogird system. Reference power modulation was designed to generate the desired ESS power based on the imbalanced energy. Random communication delays were modeled using a stochastic variable satisfying the Bernoulli random binary distribution. The optimal $H$ ∞ controller and estimator were developed using a linear matrix inequality approach to exponentially stabilize the closed-loop system. Simulations were performed using real daily demand forecasts obtained from the Korea Meteorological Administration to demonstrate the effectiveness of the proposed real-time optimization algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

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↗
DOE OSTI2020

Do optimization methods in deep learning applications matter?

With advances in deep learning, exponential data growth and increasing model complexity, developing efficient optimization methods are attracting much research attention. Several implementations favor the use of Conjugate Gradient (CG) and Stochastic Gradient Descent (SGD) as being practical and elegant solutions to achieve quick convergence, however, these optimization processes also present many limitations in learning across deep learning applications. Recent research is exploring higher-order optimization functions as better approaches, but these present very complex computational challenges for practical use. Comparing first and higher-order optimization functions, in this paper, our experiments reveal that Levemberg-Marquardt (LM) significantly supersedes optimal convergence but suffers from very large processing time increasing the training complexity of both, classification and reinforcement learning problems. Our experiments compare off-the-shelf optimization functions(CG, SGD, LM and L-BFGS) in standard CIFAR, MNIST, CartPole and FlappyBird experiments.The paper presents arguments on which optimization functions to use and further, which functions would benefit from parallelization efforts to improve pretraining time and learning rate convergence.

Ozyildirim, Buse Melis↗
DOE OSTI2024

Characterizing and improving the performance of molten-salt-steam heat exchangers in concentrating solar power plants

Shell-and-tube heat exchangers (HXs) for steam generation from molten salts in concentrating solar power (CSP) plants experience thermal fatigue due to significant temperature gradients and inherent transient operation. Molten salt-steam HX design lifespans exceed actual lifespans, and, as a consequence, designers overpredict plant profitability and operators neglect appropriate prescriptions to optimize these lifetimes. Here, this study refines HX lifespan estimates with data benchmarked against thermal-fluid mechanical modeling of stress and accumulated fatigue. Reduced-order thermal models of the molten salt-steam, shell-and-tube evaporator and superheater predict transient temperature profiles along the two HXs salt-steam flow paths. The modeled evaporator and superheater temperature profiles enable assessment of cyclic stresses within the HX tubesheets, where molten-salt HX failures are most common. Evaporator and superheater performance data from a current 110 MW elec commercial CSP plant provide a basis for validating the reduced-order HX models. HX life predictions derived from stochastic failure distributions serve as inputs for simulating and optimizing existing plant operations. The impact of the updated lifespans on overall plant revenue depends on operating scenarios. This study suggests that typical ramping rates for a CSP plant with a high-temperature Rankine cycle result in an evaporator and superheater life of approximately 10 and 25 years, respectively, compared to the design target of 30 years. Reduced HX lifespans decrease operational plant revenue on average by 4.6-5.1%. Furthermore, there may be as many as four HX replacements over the 30-year lifetime of the plant; and, purchase agreement loss due to failure to meet contractual production requirements can have ramifications that include the risk of bankruptcy.

14 SOLAR ENERGY↗
DOE OSTI2023

3D full core BEAVRS using OpenMOC with transport equivalence

Using an optimized implementation of the three-dimension method of characteristics for neutron transport, as well as a novel equivalence method for transport calculations de- signed to recover self-shielding errors from neglecting the angular dependence of reso- nant group absorption, a 3D full core light water reactor hybrid stochastic-deterministic eigenvalue calculation was achieved. This paper presents the optimizations developed and compares the transport solutions obtained. It realizes a runtime near 6,000 CPU hours for the statepoint, an improvement of an order of magnitude on previous works, with less than 1% error on pin fission/U-238 capture ratios and a few dozen pcms on the eigenvalue.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Three-Dimensional Full-Core BEAVRS Using OpenMOC with Transport Equivalence

Using an optimized implementation of the three-dimensional (3D) method of characteristics for neutron transport, along with a novel equivalence method for transport calculations that was designed to correct self-shielding errors from neglecting the angular dependence of resonant group absorption, a 3D full-core light water reactor hybrid stochastic-deterministic eigenvalue calculation was achieved. This paper presents the optimizations developed and compares the transport solutions obtained. For the statepoint, run times near 10 000 CPU hours are achieved—improving on previous works by an order of magnitude—with near 1% error on pin fission to 238 U capture ratios and a few dozen pcms on the eigenvalue.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗
DOE OSTI2026

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization [SWR-25-166]

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization aims to demonstrate the effect of adaptive sampling-based bi-fidelity stochastic trust region method (ASTRO-BFDF). ASTRO-BFDF, derived from a derivative-free adaptive sampling trust-region optimization (ASTRO-DF) (Shashaani et al. 2018, Ha and Shashaani 2023), intended to efficiently solve the bi-fidelity simulation optimization.

Mueller, Juliane [National Laboratory of the Rocki↗
DOE OSTI2020

An Evaluation of the Economic and Resilience Benefits of a Microgrid in Northampton, Massachusetts

Recent developments and advances in distributed energy resource (DER) technologies make them valuable assets in microgrids. This paper presents an innovative evaluation framework for microgrid assets to capture economic benefits from various grid and behind-the-meter services in grid-connecting mode and resilience benefits in islanding mode. In particular, a linear programming formulation is used to model different services and DER operational constraints to determine the optimal DER dispatch to maximize economic benefits. For the resiliency analysis, a stochastic evaluation procedure is proposed to explicitly quantify the microgrid survivability against a random outage, considering uncertainties associated with photovoltaic (PV) generation, system load, and distributed generator failures. Optimal coordination strategies are developed to minimize unserved energy and improve system survivability, considering different levels of system connectedness. The proposed framework has been applied to evaluate a proposed microgrid in Northampton, Massachusetts that would link the Northampton Department of Public Works, Cooley Dickenson Hospital, and Smith Vocational Area High School. The findings of this analysis indicate that over a 20-year economic life, a 441 kW/441 kWh battery energy storage system, and 386 kW PV solar array can generate $2.5 million in present value benefits, yielding a 1.16 return on investment ratio. Results of this study also show that forming a microgrid generally improves system survivability, but the resilience performance of individual facilities varies depending on power-sharing strategies.

25 ENERGY STORAGE↗
DOE OSTI2022

An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services

Many transit agencies operating paratransit and microtransit services have to respond to trip requests that arrive in real-time, which entails solving hard combinatorial and sequential decision-making problems under uncertainty. To avoid decisions that lead to significant inefficiency in the long term, vehicles should be allocated to requests by optimizing a non-myopic utility function or by batching requests together and optimizing a myopic utility function. While the former approach is typically offline, the latter can be performed online. We point out two major issues with such approaches when applied to paratransit services in practice. First, it is difficult to batch paratransit requests together as they are temporally sparse. Second, the environment in which transit agencies operate changes dynamically (e.g., traffic conditions can change over time), causing the estimates that are learned offline to become stale. To address these challenges, we propose a fully online approach to solve the dynamic vehicle routing problem (DVRP) with time windows and stochastic trip requests that is robust to changing environmental dynamics by construction. We focus on scenarios where requests are relatively sparse—our problem is motivated by applications to paratransit services. We formulate DVRP as a Markov decision process and use Monte Carlo tree search to evaluate actions for any given state. Accounting for stochastic requests while optimizing a non-myopic utility function is computationally challenging; indeed, the action space for such a problem is intractably large in practice. To tackle the large action space, we leverage the structure of the problem to design heuristics that can sample promising actions for the tree search. Our experiments using real-world data from our partner agency show that the proposed approach outperforms existing state-of-the-art approaches both in terms of performance and robustness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Optimization under uncertainty of a hybrid waste tire and natural gas feedstock flexible polygeneration system using a decomposition algorithm

Market uncertainties motivate the development of flexible polygeneration systems that are able to adjust operating conditions to favor production of the most profitable product portfolio. However, this operational flexibility comes at the cost of higher capital expenditure. A scenario-based two-stage stochastic nonconvex Mixed-Integer Nonlinear Programming (MINLP) approach lends itself naturally to optimizing these trade-offs. This work studies the optimal design and operation under uncertainty of a hybrid feedstock flexible polygeneration system producing electricity, methanol, dimethyl ether, olefins or liquefied (synthetic) natural gas. A recently developed C++ based software framework (named GOSSIP) is used for modeling the optimization problem as well as its efficient solution using the Nonconvex Generalized Benders Decomposition (NGBD) algorithm. Two different cases are studied: The first uses estimates of the means and variances of the uncertain parameters from historical data, whereas the second assesses the impact of increased uncertain parameter volatility. The value of implementing flexible designs characterized by the value of the stochastic solution (VSS) is in the range of 260–405 M$ for a scale of approximately 893 MW of thermal input. Increased price volatility around the same mean results in higher expected net present value and VSS as operational flexibility allows for asymmetric exploitation of price peaks.

42 ENGINEERING↗
DOE OSTI2020

Assessment of wind power scenario creation methods for stochastic power systems operations

Probabilistic scenarios of renewable energy production, such as wind, have been gaining popularity for use in stochastic variants of power systems operations scheduling problems, allowing for optimal decision-making under uncertainty. The quality of the scenarios has a direct impact on the value of the resulting decisions, but until now, methods for creating scenarios have not been compared under realistic operational conditions. Here, we compare the quality of scenario sets created using three different methods, based on a simulated re-enactment of stochastic day-ahead unit commitment and subsequent dispatch for a realistic test system. We create scenarios using a dataset of forecasted and actual wind power values, scaled to evaluate the effects of increasing wind penetration levels. We show that the choice of scenario set can significantly impact system operating cost, renewable energy use, and the ability of the system to meet demand. This result has implications for the ability of system operators to efficiently integrate renewable production into their day-ahead planning, highlighting the need for the use of performance-based assessments for scenario evaluation.

17 WIND ENERGY↗
DOE OSTI2024

Microgrid design and multi-year dispatch optimization under climate-informed load and renewable resource uncertainty

Microgrids are an increasingly popular solution to provide energy resilience in response to increasing grid dependency and the growing impacts of climate change on grid operations. However, existing microgrid models do not currently consider the uncertain and long-term impacts of climate change when determining a set of design and operational decisions to minimize long-term costs or meet a resilience threshold. In this paper, we develop a novel scenario generation method that accounts for the uncertain effects of (i) climate change on variable renewable energy availability, (ii) extreme heat events on site load, and (iii) population and electrification trends on load growth. Additionally, we develop a two-stage stochastic programming extension of an existing microgrid design and dispatch optimization model to obtain uncertainty-informed and climate-resilient energy system decisions that minimizes long-term costs. Use of sample average approximation to validate our two case studies illustrates that the proposed methodology produces high-quality solutions that add resilience to systems with existing backup generation while reducing expected long-term costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Stochastic Continuous-time Flexibility Scheduling and Pricing in Wholesale Electricity Markets

Large-scale integration of intermittent renewable energy sources (RES) is calling for additional flexibility resources as well as more advanced modeling and optimization techniques to account for the increasing uncertainty and variability in power systems operation. As the RES integration gains momentum, the magnitude and frequency of their variations increase, which may trigger ramping scarcity events in real-time power systems operation. This necessitates revisiting the present definition of power systems flexibility and reserve services to reflect their robustness and adequacy towards sub-interval variations of the load and RES, as well as adjusting the operation models to accommodate the new reserve services. This project took a fundamental approach and aimed at developing continuous-time scheduling and pricing model that accurately models the continuous-time variations of load and RES and efficiently deploys the ramping capability of flexible resources to compensate the sources of variability and uncertainty in the market. In this regard, this project pursued the following goals: Developing stochastic multi-fidelity continuous-time optimization models for scheduling of energy storage (ES) systems and flexible loads in wholesale energy markets; Developing the theory and practices of continuous-time locational marginal pricing for valuating energy storage systems and flexible loads in wholesale energy markets; Developing function space solution approach to convert the proposed stochastic multi-fidelity continuous-time optimization models into tractable mixed-integer linear optimization models; and Defining flexibility reserve as a new type of reserve in markets that would enable ultimate participation of energy storage devices in provision of services to compensate the variability and uncertainty of RES in electricity markets. This project successfully completed all five major tasks defined in the SOPO, and produced 8 high-impact journal papers, 6 conference papers, 3 published U.S. patents, and one web-based software for continuous-time operation optimization of power systems. The application of the proposed flexibility reserve and the stochastic multi-fidelity continuous-time operation scheduling models would modify the forward commitment and schedule of generating units, ES devices and flexible loads, and would line up the resources in such a way that the composition of available resources is better prepared to respond to the sub-hourly variations of the load and renewable resources in real-time operation. Therefore, this project paves the way to sustainable, reliable, and economic integration of renewable energy resources in power system, supporting the progress towards reaching the national targets on energy independence. Even if the proposed models offers a radically different point of view as compared to existing models, it does not alter fundamentally the architecture of power systems operations, nor the complexity of the scheduling problem, so the integration of this project in power systems is extremely practical.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Adaptive PID Gain Scheduling Control for Hydropower Turbine Using Neural CDE and Stochastic Distribution Shaping

This paper introduces a gain-scheduling PID controller design strategy for hydroturbine frequency control mode. This scheme first uses real data to learn the nonlinear dynamics of the hydroturbine using neural controlled differential equations and then perturbs the obtained nonlinear system at different equilibrium points, based on which a static output feedback adaptive dynamic programming algorithm is then used to optimize the PID gains for each equilibrium point. Moreover, a continuous-time version of stochastic distribution control is proposed to further fine-tune the optimized PID gains. Finally, the controller is obtained by implementing linear interpolation between the optimized PID control gains. The simulation results show that the proposed gain-scheduling PID controller can control a larger range of operation points compared with the given fixed PID controller and the baseline method. Compared with the given fixed PID controller, the proposed gain-scheduling PID controller can regulate hydroturbine frequency against disturbances induced by power-load variation with over 50% less overshoot for some operation points.

13 HYDRO ENERGY↗
DOE OSTI2026

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗