Table 5
The optimization results of different algorithms. 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. From the data shown in Table 5, the TMD of FSQGA is shortening by 1.46% to 4.65%. Thus, the drilling cost can be reduced by 1.46% to 4.65%. Moreover, FSQGA algorithm can reduce the running time significantly (from >2000 to 3.5 s).
Algorithm | FSQGA | NPSO | GA | hCSO | hBFO | PSO | ||||
---|---|---|---|---|---|---|---|---|---|---|
parameters | This design | Atashnezhad et al. (2014) | Shokir et al. (2004) | Wood (2016a) | Wood (2016b) | Shokir et al. (2004) | ||||
TMD (ft) | 14 807.5 | 15 023.6 | 15 496.7 | 15 023.600 | 15 024.071 | 15 141.54 | ||||
Runing time (s) | 3.5075 | 2251.5435 | 526 | 225 | 239 | 5.821944 | ||||
phi1 (°) | 13.74 | 10.0 | 13.92 | – | – | 10 | ||||
phi2 (°) | 42.6 | 40.0 | 40.02 | – | – | 40 | ||||
phi3 (°) | 92.47 | 90.0 | 90.05 | – | – | 90 | ||||
theta1 (°) | 276.02 | 270.0 | 280.1 | – | – | 270.06 | ||||
theta2 (°) | 277.51 | 280.0 | 280.1 | – | – | 270 | ||||
theta3 (°) | 272.65 | 275.953 | 280.1 | – | – | 274.4 | ||||
theta4 (°) | 336.03 | 331.545 | 332.4 | – | – | 337.75 | ||||
theta5 (°) | 330.83 | 340.0 | 332.3 | – | – | 330.69 | ||||
theta6 (°) | 355.86 | 355 | 332.5 | – | – | 357.68 | ||||
DD (ft) | 6775.44 | 7000 | 6804.37 | – | – | 7000 | ||||
DB (ft) | 10 091.58 | 10 200 | 10 004.48 | – | – | 10 200 | ||||
DKOP (ft) | 653.97 | 1000 | 987.975 | – | – | 787.66 | ||||
HD (ft) | 2500 | 2500 | 2500 | – | – | 2500 | ||||
Iteration | 200 | 200 | 500 | 500 | 250 | 200 |