Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic programming”

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 253 records · Page 14

Cutting planes for the multistage stochastic unit commitment problem

As renewable energy penetration rates continue to increase in power systems worldwide, new challenges arise for system operators in both regulated and deregulated electricity markets to solve the security-constrained coal-fired unit commitment problem with intermittent generation (due to renewables) and uncertain load, in order to ensure system reliability and maintain cost effectiveness. In this paper, we study a security-constrained coal-fired stochastic unit commitment model, which we use to enhance the reliability unit commitment process for day-ahead power system operations. In our approach, we first develop a deterministic equivalent formulation for the problem, which leads to a large-scale mixed-integer linear program. Then, we verify that the turn on/off inequalities provide a convex hull representation of the minimum-up/down time polytope under the stochastic setting. Next, we develop several families of strong valid inequalities mainly through lifting schemes. In particular, by exploring sequence independent lifting and subadditive approximation lifting properties for the lifting schemes, we obtain strong valid inequalities for the ramping and general load balance polytopes. Lastly, branch-and-cut algorithms are developed to employ these valid inequalities as cutting planes to solve the problem. Our computational results verify the effectiveness of the proposed approach.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty

We introduce the problem of scheduling observations on a constellation of remote sensors, to maximize the aggregate quality of the collections obtained. While automated tools exist to schedule remote sensors, they are often based on heuristic scheduling techniques, which typically fail to provide bounds on the quality of the resultant schedules. To address this issue, we first introduce a novel deterministic mixed-integer programming (MIP) model for scheduling a constellation of one to n satellites, which relies on extensive pre-computations associated with orbital propagators and sensor collection simulators to mitigate model size and complexity. Our MIP model captures realistic and complex constellation-target geometries, with solutions providing optimality guarantees. We then extend our base deterministic MIP model to obtain two-stage and three-stage stochastic MIP models that proactively schedule to maximize expected collection quality across a set of scenarios representing cloud cover uncertainty. Our experimental conclusions on instances of one and two satellites demonstrate that our stochastic MIP models yield significantly improved collection quality relative to our base deterministic MIP model. We further demonstrate that commercial off-the-shelf MIP solvers can produce provably optimal or near-optimal schedules from these models in time frames suitable for sensor operations.

47 OTHER INSTRUMENTATION↗

Optimal guidance law in quantum mechanics

Following de Broglie’s idea of a pilot wave, this paper treats quantum mechanics as a problem of stochastic optimal guidance law design. The guidance scenario considered in the quantum world is that an electron is the flight vehicle to be guided and its accompanying pilot wave is the guidance law to be designed so as to guide the electron to a random target driven by the Wiener process, while minimizing a cost-to-go function. After solving the stochastic optimal guidance problem by differential dynamic programming, we point out that the optimal pilot wave guiding the particle’s motion is just the wavefunction Ψ(t,x), a solution to the Schrödinger equation; meanwhile, the closed-loop guidance system forms a complex state–space dynamics for Ψ(t,x), from which quantum operators emerge naturally. Quantum trajectories under the action of the optimal guidance law are solved and their statistical distribution is shown to coincide with the prediction of the probability density function Ψ{sup ∗}Ψ. -- Highlights: •Treating quantum mechanics as a pursuit-evasion game. •Reveal an interesting analogy between guided flight motion and guided quantum motion. •Solve optimal quantum guidance problem by dynamic programming. •Gives a formal proof of de Broglie–Bohm’s idea of a pilot wave. •The optimal pilot wave is shown to be a wavefunction solved from Schrödinger equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling Latently Infected Cell Activation: Viral and Latent Reservoir Persistence, and Viral Blips in HIV-infected Patients on Potent Therapy

