SPE 84191 MS (Well Placement)
SPE 84191 MS (Well Placement)
SPE 84191 MS (Well Placement)
Abstract
Determination of optimal well locations is a challenging task
because engineering and geologic variables affecting reservoir
performance are uncertain and they are often correlated in a
nonlinear fashion. This study presents an approach where a
hybrid optimization technique based on genetic algorithm,
with polytope algorithm as the helper method, was used in
determining optimal well locations. The Hybrid Genetic
Algorithm (HGA) has been shown to work on synthetic and
field examples alike. The HGA was used to optimize both
horizontal and vertical wells for both a gas injection and water
injection projects with net present value (NPV) maximization
as the objective.
Comparison of results was made between locations
proposed by the HGA and those selected by engineering
judgment. Results showed that horizontal wells performed
better than vertical wells from the recovery standpoint for the
synthetic reservoir. For a real reservoir, however, horizontal
wells performed only marginally better than the vertical wells
owing to low-kv/kh ratio. We also observed that optimal well
locations are a strong function of the anticipated project life.
A method of integrating the HGA with Experimental
Design (ED) was also investigated. For this purpose, a
synthetic reservoir was used and exhaustive runs were made
with increasing well count. In this particular case study, we
observed that the uncertainties in the variables affecting
recovery did not affect the optimal number of wells required
to develop this reservoir. Thus, forehand knowledge of the
well count eliminates the need for the inclusion of this process
variable in the ED matrix.
Introduction
The need for a well placement optimization tool cannot be
overemphasized because reservoir performance is highly
dependent on well locations. Determination of optimal well
locations cannot be based on intuitive judgment because
Methodology
To perform well placement optimizations, the HGA is coupled
with an in-house numerical simulator. The HGA comprises
GA, polytope algoritm, and a kriging proxy.
Genetic Algorithm. Genetic Algorithms are search algorithms
based on the mechanics of natural genetics and natural
selection.10 They used survival of the fittest concept
analogous to natural evolutionary mechanisms, combined with
a structured information exchange.10 In many optimization
methods, we move gingerly from a single point in the decision
space to the next using some transition rule to determine the
next point. This point-to-point method is dangerous because it
often locates false peaks in multimodal (many-peaked) search
spaces. By contrast, GAs work from a rich database of points
simultaneously (a population of strings), climbing many peaks
in parallel; thus, the probability of finding a false peak is
reduced over methods that go point to point. In every
generation, a new set of strings is created using bits and pieces
of the old; an occasional new part may be tried for
good measure.
GAs employ natural selection based on fitness, as well as
crossover for information exchange and mutation to introduce
further variety into the search. Thus, a simple genetic
algorithm is composed of three operators: reproduction,
crossover, and mutation.
Usefulness of the Helper Methods. The HGA utilizes
polytope algorithm and a kriging proxy as helper methods.
The use of a proxy requires a significant investment of runs
involving the numerical simulator. The magnitude of this
initial computational investment is unclear because this study
did not show much difference in the efficiency of the HGA
when the kriging option was turned off. Ideally, the proxy
should evolve intelligently as the GA iterates. However
Gyagler1 has shown in Fig. 1 that given sufficient number
of runs, the use of the proxy does reduce the actual number of
simulations and accelerates the optimization process.
300
250
N u m b e r o f S i m u l a ti o n s
SPE 84191
200
150
100
50
0
GA
GA+P
GA+P+NN
GA+P+K
GA+P+K+E
SPE 84191
1400
Optimize with kriging proxy
1300
NPV(MM$)
No
1200
Yes
Stop?
1100
Return best
10
20
30
40
50
Number of Simulations
Fig. 2 Flowchart of the Hybrid Genetic Algorithm.
Example Applications
Synthetic Reservoir
Case 1a. A gas-injection project with SPE-1 model was
optimized. The SPE-1 model is a 3D black-oil simulation
model used for the first SPE comparative solution study11 in
1981. This reservoir is a 10,000-ft 10,000-ft model, with 100
ft pay and is composed of three layers. The layers were
modeled using a 1010 grid making a total of 300 cells. All of
the cells are active, meaning that all of them are suitable
candidates for well completions. This synthetic reservoir is a
layer-cake model and the objective was to find optimal
locations for both an injector and a producer. Because the
answer was known beforehand, this model served as a way of
testing the capabilities of the HGA.
The producer and the injector were originally located at
(10,10,3) and (1,1,1), respectively. These default locations are
the best in terms of recovery and net present value, and was
also proven by the optimization approach. A population size
of 10 was used. The HGA found these locations at the second
iteration; that is, at the 17th call to the simulator, with the
SPE 84191
Table 1 Range of uncertainties for modified SPE-1.
Variable
kh
kv / kh
Producer
perforations
ZTRANS
p-10
0.5
0.1
Layer
3
0.0
p-50
1.0
1.0
Layers
2 and 3
2.0
p-90
2.0
1.1
Layers
2,3, 4
1.0
SPE 84191
Producer location
+ Injector location
SPE 84191
NO_PROD(Q)
XPERM(L)
I_COMP(Q)
W_LENGTH(Q)
I_COMP(L)
KVKH(Q)
KVKH(L)
XPERM(Q)
W_LENGTH(L)
NO_PROD(L)
Field Examples
Case 2. Reservoir-1. The second case is a water injection
project. The reservoir is unsaturated with an established oilwater contact. The reservoir was modeled as a 2305218
grid, with areal cell sizes of 50 m 50 m and an average
thickness of 2 ft. Of the 215,280 cells, only 172,203 cells were
active. Previous work12 on this reservoir using ED showed that
well count was the most important factor affecting oil
recovery as shown on the Pareto chart in
Fig. 8. This result
has since been verified by bringing well count outside of the
ED matrix and performing a three-level, partial-factorial
design with the other variables. Fig. 9 shows that the range of
uncertainty in the other variables does not significantly affect
reservoir performance. Having established this fact, we wished
to optimize well locations for this reservoir with all other input
variables at their p-50 level.
Previous work showed that 4 producers and 1 injector
would suffice for optimum development of this reservoir. All
the wells preselected during the initial ED study were
horizontal. Our objective was to find the optimum well
configuration for this reservoir based on NPV
maximization.Table 2 presents the parameters used for NPV
calculations. We started with vertical wells to see the impact
of well orientation on NPV and recovery. Thereafter, we
optimized well location configuration with all the wells being
horizontal, and compared our results to what we had before
the implementation of the HGA.
An independent study was done on the same reservoir
with a different optimization algorithm (Algorithm-2).5 The
objective was the same; that is, maximization of NPV. The
results for all the cases considered are discussed below.
SPE 84191
10
22
0
0.5
3
3
4
3.9
5.2
NPV
(MM
$)
Horiz
4 prod, 1inj
< 10
38.54
418
Vertical
Horiz
Horiz
Horiz
4 prod, 1inj
4 prod, 1inj
3 prod, 1inj
4 prod, 1inj
30
30
15
200
38.85
40.62
35.28
37.94
396
448
414
421
Eng.
Judg.
HGA
1,500
20
5.16
30. 79
Case 3. Reservoir-2. This reservoir is saturated with wellestablished fluid contacts, with an OOIP (original-oil-in-place)
Fig. 10 Comparison of the different approaches: HGA, Algorithm-2, and reservoir- engineering judgment. The blue region represents the
aquifer and the crosses are injector locations.
SPE 84191
Engineering
Judgment
HGA
Horizontal
Horizontal
Well H2
1.86
6.34
4.08
3.92
H1
H1-HGA
H2
H1
SPE 84191
Conclusions
A method for optimizing the NPV of a reservoir
development plan using the hybrid genetic algorithm is
presented. Within the limits of this investigation, the
following conclusions are made:
1. The hybrid genetic algorithm in combination with a
reservoir simulator is a powerful and useful tool for
determining optimal well locations.
2. Optimized number of wells and their locations are
not absolute. That is because optimization is
dependent on various process variables, such as the
selected completion interval, recovery process,
production and injection rates, and the project life.
3. The HGA is suitable for both new and existing
fields. For new field developments, the optimal
number of wells (producers and injectors) can be
established a priori, before invoking ED. That is
because the number of wells appears insensitive to
the range of input variables; that is, p-1, p-50, and
p-99 cases, for a given geologic model. On the
other hand, for a history-matched model, search for
additional infill opportunities may be made over a
selected area.
4. When compared to the conventional, ad-hoc
method of selecting well locations, the HGA turns
out to be a laborsaving tool for reservoir engineers.
However, experiences with the field examples
showed that the locations selected with engineering
judgment are quite comparable to those established
by the HGA, in terms of recovery or NPV.
Acknowledgments
We thank colleague Baris Gyagler for his various
assistances with his code. We express our gratitude to Burak
Yeten of Stanford U. for his contributions to the Reservoir-1
case study.
Many other colleagues provided logistical and
computational support, most notably Jason Lewis, Beverly
Pope, and Alan Bernath. We are grateful to the Nigeria/MidAfrica Business Unit of ChevronTexaco for encouragement
and support.
References
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.