2004
DOI: 10.2516/ogst:2004018
|View full text |Cite
|
Sign up to set email alerts
|

A New Optimization Model for 3d Well Design

Abstract: Résumé -Nouveau modèle pour l'optimisation de la conception 3D des puits -Ce travail utilise un logiciel se servant d'un algorithme génétique pour déterminer la profondeur optimale de puits directionnels et horizontaux dans un espace 3D. Nous utilisons une fonction spécifique de pénalité, la mutation, les probabilités croisées et un critère de terminaison pour obtenir le minimum global de profondeur de forage. Ce minimum est atteint aux valeurs minimales du point de démarrage, de l'angle de forage et des taux … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(17 citation statements)
references
References 13 publications
0
17
0
Order By: Relevance
“…Using the FSQGA, the optimization result of TMD is 14 807.5 ft in optimal complexity wellbore trajectory. Running time of the algorithm is 3.5075 s. Using the FSQGA to optimal the TMD, it is improved greatly running efficiency of the algorithm and shortened sharply running time which is compared the algorithm optimization results with NPSO (Atashnezhad et al, 2014), GA (Shokir et al, 2004), hCSO (Wood, 2016a), hBFO (Wood, 2016b) and PSO (Shokir et al, 2004). Therefore, it not only enhances the real-time of optimal progress, drilling efficiency and success rate, but also reduces the drilling time and total drilling cost.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Using the FSQGA, the optimization result of TMD is 14 807.5 ft in optimal complexity wellbore trajectory. Running time of the algorithm is 3.5075 s. Using the FSQGA to optimal the TMD, it is improved greatly running efficiency of the algorithm and shortened sharply running time which is compared the algorithm optimization results with NPSO (Atashnezhad et al, 2014), GA (Shokir et al, 2004), hCSO (Wood, 2016a), hBFO (Wood, 2016b) and PSO (Shokir et al, 2004). Therefore, it not only enhances the real-time of optimal progress, drilling efficiency and success rate, but also reduces the drilling time and total drilling cost.…”
Section: Discussionmentioning
confidence: 99%
“…j is the number of casing section, j = 1, 2, 3. D 1 to D 5 are the calculated measured depths of specific segments of the wellbore trajectory (Shokir et al, 2004;Atashnezhad et al, 2014). The boundaries of variables are defined in Table A1 in the Appendix.…”
Section: Objective Function Of Optimal 3d Wellbore Trajectorymentioning
confidence: 99%
See 1 more Smart Citation
“…Generic algorithm utilizes three fundamental genetic operations of selection (by selecting two chromosomes according to their fitness. The two selected chromosomes are called parents), crossover (take a copy of the selected parents and apply a crossover operation on them, with a certain probability, to produce two new children), and mutation (after the crossover operation, the two children are produced and later mutated with a certain probability to produce two new children) (Shokir et al, 2004). These operations are used to adjust the chosen solutions and select the most suitable offspring to pass on to succeeding generations.…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Genetic programming (GP) is a recent development in the field of evolutionary algorithms which extends the classical genetic algorithms 17,18 to a symbolic optimization technique 19 . It is based on so called "tree representation''.…”
Section: Genetic Programmingmentioning
confidence: 99%