Although potent combination therapy is usually able to suppress plasma viral loads in HIV-1 patients to below the detection limit of conventional clinical assays, a low level of viremia frequently can be detected in plasma by more sensitive assays. Additionally, many patients experience transient episodes of viremia above the detection limit, termed viral blips, even after being on highly suppressive therapy for many years. An obstacle to viral eradication is the persistence of a latent reservoir for HIV-1 in resting memory CD4+ T cells. The mechanisms underlying low viral load persistence, slow decay of the latent reservoir, and intermittent viral blips are not fully characterized. The quantitative contributions of residual viral replication to viral and the latent reservoir persistence remain unclear. In this paper, we probe these issues by developing a mathematical model that considers latently infected cell activation in response to stochastic antigenic stimulation. We demonstrate that programmed expansion and contraction of latently infected cells upon immune activation can generate both low-level persistent viremia and intermittent viral blips. Also, a small fraction of activated T cells revert to latency, providing a potential to replenish the latent reservoir. By this means, occasional activation of latently infected cells can explain the variable decay characteristics of the latent reservoir observed in different clinical studies. Finally, we propose a phenomenological model that includes a logistic term representing homeostatic proliferation of latently infected cells. The model is simple but can robustly generate the multiphasic viral decline seen after initiation of therapy, as well as low-level persistent viremia and intermittent HIV-1 blips. Using these models, we provide a quantitative and integrated prospective into the long-term dynamics of HIV-1 and the latent reservoir in the setting of potent antiretroviral therapy.

59 BASIC BIOLOGICAL SCIENCES↗

Viscosity Solutions for a System of Integro-PDEs and Connections to Optimal Switching and Control of Jump-Diffusion Processes

We develop a viscosity solution theory for a system of nonlinear degenerate parabolic integro-partial differential equations (IPDEs) related to stochastic optimal switching and control problems or stochastic games. In the case of stochastic optimal switching and control, we prove via dynamic programming methods that the value function is a viscosity solution of the IPDEs. In our setting the value functions or the solutions of the IPDEs are not smooth, so classical verification theorems do not apply.

97 MATHEMATICS AND COMPUTING↗

Near-Optimal Performance of Stochastic Model Predictive Control

Here, this article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative uncertainties. Under a finite support assumption, the problem can be cast as a finite-dimensional quadratic program, but the problem becomes quickly intractable as the problem size grows exponentially in the horizon length. SMPC aims to compute approximate solutions by solving a sequence of problems with truncated prediction horizons and committing the solution in a receding-horizon fashion. Although this approach is widely used in practice, its performance relative to the optimal solution is not well understood. This article reports for the first time a rigorous near-optimal performance guarantee of SMPC: under stabilizability and detectability conditions, the regret of SMPC is exponentially small in the prediction horizon length, allowing SMPC to achieve near-optimal performance at a substantially reduced computational expense.

93E20, 93B45↗

A stochastic biomass blending problem in decentralized supply chains

Blending biomass materials of different physical or chemical properties provides an opportunity to adjust the quality of the feedstock to meet the specifications of the conversion platform. We propose a model which identifies the right mix of biomass to optimize the performance of the thermochemical conversion process at the mini-mum cost. This is a chance-constraint programming (CCP) model which takes into account the stochastic nature of biomass quality. The proposed CCP model ensures that process requirements, which are impacted by physical and chemical properties of biomass, are met most of the time. We consider two problem settings, a centralized and a decentralized supply chain. We propose a mixed-integer linear program to model the blending problem in the centralized setting and a bilevel program to model the blending problem in the decentralized setting. We use the sample average approximation method to approximate the chance constraints, and propose solution algorithms to solve this approximation. We develop a case study for South Carolina using data provided by the Billion Ton Study. Based on our results, the blends identified consist mainly of pine and softwood residues. The blends identified and the suppliers selected by both models are different. The cost of the centralized supply chain is 2%–6% lower. The implications of these results are twofold. First, these results could lead to improved collaborations in the supply chain. Second, these results provide an estimate of the approximation error from assuming centralized decision making in the supply chain.

09 BIOMASS FUELS↗

Thermal Energy Storage Model Development within the Integrated Energy Systems Hybrid Repository

