2006
DOI: 10.1007/s10596-006-9025-7
|View full text |Cite
|
Sign up to set email alerts
|

On optimization algorithms for the reservoir oil well placement problem

Abstract: Determining optimal locations and operation parameters for wells in oil and gas reservoirs has a potentially high economic impact. Finding these optima depends on a complex combination of geological, petrophysical, flow regimen, and economical parameters that are hard to grasp intuitively. On the other hand, automatic approaches have in the past been hampered by the overwhelming computational cost of running thousands of potential cases using reservoir simulators, given that each of these runs can take on the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
137
1
2

Year Published

2008
2008
2018
2018

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 238 publications
(141 citation statements)
references
References 37 publications
1
137
1
2
Order By: Relevance
“…The constant a k is included to accelerate the convergence, and it depends on the expected maximum number of iterations, the expected step size, and the starting values of the optimization variables; ∆ k is the random perturbation vector (with dimension q), the components of which are independently generated following a Bernoulli (±1) distribution [25]; the constant c k is a positive number. More details about the values of the constants and on the generation of the perturbation vector are in [25].…”
Section: The Simultaneous Perturbation Stochastic Approximation Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The constant a k is included to accelerate the convergence, and it depends on the expected maximum number of iterations, the expected step size, and the starting values of the optimization variables; ∆ k is the random perturbation vector (with dimension q), the components of which are independently generated following a Bernoulli (±1) distribution [25]; the constant c k is a positive number. More details about the values of the constants and on the generation of the perturbation vector are in [25].…”
Section: The Simultaneous Perturbation Stochastic Approximation Methodsmentioning
confidence: 99%
“…More details about the values of the constants and on the generation of the perturbation vector are in [25].…”
Section: The Simultaneous Perturbation Stochastic Approximation Methodsmentioning
confidence: 99%
“…Based on the simultaneous perturbation idea, Spall further provided a second-order SPSA method, which estimates the Hessian matrix at each iteration. Later Bangerth et al (2006) described an integer SPSA method and used this modified SPSA method to solve well placement optimization problems. To the best of our knowledge, this is the first time that SPSA has been used in optimal control problems.…”
Section: Gradient-free Algorithmsmentioning
confidence: 99%
“…Examples include genetic algorithms (Goldberg, 1989;Güyagüler et al, 2000;Yeten et al, 2003), stochastic perturbation methods (Bangerth et al, 2006), and particle swarm optimization (Clerc, 2006;Onwunalu and Durlofsky, 2010;Echeverría Ciaurri et al, 2011b). Due to their random component, these search procedures can avoid being trapped in some unsatisfactory local optima.…”
Section: Well Placement Optimizationmentioning
confidence: 99%
“…Other approaches have mimicked a more traditional approach of computing finite differences. Bangerth et al (2006), e.g., uses stochastic perturbation of well location variables to obtain derivative information that may then be used within a standard solver. Complementary references can be found in Chapter 2.…”
Section: Well Placement Partmentioning
confidence: 99%