In this paper, we consider a multistage stochastic programming approach for the design and planning of an oilfield infrastructure over a planning horizon under gradual uncertainty resolution. The main uncertainties considered are in the sand quality, size of the reservoir and breakthrough time, which are represented by discrete distributions. Furthermore, it is assumed that these uncertainties are not immediately revealed but are revealed gradually as a function of design and operation decisions. In order to account for these uncertainties, we propose a multistage stochastic programming model that captures the complex economic objectives and nonlinear reservoir behaviour, and simultaneously optimizes the investment and operation decisions over the entire project horizon. Furthermore the model assumes discrete distribution functions and takes into account the fact that the resolution of uncertainty is decision dependent.
Specifically, we consider an oilfield consisting of a number of reservoirs where each reservoir contains several possible well sites. Some of these well sites have to be drilled and exploited for oil over a planning horizon. The oilfield infrastructure can be composed of Floating Production Storage and Offloading (FPSO) and/or Tension Leg Platform (TLP) facilities. There are two options for drilling wells. Each well can be drilled either as a sub-sea or as a TLP well. The aim of the model is to select the type, location of facilities, time to build them, select wells to drill, the time to drill each well, time to connect each well to the facilities, and production from the wells. The goal is to maximize the expected net present value of the project, calculated by revenues, capital and operating expenditures. In order to solve this difficult problem, we propose an aggregated problem in order to find the optimum number of wells to drill, facilities to build (instead of which well, facility to build) as well as timing of these decisions. This aggregate problem is a stochastic nonconvex mixed integer nonlinear model and can be solved by a duality-based branch and bound algorithm (Tarhan and Grossmann 2007) to give an upper bound on the optimal solution. The decision variables found from the aggregate model can be used in the original model to find the exact wells to drill or facilities to build. This feasible solution for the original problem is a lower bound for the problem. This iterative approach finds optimal solution in finite number of iterations. We describe results on several test problems to illustrate the capabilities of the proposed model.