There is a great incentive for developing systematic approaches that effectively identify strategies for planning oilfield complexes. This paper proposes an MILP that relies on a reformulation of the model developed by Tsarbopoulou (UCL M.S. Dissertation, London, 2000). Moreover, a bilevel decomposition technique is applied to the MILP. A master problem determines the assignment of platforms to wells and a planning subproblem calculates the timing for fixed assignments. Furthermore, a heuristic search procedure that relies on the distance between platforms and wells is applied in order to reduce the search region. Results show that the decomposition approach using heuristic generates optimal solutions for instances of up to 500 wells and 25 platforms in 10 discrete time periods that otherwise could not be solved with a full-scale approach. One important feature regarding these instances is that they correspond to problems of real-world dimension.
Oilfield exploration; Integer programming; Discrete time; decomposition methods; Optimization
