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 181 records · Page 10

Interval-parameter semi-infinite fuzzy-stochastic mixed-integer programming approach for environmental management under multiple uncertainties

In this study, an interval-parameter semi-infinite fuzzy-chance-constrained mixed-integer linear programming (ISIFCIP) approach is developed for supporting long-term planning of waste-management systems under multiple uncertainties in the City of Regina, Canada. The method improves upon the existing interval-parameter semi-infinite programming (ISIP) and fuzzy-chance-constrained programming (FCCP) by incorporating uncertainties expressed as dual uncertainties of functional intervals and multiple uncertainties of distributions with fuzzy-interval admissible probability of violating constraint within a general optimization framework. The binary-variable solutions represent the decisions of waste-management-facility expansion, and the continuous ones are related to decisions of waste-flow allocation. The interval solutions can help decision-makers to obtain multiple decision alternatives, as well as provide bases for further analyses of tradeoffs between waste-management cost and system-failure risk. In the application to the City of Regina, Canada, two scenarios are considered. In Scenario 1, the City's waste-management practices would be based on the existing policy over the next 25 years. The total diversion rate for the residential waste would be approximately 14%. Scenario 2 is associated with a policy for waste minimization and diversion, where 35% diversion of residential waste should be achieved within 15 years, and 50% diversion over 25 years. In this scenario, not only landfill would be expanded, but also CF and MRF would be expanded. Through the scenario analyses, useful decision support for the City's solid-waste managers and decision-makers has been generated. Three special characteristics of the proposed method make it unique compared with other optimization techniques that deal with uncertainties. Firstly, it is useful for tackling multiple uncertainties expressed as intervals, functional intervals, probability distributions, fuzzy sets, and their combinations; secondly, it has capability in addressing the temporal variations of the functional intervals; thirdly, it can facilitate dynamic analysis for decisions of facility-expansion planning and waste-flow allocation within a multi-facility, multi-period and multi-option context.

54 ENVIRONMENTAL SCIENCES↗

Dynamic Programming and Error Estimates for Stochastic Control Problems with Maximum Cost

This work is concerned with stochastic optimal control for a running maximum cost. A direct approach based on dynamic programming techniques is studied leading to the characterization of the value function as the unique viscosity solution of a second order Hamilton–Jacobi–Bellman (HJB) equation with an oblique derivative boundary condition. A general numerical scheme is proposed and a convergence result is provided. Error estimates are obtained for the semi-Lagrangian scheme. These results can apply to the case of lookback options in finance. Moreover, optimal control problems with maximum cost arise in the characterization of the reachable sets for a system of controlled stochastic differential equations. Some numerical simulations on examples of reachable analysis are included to illustrate our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-linear dynamic characteristics and optimal control of giant magnetostrictive film subjected to in-plane stochastic excitation

The non-linear dynamic characteristics and optimal control of a giant magnetostrictive film (GMF) subjected to in-plane stochastic excitation were studied. Non-linear differential items were introduced to interpret the hysteretic phenomena of the GMF, and the non-linear dynamic model of the GMF subjected to in-plane stochastic excitation was developed. The stochastic stability was analysed, and the probability density function was obtained. The condition of stochastic Hopf bifurcation and noise-induced chaotic response were determined, and the fractal boundary of the system's safe basin was provided. The reliability function was solved from the backward Kolmogorov equation, and an optimal control strategy was proposed in the stochastic dynamic programming method. Numerical simulation shows that the system stability varies with the parameters, and stochastic Hopf bifurcation and chaos appear in the process; the area of the safe basin decreases when the noise intensifies, and the boundary of the safe basin becomes fractal; the system reliability improved through stochastic optimal control. Finally, the theoretical and numerical results were proved by experiments. The results are helpful in the engineering applications of GMF.

36 MATERIALS SCIENCE↗

Optimization of Distribution Feeder Topology: A Differential Programming Learning Approach