This publication details newly created energy storage models developed within the HYBRID Modelica repository as part of the Department of Energy Office of Nuclear Energy (DOE-NE) Integrated Energy Systems (IES) program, led by Idaho National Laboratory (INL). Model development to-date includes creation of dynamic systems-level models of concrete, latent heat, and packed-bed thermocline energy storage technologies for deployment in the IES-based HYBRID repository. Models are developed using the latest publicly available data and incorporate the possibility of control strategy inclusion for use with the existing IES modeling, analysis, and optimization toolset. Simulations showcase the abilities of each technology to cyclically charge and discharge when exposed to time-varying boundary conditions. In addition, low-level surrogate models for some of the thermal energy storage technologies were created using Python. These lower order Python files are much cheaper to run (i.e., computationally faster) and thus operate well when incorporated within the stochastic optimization problems run for the IES program. Moreover, economic data was collected for use within the INL-developed Framework for Optimization of ResourCes and Economics (FORCE). This information is incorporated within the FORCE platform. This work has resulted in creation of systems-level models for concrete, latent heat, and thermocline thermal energy storage systems with associated control systems. Now that these models are available, they can be utilized within different integrated energy park concepts to understand optimal system operation, control, and dispatching. Moreover, given the generic nature of the models, industrial partner technologies (e.g., Storworks Power, EnergyNest) can be quickly added to the repository using the existing models as a basis. Additional dynamic models for thermal energy storage concepts can be developed and added to the HYBRID repository as needed.

25 ENERGY STORAGE↗

Design of isolated renewable hybrid power systems

Isolated electrical power generating units can be used as an economically viable alternative to electrify remote villages where grid extension is not feasible. One of the options for building isolated power systems is by hybridizing renewable power sources like wind, solar, micro-hydro, etc. along with appropriate energy storage. A method to optimally size and to evaluate the cost of energy produced by a renewable hybrid system is proposed in this paper. The proposed method, which is based on the design space approach, can be used to determine the conditions for which hybridization of the system is cost effective. The simple and novel methodology, proposed in this paper, is based on the principles of process integration. It finds the minimum battery capacity when the availability and ratings of various renewable resources as well as load demand are known. The battery sizing methodology is used to determine the sizing curve and thereby the feasible design space for the entire system. Chance constrained programming approach is used to account for the stochastic nature of the renewable energy resources and to arrive at the design space. The optimal system configuration in the entire design space is selected based on the lowest cost of energy, subject to a specified reliability criterion. The effects of variation of the specified system reliability and the coefficient of correlation between renewable sources on the design space, as well as the optimum configuration are also studied in this paper. The proposed method is demonstrated by designing an isolated power system for an Indian village utilizing wind-solar photovoltaic-battery system. (author)

14 SOLAR ENERGY↗

Robust Reconfiguration of A Distribution System

In this paper, a robust reconfiguration approach based on Mixed Integer Programming (MIP) is proposed to minimize loss in distribution systems. A Depth-First Search (DFS) algorithm to enumerate possible loops provides radiality constraint. This provides a general solution to the radiality constraint for distribution system reconfiguration/expansion problems. Still, imprecision and ambiguity in net loads, i.e. load minus renewable generation, due to lack of sufficient measurements and high utilization of demand response programs and renewable resources, creates challenges for effective reconfiguration. Deterministic optimization of reconfiguration may no lead to optimal/feasible results. Two methods to address these uncertainties are introduced in this paper: one, based on a stochastic MIP (SMIP) formulation and two, based on a fuzzy MIP (FMIP) formulation. Case studies demonstrate the robustness and efficiency of the proposed reconfiguration methods.

Depth-First Search (DFS)↗

Stochastic Models for an Optimal Blending of Biomass under Cost, Quality and Uncertainty Considerations

Blending biomass materials of different physical or chemical properties provides an opportunity to passively adjust the quality of the feedstock to meet the specifications of the conversion platform. We propose a model which identifies the right mix of biomass to optimize the performance of the Thermochemical conversion process at the minimum cost. This is a chance-constraint programming (CCP) model which takes into account the stochastic nature of biomass availability and quality. The proposed CCP model takes as inputs the physical and chemical properties, and biomass availability. We use the sample average approximation (SAA) method to solve the problem. We develop a case study for South Carolina by using data provided by the Billion Ton Study. We conduct extensive numerical analysis to evaluate the quality of the solutions obtained.

09 BIOMASS FUELS↗

Latent Variable Network Modeling

lvnm Is a library for fitting latent variable network models within the R programming language. The code focuses on the Stochastic Block Model, Weighted Stochastic Block Model, and Dynamic Stochastic Block Model. Features include simulation methods, estimation methods, diagnostic plots and anomaly detection routines for network data.

Dabbs, Beau↗

A Coupled System of Integrodifferential Equations Arising in Liquidity Risk Model

