Forecast-based stochastic optimization for a load powered by wave energy
Not Available
Dillon, Trent (ORCID:0000000201036449)↗
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.
A Stochastic Gradient Descent Approach for Stochastic Optimal Control
In this work, we introduce a stochastic gradient descent approach to solve the stochastic optimal control problem through stochastic maximum principle. The motivation that drives our method is the gradient of the cost functional in the stochastic optimal control problem is under expectation, and numerical calculation of such an expectation requires fully computation of a system of forward backward stochastic differential equations, which is computationally expensive. By evaluating the expectation with single-sample representation as suggested by the stochastic gradient descent type optimisation, we could save computational efforts in solving FBSDEs and only focus on the optimisation task which aims to determine the optimal control process.
97 MATHEMATICS AND COMPUTING↗
Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)
Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.
97 MATHEMATICS AND COMPUTING↗
Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling
A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.
Moltex static salt reactor↗
Latency considerations for stochastic optimizers in variational quantum algorithms
Variational quantum algorithms, which have risen to prominence in the noisy intermediate-scale quantum setting, require the implementation of a stochastic optimizer on classical hardware. To date, most research has employed algorithms based on the stochastic gradient iteration as the stochastic classical optimizer. In this work we propose instead using stochastic optimization algorithms that yield stochastic processes emulating the dynamics of classical deterministic algorithms. This approach results in methods with theoretically superior worst-case iteration complexities, at the expense of greater per-iteration sample (shot) complexities. We investigate this trade-off both theoretically and empirically and conclude that preferences for a choice of stochastic optimizer should explicitly depend on a function of both latency and shot execution times.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗
Stochastic gradient descent algorithm for stochastic optimization in solving analytic continuation problems
We propose a stochastic gradient descent based optimization algorithm to solve the analytic continuation problem in which we extract real frequency spectra from imaginary time Quantum Monte Carlo data. The procedure of analytic continuation is an ill-posed inverse problem which is usually solved by regularized optimization methods, such like the Maximum Entropy method, or stochastic optimization methods. The main contribution of this work is to improve the performance of stochastic optimization approaches by introducing a supervised stochastic gradient descent algorithm to solve a flipped inverse system which processes the random solutions obtained by a type of Fast and Efficient Stochastic Optimization Method.
97 MATHEMATICS AND COMPUTING↗
Reliability-informed end-of-use decision making for product sustainability using two-stage stochastic optimization
The concept of circular economy has been diffused in recent decades to promote economic growth that does not add to the burden on natural resource extraction. Re-X options (e.g., reuse, repair, refurbish, remanufacture, recycle) have been gradually adopted in the product development process and optimized to reduce or eliminate waste and pollution. Although manufacturing incorporating Re-X options can be more environmentally friendly, it involves more sources of uncertainty than traditional manufacturing since the end-of-use products can be collected from multiple origins with various quantities and qualities, and the market demand for both new and remanufactured products cannot be forecasted perfectly. Thus, there is a need to optimize the Re-X policy to alleviate the negative impacts of the higher uncertainty. One option is using the reliability information of new products to estimate the end-of-use conditions and applying multi-stage stochastic optimization to capture multiple demand scenarios. This paper develops a two-stage stochastic optimization model to optimize the quality thresholds for reuse, recycling, and remanufacturing options. Our objective is to minimize the total cost, energy consumption, and environmental impact of producing and providing warranty service for a product family. The model employs reliability information of product components to estimate the warranty service cost and the end-of-use conditions of the returned resources. A case study on a general product family is implemented to illustrate the efficacy of the optimization model. Finally, results show that the two-stage optimization can achieve cost and environmental impact reduction for a hybrid manufacturing and remanufacturing process.
97 MATHEMATICS AND COMPUTING↗
Global stochastic optimization of stellarator coil configurations
In the construction of a stellarator, the manufacturing and assembling of the coil system is a dominant cost. These coils need to satisfy strict engineering tolerances, and if those are not met the project could be cancelled as in the case of the National Compact Stellarator Experiment (NCSX) project. Therefore, our goal is to find coil configurations that increase construction tolerances without compromising the performance of the magnetic field. In this paper, we develop a gradient-based stochastic optimization model which seeks robust stellarator coil configurations in high dimensions. In particular, we design a two-step method: first, we perform an approximate global search by a sample efficient trust-region Bayesian optimization; second, we refine the minima found in step one with a stochastic local optimizer. To this end, we introduce two stochastic local optimizers: BFGS applied to the sample average approximation; and Adam, equipped with a control variate for variance reduction. Numerical simulations performed on a W7-X-like coil configuration demonstrate that our global optimization approach finds a variety of promising local solutions at less than 0.1% of the cost of previous work, which considered solely local stochastic optimization.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
STOCHASTIC OPTIMIZATION FOR LONG TERM CAPITAL STRUCTURES, SYSTEMS, AND COMPONENTS REFURBISHMENT AND REPLACEMENT
As commercial nuclear power plants (NPPs) pursue extended plant operations in the form of Second License Renewals (SLRs), opportunities exist for these plants to provide capital investments to ensure long-term, safe, and economic performance. Several utilities have already announced their intention to pursue extended operations for one or more of their NPPs via SLR2. The goal of this research is to develop a riskinformed approach to evaluate and prioritize plant capital investments made in preparation for, and during the period of, extended plant operations to support decisions in NPP operations. In order to prioritize project selection via a riskinformed approach we developed a single decision-making tool that integrates safety/reliability, cost, and stochastic optimization models to provide users with data analysis capabilities to more cost effectively manage plant assets. Both stochastic analysis methods—such as Monte Carlo-based sampling strategies—and multi-stage stochastic optimization strategies are employed to provide priority lists to decisionmakers in support of risk-informed decisions. We applied the proposed method to a trial application of projected replacement/refurbishment expenditures for plant capital assets (i.e., Structures, Systems, and Components [SSCs]). The objective is to optimize the SSC replacement/refurbishment schedule in terms of economic constraints, data uncertainties, and SSC reliability data, as well to generate a priority list for maximizing returns on investment.
42 ENGINEERING↗
Derivative-free stochastic optimization via adaptive sampling strategies
In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.
Adaptive sampling↗
Stochastic Optimization and Uncertainty Quantification of Natrium-based Nuclear-Renewable Energy Systems for Flexible Power Applications in Deregulated Markets
Rapid integration of variable renewable energy sources (VRES) has made modeling and stochastic optimization of hybrid energy systems crucial for studying their long-term performance and viability. However, most studies have focused on just historical data, which may be unreliable for capturing short-term fluctuations, rare events, and long-term patterns of energy demand, price, and the variability of renewable energy sources. For this study, optimal synthetic time series models were developed using Wasserstein distance. The models were validated by comparing the key statistical measures against those of the historical data. They were then used to optimize the integrated Natrium-style advanced energy systems and their long-term (30 years) economics. The stochastic model performs bi-level optimization to find the optimal sizes for the balance of plant and thermal energy storage, while also optimizing energy dispatch to achieve the maximum net present value. In studies of two deregulated markets (California ISO and the Electric Reliability Council of Texas), the integrated Natrium-style system performed better in CAISO than in ERCOT, given higher and more consistent electricity prices during peak-demand periods. The potentially enlarged cost associated with the variable operation and maintenance of the TES system also plays a significant role in driving the system sizing, thus its impacts on the system are investigated in detail through comparison against a baseline case. The study also finds that the bi-level optimization results based on stochastic gradient descent closely match the grid search results. The uncertainty quantification of the stochastic signals provides further NPV-related insights and probability distributions for the case studies. The normal standard error of the mean of NPV for the case with and without TES VOM for CAISO were found to be 7.73M (plus-minus sign) 1.09M USD and 104.99M (plus-minus sign) 1.25M USD, respectively based on a 95% confidence. Given the relatively small NPV variance based on 150 samples, the analysis affords the most robust possible prediction of the techno-economic performance of the integrated Natrium-style energy systems.
25 ENERGY STORAGE↗
STOCHASTIC OPTIMAL POWER FLOW FOR REAL-TIME MANAGEMENT OF DISTRIBUTED RENEWABLE GENERATION AND DEMAND RESPONSE (Final Report)
To meet the grand challenge of a sustainable energy future, there has been a surge of interest in renewable energy. Today, the uncertainty associated with renewable resources is handled by using operating reserves. The high penetration of renewable resources, however, introduces difficult-to-control dynamics and challenges for power system operation. Decision support tools are necessary at the bulk system operational level to recognize and efficiently utilize renewable resources and distributed demand response products in concert with traditional grid resources. It is envisaged that responsive load can potentially have very significant cost advantages over either spinning or non-spinning ramping reserve. Critical decisions are made during hour(s)-ahead and real-time power system operation regarding the commitment and dispatch of generators to ensure power delivery is both reliable and economic. These decisions are typically made by a security constrained optimal flow, which determines future generator commitments, dispatches, and ensures adequate reserves are available in the event of a contingency (unexpected outage) or if future system conditions deviate from forecasts. However, security has been always based on a pre-specified subset of contingency constraints whose enforcement does not guarantee security under all possible future possibilities while also giving little or no weight to the likelihood of each contingent event or the severity of its consequences. Existing tools, which are based exclusively on deterministic optimization models, do not yield optimal operational decisions to address these new challenges, in terms of both reliability and cost-effectiveness. This project has focused on developing a stochastic optimal power flow (SOPF) framework, which integrates renewable resource uncertainty, load uncertainty, distributed storage (DS), demand response (DR) products, in a holistic manner to address the uncertainty associated with ever-increasing renewable resources, along with the inclusion of distributed demand response products in future power systems. A proof-of-concept problem was created using the Pennsylvania-Jersey-Maryland (PJM) power system network. Synthetic wind generation was added to the system to simulate 50% wind penetration. A 1-hour test of SOPF operation indicated more than 6% operational cost savings. The project continued by adding the Midwestern Independent System Operator (MISO) as a partner, with focus shifting from SOPF to Stochastic Look-Ahead Unit Commitment (SLAC). Unlike PJM, MISO is faced with significant renewable energy resources within its footprint and is challenged with substantial uncertainty in its operations. The SLAC distinguishes itself from existing tools that operators use. At best, today’s tools solve two to three cases independently, where one or two system parameters, such as forecasted load level (e.g., a low, base, and high forecast), are varied and the resulting scenarios are analyzed independently. The stochastic-based optimization of SLAC leverages statistical information from an ensemble of potential operational scenarios and their respective likelihood. The SLAC output can be translated into valuable information to the operator such as suggested commitments, optimal scheduling and dispatch of resources, reserve requirements at both locational and zonal resolutions, ramping availability and requirements, availability of demand response including operational guidance concerning the near-term and real-time coordination between distributed energy resources, and utilization of distributed storage resources. The developed SOPF/SLAC tool, a stand-alone tool compatible with existing EMSs, will provide system operators with unprecedented visibility, flexibility and predictability to these resources and operational guidance concerning the real-time coordination between DERs and DR/DS products. The game changing and practical impact of this disruptive technology will be dramatic and will usher in a new era in the electric power industry, wherein green energy concepts are fully embraced, and electric power costs are lowered throughout the nation.
42 ENGINEERING↗
Multistage Stochastic optimization for mid-term integrated generation and maintenance scheduling of cascaded hydroelectric system with renewable energy uncertainty
The uncertainties resulting from the escalating penetration of renewable energy resources pose severe challenges to the efficient operation of modern power systems. Hydroelectricity is characterized by its flexibility, controllability, and reliability, and thus becomes one of the most ideal energy resources to hedge against such uncertainties. This paper studies the mid-term integrated generation and maintenance scheduling of a cascaded hydroelectric system (CHS) consisting of multiple cascaded reservoirs and hydroelectric units. To precisely describe the mid-term water regulation policies, the hydraulic coupling relationship and water-energy nexus of CHS are incorporated into the proposed optimization model. The uncertainties of natural water inflow and the power outputs of wind/solar energy generation are taken into consideration and captured via a stochastic process modeled by a scenario tree. A multistage stochastic optimization (MSO) approach is developed to coordinate the complementary operations of multiple energy resources, by optimizing the mid-term water resource management, generation scheduling, and maintenance scheduling of CHS. The proposed MSO model is formulated as a large-scale mixed-integer linear program that presents significant computational intractability. To address this issue, a tailored Benders decomposition algorithm is developed. Two real-world case studies are conducted to demonstrate the capability and characteristics of the proposed model and algorithm. The computational results show that the proposed MSO model can exploit the flexibility of hydroelectricity to efficiently respond to variable wind and solar power, and reserve water resources for the generation in peak months to reduce the consumption of fossil fuel. Furthermore, the proposed solution approach also exhibits promising computational efficiency when handling large-scale models.
13 HYDRO ENERGY↗
An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints
The primary goal of this paper is to provide an efficient solution algorithm based on the augmented Lagrangian framework for optimization problems with a stochastic objective function and deterministic constraints. Our main contribution is combining the augmented Lagrangian framework with adaptive sampling, resulting in an efficient optimization methodology validated with practical examples. To achieve the presented efficiency, here we consider inexact solutions for the augmented Lagrangian subproblems, and through an adaptive sampling mechanism, we control the variance in the gradient estimates. Furthermore, we analyze the theoretical performance of the proposed scheme by showing equivalence to a gradient descent algorithm on a Moreau envelope function, and we prove sublinear convergence for convex objectives and linear convergence for strongly convex objectives with affine equality constraints. The worst-case sample complexity of the resulting algorithm, for an arbitrary choice of penalty parameter in the augmented Lagrangian function, is $\mathscr{O}$(ϵ -3-δ ) , where ϵ > 0 is the expected error of the solution and δ > 0 is a user-defined parameter. If the penalty parameter is chosen to be $\mathscr{O}$(ϵ -1 ), we demonstrate that the result can be improved to $\mathscr{O}$(ϵ -2 ) , which is competitive with the other methods employed in the literature. Moreover, if the objective function is strongly convex with affine equality constraints, we obtain $\mathscr{O}$(ϵ -1 log(1/ϵ)) complexity. Finally, we empirically verify the performance of our adaptive sampling augmented Lagrangian framework in machine learning optimization and engineering design problems, including topology optimization of a heat sink with environmental uncertainty.
97 MATHEMATICS AND COMPUTING↗