This paper presents a gradient based method for optimizing distribution feeder network topology under load un- certainty. We recast the optimal network reconfiguration problem as a learning problem where edge weights of a graph are learned to produce an optimized spanning tree for a distribution network. Using recent methods published on differentiable programming, we provide a data driven method for learning these weights. We test our method on 100 variations of an IEEE 15-bus test system. Our results show that our method outperforms more traditional mathematical programming-based approaches.

differentiable programming↗

Real-time Ridesharing for Transportation Hubs with Demand and Supply Uncertainty

Transportation hubs in major cities generate a significant amount of trips by taxis and for-hail vehicles (FHV), with many of the trips sharing similar destinations. This suggests promising opportunities to leverage the collective travel needs with dedicated ridesharing solutions to reduce the externalities of excessive traffic at transportation hubs. In this study, we develop a novel dynamic ridesharing approach to serve trips from the transportation hub by considering (1) demand (new passengers) and supply (newly available vehicles) in the near future and (2) the uncertainty of future predictions. Our approach consists of two stages. In the first stage, we develop a data structure called hub mobility tree to generate potential combinations of shareable trips as candidate schedules efficiently. Then the generated schedules are used in the second stage to formulate the stochastic hub-based ridesharing problem (SHRP), which is a stochastic integer programming problem with the objective to maximize the total expected ridesharing profit over time. Due to the prohibitive number of shareable trips, we then approximately solve SHRP by the sample average approximate method (SAA), and a dual Lagrangian technique is implemented to further improve the scalability of the solution approach. We demonstrate the performances of the proposed method by simulating the ridesharing service at JFK airport using NYC taxi and FHV data. The results indicate that the proposed method outperforms the myopic ridesharing (maximize profit for a single time step) and the rolling horizon method with point estimation of future demand and supply.

dynamic ridesharing↗

Partner with a Third-Party Delivery Service or Not? A Prediction-and-Decision Tool for Restaurants Facing Takeout Demand Surges During a Pandemic

Amidst the COVID-19 pandemic, restaurants become more reliant on no-contact pick-up or delivery ways for serving customers. As a result, they need to make tactical planning decisions such as whether to partner with online platforms, to form their own delivery team, or both. In this paper, we develop an integrated prediction-decision model to analyze the profit of combining the two approaches and to decide the needed number of drivers under stochastic demand. We first use the susceptible-infected-recovered (SIR) model to forecast future infected cases in a given region and then construct an autoregressive-moving-average (ARMA) regression model to predict food-ordering demand. Using predicted demand samples, we formulate a stochastic integer program to optimize food delivery plans. We conduct numerical studies using COVID-19 data and food-ordering demand data collected from local restaurants in Nuevo Leon, Mexico, from April to October 2020, to show results for helping restaurants build contingency plans under rapid market changes. Our method can be used under unexpected demand surges, various infection/vaccination status, and demand patterns. Here, our results show that a restaurant can benefit from partnering with third-party delivery platforms when (i) the subscription fee is low, (ii) customers can flexibly decide whether to order from platforms or from restaurants directly, (iii) customers require more efficient delivery, (iv) average delivery distance is long, or (v) demand variance is high.

97 MATHEMATICS AND COMPUTING↗

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

97 MATHEMATICS AND COMPUTING↗

Stochastic level-set method for shape optimisation

We present a new method for stochastic shape optimisation of engineering structures. The method generalises an existing deterministic scheme, in which the structure is represented and evolved by a level-set method coupled with mathematical programming. The stochastic element of the algorithm is built on the methods of statistical mechanics and is designed so that the system explores a Boltzmann–Gibbs distribution of structures. In non-convex optimisation problems, the deterministic algorithm can get trapped in local optima: the stochastic generalisation enables sampling of multiple local optima, which aids the search for the globally-optimal structure. The method is demonstrated for several simple geometrical problems, and a proof-of-principle calculation is shown for a simple engineering structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of stochastic optimization to nuclear power plant asset management decisions