We study the mathematical aspects of the portfolio/consumption choice problem in a market model with liquidity risk introduced in (Pham and Tankov, Math. Finance, 2006, to appear). In this model, the investor can trade and observe stock prices only at exogenous Poisson arrival times. He may also consume continuously from his cash holdings, and his goal is to maximize his expected utility from consumption. This is a mixed discrete/continuous time stochastic control problem, nonstandard in the literature. We show how the dynamic programming principle leads to a coupled system of Integro-Differential Equations (IDE), and we prove an analytic characterization of this control problem by adapting the concept of viscosity solutions. This coupled system of IDE may be numerically solved by a decoupling algorithm, and this is the topic of a companion paper (Pham and Tankov, Math. Finance, 2006, to appear)

97 MATHEMATICS AND COMPUTING↗

Simultaneous Measurements of Noncommuting Observables: Positive Transformations and Instrumental Lie Groups

We formulate a general program for describing and analyzing continuous, differential weak, simultaneous measurements of noncommuting observables, which focuses on describing the measuring instrument autonomously, without states. The Kraus operators of such measuring processes are time-ordered products of fundamental differential positive transformations, which generate nonunitary transformation groups that we call instrumental Lie groups. The temporal evolution of the instrument is equivalent to the diffusion of a Kraus-operator distribution function, defined relative to the invariant measure of the instrumental Lie group. This diffusion can be analyzed using Wiener path integration, stochastic differential equations, or a Fokker-Planck-Kolmogorov equation. This way of considering instrument evolution we call the Instrument Manifold Program. We relate the Instrument Manifold Program to state-based stochastic master equations. We then explain how the Instrument Manifold Program can be used to describe instrument evolution in terms of a universal cover that we call the universal instrumental Lie group, which is independent not just of states, but also of Hilbert space. The universal instrument is generically infinite dimensional, in which case the instrument’s evolution is chaotic. Special simultaneous measurements have a finite-dimensional universal instrument, in which case the instrument is considered principal, and it can be analyzed within the differential geometry of the universal instrumental Lie group. Principal instruments belong at the foundation of quantum mechanics. We consider the three most fundamental examples: measurement of a single observable, position and momentum, and the three components of angular momentum. As these measurements are performed continuously, they converge to strong simultaneous measurements. For a single observable, this results in the standard decay of coherence between inequivalent irreducible representations. For the latter two cases, it leads to a collapse within each irreducible representation onto the classical or spherical phase space, with the phase space located at the boundary of these instrumental Lie groups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sufficient Stochastic Maximum Principle in a Regime-Switching Diffusion Model

We prove a sufficient stochastic maximum principle for the optimal control of a regime-switching diffusion model. We show the connection to dynamic programming and we apply the result to a quadratic loss minimization problem, which can be used to solve a mean-variance portfolio selection problem.

97 MATHEMATICS AND COMPUTING↗

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↗

Comparison of Burnup Credit Uncertainty Quantification Methods

The recent revision of Interim Staff Guidance (ISG-8 revision 3), issued by the US Nuclear Regulatory Commission, on burnup credit for criticality safety analysis of pressurized water reactor spent fuel in transportation and storage casks expands the nuclides that can be credited in the fuel composition to include minor actinides and fission products. The technical basis for development of the uncertainties associated with calculated nuclide concentrations in spent nuclear fuel that are recommended in ISG-8 was established through the use of measured isotopic data acquired from destructive radiochemical assay data for spent fuel samples. These data provide a direct experimental basis for determining uncertainties in the calculated nuclide concentrations. To provide additional insight into code uncertainties resulting from nuclear data and also the level of conservatism associated with using experimental assay benchmark data for uncertainty evaluation, a new uncertainty analysis tool in the SCALE code system that performs stochastic sampling of nuclear data has been applied to representative burnup credit calculations for spent fuel pool and dry cask storage applications methodology. The nuclear data uncertainty analysis capabilities in Sampler can account for uncertainty contributions from cross sections, fission yields, and decay data by using correlated sampling of covariance files developed for all nuclear data used by SCALE. These uncertainties associated with nuclear data evaluations are compared to corresponding values developed in ISG-8 that are based on destructive assay data, as well as to values obtained using an alternate methodology that was developed by the Electric Power Research Institute based on reactor core simulation data.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