Joint optimization of number of wells, well locations and controls using a gradient-based algorithm
•Well placement optimization is converted to a continuous optimization problem.•The number of wells, their locations and controls are optimized simultaneously.•The algorithm is based on adjoint gradient and it is very efficient.•The algorithm incorporates a procedure to honor BHP constraints of the...
Saved in:
Published in | Chemical engineering research & design Vol. 92; no. 7; pp. 1315 - 1328 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.07.2014
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | •Well placement optimization is converted to a continuous optimization problem.•The number of wells, their locations and controls are optimized simultaneously.•The algorithm is based on adjoint gradient and it is very efficient.•The algorithm incorporates a procedure to honor BHP constraints of the wells.•A procedure is devised for the algorithm to escape from a local maximum.
This paper presents a detailed algorithm for solving the general well-placement optimization problem in which the number of wells, their locations and rates are simultaneously optimized with an efficient gradient-based algorithm. The proposed well-placement optimization algorithm begins by placing a large number of wells in the reservoir, where, the well rates are the optimization variables. During iterations of the algorithm, most of the wells are eliminated by setting their rates to zero. The remaining wells and their controls determine the optimal number of wells, their optimum locations and rates. The well-placement algorithm consists of two optimization stages. In the initialization stage, the appropriate total reservoir production rate (or the total injection rate) for the set of to-be-optimized producers (or injectors) is estimated by maximizing the net-present-value for the specified operational life of the reservoir. In the second stage, a modified net-present-value functional which also considers the drilling cost of the wells is maximized subject to the a total rate constraint determined in the initialization stage. Both stages of the algorithm use gradient projection to enforce the linear and bound constraints, where the required gradients are computed with the adjoint method. The bottomhole pressure constraints on the wells are enforced using a practical approach. The applicability and robustness of our well-placement algorithm is discussed through several example problems. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
ISSN: | 0263-8762 1744-3563 |
DOI: | 10.1016/j.cherd.2013.11.006 |