We describe the development and application of stochastic optimization models and algorithms to address an issue of critical importance in the strategic allocation of resources; namely, the selection of a portfolio of capital investment projects under the constraints of a limited and uncertain budget. This issue is significant and one that faces decision-makers across all industries. The objective of this strategic decision process is generally self evident - to maximize the value obtained from the portfolio of selected projects (with value usually measured in terms of the portfolio's net present value). However, heretofore, many organizations have developed processes to make these investment decisions using simplistic rule-based rank-ordering schemes. This approach has the significant limitation of not accounting for the (often large) uncertainties in the costs or economic benefits associated with the candidate projects or in the uncertainties in the actual funds available to be expended over the projected period of time. As a result, the simple heuristic approaches that typically are employed in industrial practice generate outcomes that are non-optimal and do not achieve the level of benefits intended. In this paper we describe the results of research performed to utilize stochastic optimization models and algorithms to address this limitation by explicitly incorporating the evaluation of uncertainties in the analysis and decision making process. (authors)

97 MATHEMATICS AND COMPUTING↗

Chance-Constrained Day-Ahead Hourly Scheduling in Distribution System Operation

This paper aims to propose a two-step approach for day-ahead hourly scheduling in a distribution system operation, which contains two operation costs, the operation cost at substation level and feeder level. In the first step, the objective is to minimize the electric power purchase from the day-ahead market with the stochastic optimization. The historical data of day-ahead hourly electric power consumption is used to provide the forecast results with the forecasting error, which is presented by a chance constraint and formulated into a deterministic form by Gaussian mixture model (GMM). In the second step, the objective is to minimize the system loss. Considering the nonconvexity of the three-phase balanced AC optimal power flow problem in distribution systems, the second-order cone program (SOCP) is used to relax the problem. Then, a distributed optimization approach is built based on the alternating direction method of multiplier (ADMM). The results shows that the validity and effectiveness method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Capacity Investment under Bayesian Information Updates at Reporting Periods: Model and Application

We consider capacity addition decisions by a new product manufacturer faced with uncertain technology alternatives. The manufacturing capacity addition and technology development occurs in parallel, with preliminary results from a technology project's success providing valuable information to the manufacturer in adding capacity. We solve a stochastic dynamic program with Bayesian updates to obtain the manufacturer's expected profit‐maximizing capacity investment decision. Our model and applications are motivated by the Critical Materials Institute (CMI) (funded by the Department of Energy), which manages research projects focused on mitigating critical material constraints, vital to renewable energy technologies such as direct‐drive wind turbines, electric vehicles, and energy‐efficient lighting. We capture three unique aspects of the problem: first, the learning from project progress depends on task‐based stochastic outcomes and a project's percent‐done. Second, the underlying technology's profitability is based on a model of competition. Third, we evaluate the impact of progress across a portfolio of projects based on a manufacturer's capacity addition. We develop a heuristic that produces results that are close to optimal and can thus be used for large problem sizes. The managerial insights from an application of our model to CMI projects include: (i) technology projects that report the percent‐done of a project earlier increase expected manufacturer profit; (ii) careful choice of “safe bets,” that is, technologies with low profitability but a high probability of success, can increase expected manufacturer profit; (iii) a portfolio of projects can increase profits significantly over separate project evaluation; and (iv) dynamic management of project resources can increase overall profit.

Vedantam, Aditya↗

Nodal capacity expansion planning with flexible large-scale load siting

We propose explicitly incorporating large-scale load siting into a stochastic nodal power system capacity expansion planning model that concurrently co-optimizes generation, transmission, and storage expansion. The potential operational flexibility of some of these large loads is also taken into account by considering them as consisting of a set of tranches with different reliability requirements, which are modeled as a constraint on expected served energy across operational scenarios. We implement our model as a two-stage stochastic mixed-integer optimization problem with cross-scenario expectation constraints. To overcome the challenge of scalability, we build upon existing work to implement this model on a high performance computing platform and exploit scenario parallelization using an augmented Progressive Hedging Algorithm. The algorithm is implemented using the bounding features of mpisppy, which have shown to provide satisfactory provable optimality gaps despite the absence of theoretical guarantees of convergence. We test our approach and assess the value of this proactive planning framework on total system cost and reliability metrics using realistic testcases geographically assigned to San Diego and South Carolina, with datacenter and direct air capture facilities as large loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗

Higher-moment buffered probability

In stochastic optimization, probabilities naturally arise as cost functionals and chance constraints. Unfortunately, these functions are difficult to handle both theoretically and computationally. The buffered probability of failure and its subsequent extensions were developed as numerically tractable, conservative surrogates for probabilistic computations. In this manuscript, we introduce the higher-moment buffered probability. Whereas the buffered probability is defined using the Conditional Value-at-Risk, the higher-moment buffered probability is defined using Higher-Moment Coherent Risk measures. In this way, the higher-moment buffered probability encodes information about the magnitude of tail moments, not simply the tail average. We prove that the higher-moment buffered probability is closed, monotonic, quasi-convex and can be computed by solving a smooth one-dimensional convex optimization problem. These properties enable smooth reformulations of both higher-moment buffered probability cost functionals and constraints.

97 MATHEMATICS AND COMPUTING↗

Does Risk Aversion Affect Transmission and Generation Planning? A Western North America Case Study

Here, we investigate the effects of risk aversion on optimal transmission and generation expansion planning in a competitive and complete market. To do so, we formulate a stochastic model that minimizes a weighted average of expected transmission and generation costs and their conditional value at risk (CVaR). We also show that the solution of this optimization problem is equivalent to the solution of a perfectly competitive risk-averse Stackelberg equilibrium, in which a risk-averse transmission planner maximizes welfare after which risk-averse generators maximize profits. Furthermore, this model is then applied to a 240-bus representation of the Western Electricity Coordinating Council, in which we examine the impact of risk aversion on levels and spatial patterns of generation and transmission investment. Although the impact of risk aversion remains small at an aggregate level, state-level impacts on generation and transmission investment can be significant, which emphasizes the importance of explicit consideration of risk aversion in planning models.

60 APPLIED LIFE SCIENCES↗

Parallel computing for power system climate resiliency: Solving a large-scale stochastic capacity expansion problem with mpi-sppy

Here we propose a nodal stochastic generation and transmission expansion planning model that incorporates the output from high-resolution global climate models through load and generation availability scenarios. We implement our model in Pyomo and perform computational studies on a realistically-sized test case of the California electric grid in a high performance computing environment. We propose model reformulations and algorithm tuning to efficiently solve this large problem using a variant of the Progressive Hedging Algorithm. We utilize the parallelization capabilities and overall versatility of mpi-sppy, exploiting its hub-and-spoke architecture to concurrently obtain inner and outer bounds on an optimal expansion plan. Initial results show that instances with 360 representative days on a system with over 8,000 buses can be solved to within 5% of optimality in under 4 h of wall clock time, a first step towards solving a large-scale power system expansion planning problem across a wide range of climate-informed operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗

A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem

An alternative to the production of fossil transportation fuels is the production of biofuels, particularly, bioethanol. One of the main opportunity areas is the reduction in the overall cost of biofuel. An approach to reduce this cost is to design and implement a supply chain (SC) that considers the quality-related properties of the biomass as well as the economies of scale to minimize the logistics and quality-related costs. This problem is formulated as a hub location problem, which has been classified as an NP-hard problem, thus, meta-heuristics are a suitable approach to solve this problem. We propose a hybrid meta-heuristic solution procedure to solve large-scale instances of a two-stage stochastic biomass-to-biorefinery hub-and-spoke network problem. This solution procedure is proposed to support the large-scale production and distribution of bioethanol by considering the variability in its moisture and ash contents. The hybrid method utilizes a simulated annealing-simplex method to find an initial solution and a tabu search-simplex method to improve the solution. Numerical experimentation was performed on a realistic case study in Texas. The findings demonstrate that the hybrid procedure outperforms the standard L-shaped (LS) method. The meta-heuristic combining simulated annealing and tabu search with the simplex method (SATS-SM) achieved 2.48% lower costs and required 96.57% less time, on average, when compared to the results from using the LS.

09 BIOMASS FUELS↗