2020
DOI: 10.1016/j.advengsoft.2019.102767
|View full text |Cite
|
Sign up to set email alerts
|

A holistic review on artificial intelligence techniques for well placement optimization problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 60 publications
(24 citation statements)
references
References 100 publications
0
21
0
Order By: Relevance
“…[67]. Since the search relies entirely on a random search on (12), a faster convergence is not guaranteed. The proposed method presented here brings two changes to tackle the multimodal optimization problem, making it more practical for a range of applications without losing the attractive features of the original technique.…”
Section: Niching Crow Search Algorithm (Ncsa)mentioning
confidence: 99%
“…[67]. Since the search relies entirely on a random search on (12), a faster convergence is not guaranteed. The proposed method presented here brings two changes to tackle the multimodal optimization problem, making it more practical for a range of applications without losing the attractive features of the original technique.…”
Section: Niching Crow Search Algorithm (Ncsa)mentioning
confidence: 99%
“…Kaya and Zarrouk [ 31 ] point out that this approach can work and increase reservoir pressure after 10 years of steam production; however, increasing exploitation may affect steam production. New approaches such as artificial neural networks have begun to be used for reinjection well placement and optimization since the beginning of the 2000s [ 18 , 34 , 35 ].
Fig.
…”
Section: Importance Of Sustainable Development At Geothermal Power Symentioning
confidence: 99%
“…Assuming aforementioned notations for a uniform value, a t-way test suite generation problem can be written as, CA (N; t, v k ) where N is the test cases with t interaction strength for k number of parameters with v values. When t = 2, k = 4, and v = 3, the aforementioned expression can be rewritten as: CA(N; 2, 3 4 In our experiments, 16 different configurations combining both CA and MCA are taken into account similar to that of the earlier work in [58]: CA (N; 2, 3 4 ), CA(N; 2, 3 13 ), CA(N; 2, 10 10 ), CA(N; 2, 15 10 ), CA(N; 2, 5 10 ), CA(N, 2, 8 10 ), CA(N; 3, 3 6 ), CA(N; 3, 4 6 ), CA(N; 3, 5 6 ), CA(N; 3, 6 6 ), CA(N; 3, 5 7 ), CA (N; 3, 10 6 ), MCA(N; 2, 5 1 3 8 2 2 ), MCA(N; 2, 7 1…”
Section: B Combinatorial Test Suite Generationmentioning
confidence: 99%
“…An optimization problem refers to the problem of finding the best solution from a set of candidate solutions. Generally, an optimization algorithm exploits a mathematical function, called the objective function, which is often an extremum (either maximum or minimum) function for finding an optimal solution while satisfying a set of given constraints [1][2][3][4].…”
Section: Introductionmentioning
confidence: 99%