scispace - formally typeset
Search or ask a question
Topic

Stochastic programming

About: Stochastic programming is a research topic. Over the lifetime, 12343 publications have been published within this topic receiving 421049 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The author considers a hidden Markov model where a single Markov chain is observed by a number of noisy sensors and designs algorithms for choosing dynamically at each time instant which sensor to select to provide the next measurement.
Abstract: The author considers a hidden Markov model (HMM) where a single Markov chain is observed by a number of noisy sensors. Due to computational or communication constraints, at each time instant, one can select only one of the noisy sensors. The sensor scheduling problem involves designing algorithms for choosing dynamically at each time instant which sensor to select to provide the next measurement. Each measurement has an associated measurement cost. The problem is to select an optimal measurement scheduling policy to minimize a cost function of estimation errors and measurement costs. The optimal measurement policy is solved via stochastic dynamic programming. Sensor management issues and suboptimal scheduling algorithms are also presented. A numerical example that deals with the aircraft identification problem is presented.

285 citations

Journal ArticleDOI
TL;DR: This study proposes a bi-objective mixed possibilistic, two-stage stochastic programming model to address supplier selection and order allocation problem to build the resilient supply base under operational and disruption risks.
Abstract: This study proposes a bi-objective mixed possibilistic, two-stage stochastic programming model to address supplier selection and order allocation problem to build the resilient supply base under operational and disruption risks. The model accounts for epistemic uncertainty of critical data and applies several proactive strategies such as suppliers’ business continuity plans, fortification of suppliers and contracting with backup suppliers to enhance the resilience level of the selected supply base. A five-step method is designed to solve the problem efficiently. The computational results demonstrate the significant impact of considering disruptive events on the selected supply base.

285 citations

Journal ArticleDOI
TL;DR: The stochastic vehicle routing problem, where each customer has a known probability of presence and a random demand, is considered and is solved for the first time to optimality by means of an integer L-shaped method.
Abstract: In this article, the following stochastic vehicle routing problem is considered. Each customer has a known probability of presence and a random demand. This problem arises in several contexts, e.g., in the design of less-than-truckload collection routes. Because of uncertainty, it may not be possible to follow vehicle routes as planned. Using a stochastic programming framework, the problem is solved in two stages. In a first stage, planned collection routes are designed. In a second stage, when the set of present customers is known, these routes are followed as planned by skipping the absent customers. Whenever the vehicle capacity is attained or exceeded, the vehicle returns to the depot and resumes its collections along the planned route. This generates a penalty. The problem is to design a first stage solution in order to minimize the expected total cost of the second state solution. This is formulated as a stochastic integer program, and solved for the first time to optimality by means of an integer L...

284 citations

Journal ArticleDOI
TL;DR: This paper proposes an efficient method to estimate the approximation error introduced by this rather drastic means of complexity reduction: it applies the linear decision rule restriction not only to the primal but also to a dual version of the stochastic program.
Abstract: Linear stochastic programming provides a flexible toolbox for analyzing real-life decision situations, but it can become computationally cumbersome when recourse decisions are involved. The latter are usually modeled as decision rules, i.e., functions of the uncertain problem data. It has recently been argued that stochastic programs can quite generally be made tractable by restricting the space of decision rules to those that exhibit a linear data dependence. In this paper, we propose an efficient method to estimate the approximation error introduced by this rather drastic means of complexity reduction: we apply the linear decision rule restriction not only to the primal but also to a dual version of the stochastic program. By employing techniques that are commonly used in modern robust optimization, we show that both arising approximate problems are equivalent to tractable linear or semidefinite programs of moderate sizes. The gap between their optimal values estimates the loss of optimality incurred by the linear decision rule approximation. Our method remains applicable if the stochastic program has random recourse and multiple decision stages. It also extends to cases involving ambiguous probability distributions.

282 citations

Journal ArticleDOI
TL;DR: This study presents an interval-parameter fuzzy two-stage stochastic programming (IFTSP) method for the planning of water-resources-management systems under uncertainty and demonstrates how the method efficiently produces stable solutions together with different risk levels of violating pre-established allocation criteria.

281 citations


Network Information
Related Topics (5)
Optimization problem
96.4K papers, 2.1M citations
86% related
Scheduling (computing)
78.6K papers, 1.3M citations
85% related
Optimal control
68K papers, 1.2M citations
84% related
Supply chain
84.1K papers, 1.7M citations
83% related
Markov chain
51.9K papers, 1.3M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023175
2022423
2021526
2020598
2019578
2018532