Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.compchemeng.2013.04.002
Title: Optimal producer well placement and production planning in an oil reservoir
Authors: Tavallali, M.S.
Karimi, I.A. 
Teo, K.M. 
Baxendale, D.
Ayatollahi, S.
Keywords: Dynamic optimization
Mathematical programming
Oil production planning
Oil reservoir modeling
Optimal well placement
Issue Date: 8-Aug-2013
Citation: Tavallali, M.S., Karimi, I.A., Teo, K.M., Baxendale, D., Ayatollahi, S. (2013-08-08). Optimal producer well placement and production planning in an oil reservoir. Computers and Chemical Engineering 55 : 109-125. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compchemeng.2013.04.002
Abstract: Most of the available literature on optimal well placement has employed numerical simulators in a black box manner linked to an external search engine. In this work, we formulate the contents of that box inside a mixed integer nonlinear programming model for optimal well placement. We provide a unified model that integrates the subsurface, wells, and surface levels of an upstream production project. It links the production plan with the aforementioned elements, and economics and market. This results in a complex spatiotemporal mixed integer nonlinear model, for whose solution we modify and augment an existing outer approximation algorithm. The model solution provides the optimal number of new producers, their locations, and optimal production plan over a given planning horizon. To our knowledge, this is the first contribution that uses mathematical programming in a real dynamic sense by honoring the constituent partial differential equations. © 2013 Elsevier Ltd.
Source Title: Computers and Chemical Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/51798
ISSN: 00981354
DOI: 10.1016/j.compchemeng.2013.04.002
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.