This paper considers the so-called warehouse problem with both space and injection/withdrawal capacity limits. This is a foundational problem in the merchant management of assets for the storage of commodities, such as energy sources and natural resources. When the commodity spot price evolves according to an exogenous Markov process, this work shows that the optimal inventory-trading policy of a risk-neutral merchant is characterized by two stage and spot-price dependent basestock targets. Under some assumptions, these targets are monotone in the spot price and partition the available inventory and spot-price space in each stage into three regions, where it is, respectively, optimal to buy and inject, do nothing, and withdraw and sell. In some cases of practical importance, one can easily compute the optimal basestock targets. The structure of the optimal policy is nontrivial because in each stage the merchant's qualification of high (selling) and low (buying) commodity prices in general depends on the merchant's inventory availability. This is a consequence of the interplay between the capacity and space limits of the storage asset and brings to light the nontrivial nature of the interface between trading and operations. A computational analysis based on natural gas data shows that mismanaging this interface can yield significant value losses. Moreover, adapting the merchant's optimal trading policy to the spot-price stochastic evolution has substantial value. This value can be almost entirely generated by reacting to the unfolding of price uncertainty, that is, by sequentially reoptimizing a model that ignores this source of uncertainty.inventory, production, policies, dynamic programming, Markov, finance, asset pricing, real options, industries, petroleum, natural gas

The valuation of the real option to store natural gas is a practically important problem that entails dynamic optimization of inventory trading decisions with capacity constraints in the face of uncertain natural gas price dynamics. Stochastic dynamic programming is a natural approach to this valuation problem, but it does not seem to be widely used in practice because it is at odds with the high-dimensional natural gas price evolution models that are widespread among traders. According to the practice-based literature, practitioners typically value natural gas storage heuristically. The effectiveness of the heuristics discussed in this literature is currently unknown because good upper bounds on the value of storage are not available. We develop a novel and tractable approximate dynamic programming method that, coupled with Monte Carlo simulation, computes lower and upper bounds on the value of storage, which we use to benchmark these heuristics on a set of realistic instances. We find that these heuristics are extremely fast to execute but significantly suboptimal compared to our upper bound, which appears to be fairly tight and much tighter than a simpler perfect information upper bound; computing our lower bound takes more time than using these heuristics, but our lower bound substantially outperforms them in terms of valuation. Moreover, with periodic reoptimizations embedded in Monte Carlo simulation, the practice-based heuristics become nearly optimal, with one exception, at the expense of higher computational effort. Our lower bound with reoptimization is also nearly optimal, but exhibits a higher computational requirement than these heuristics. Besides natural gas storage, our results are potentially relevant for the valuation of the real option to store other commodities, such as metals, oil, and petroleum products.

The paper considers the single vehicle routing problem with stochastic demands. While most of the literature has studied the a priori solution approach, this work focuses on computing a reoptimization-type routing policy. This is obtained by sequentially improving a given a priori solution by means of a rollout algorithm. The resulting rollout policy appears to be the first computationally tractable algorithm for approximately solving the problem under the reoptimization approach. After describing the solution strategy and providing properties of the rollout policy, the policy behavior is analyzed by conducting a computational investigation. Depending on the quality of the initial solution, the rollout policy obtains 1% to 4% average improvements on the a priori approach with a reasonable computational effort.

No abstract

We consider the vehicle routing problem with stochastic demands (VRPSD) under reoptimization. We develop and analyze a finite-horizon Markov decision process (MDP) formulation for the single vehicle case, and establish a partial characterization of the optimal policy. We also propose a heuristic solution methodology for our MDP, named partial reoptimization, based on the idea of restricting attention to a subset of all the possible states and computing an optimal policy on this restricted set of states. We discuss two families of computationally efficient partial reoptimization heuristics and illustrate their performance on a set of instances with up to and including 100 customers. Comparisons with an existing heuristic from the literature and a lower bound computed with complete knowledge of customer demands show that our best partial reoptimization heuristics outperform this heuristic and are on average no more than 10-13% away from this lower bound, depending on the type of instances.