Share This Article:

A Computational Comparison between Optimization Techniques for Wells Placement Problem: Mathematical Formulations, Genetic Algorithms and Very Fast Simulated Annealing

Abstract Full-Text HTML Download Download as PDF (Size:831KB) PP. 59-73
DOI: 10.4236/msce.2014.210009    3,155 Downloads   3,770 Views   Citations

ABSTRACT

This study considers several computational techniques for solving one formulation of the wells placement problem (WPP). Usually the wells placement problem is tackled through the combined efforts of many teams using conventional approaches, which include gathering seismic data, conducting real-time surveys, and performing production interpretations in order to define the sweet spots. This work considers one formulation of the wells placement problem in heterogeneous reservoirs with constraints on inter-well spacing. The performance of three different types of algorithms for optimizing the well placement problem is compared. These three techniques are: genetic algorithm, simulated annealing, and mixed integer programming (IP). Example case studies show that integer programming is the best approach in terms of reaching the global optimum. However, in many cases, the other approaches can often reach a close to optimal solution with much more computational efficiency.


Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

AlQahtani, G. , Alzahabi, A. , Spinner, T. and Soliman, M. (2014) A Computational Comparison between Optimization Techniques for Wells Placement Problem: Mathematical Formulations, Genetic Algorithms and Very Fast Simulated Annealing. Journal of Materials Science and Chemical Engineering, 2, 59-73. doi: 10.4236/msce.2014.210009.

References

[1] Wang, B. (2002) Well Site Selection Algorithm Considering Geological, Economical and Engineering Constraints. Thesis, University of Alberta.
[2] Gutteridge, P.A. and Gawith, D.E. (1996) Connected volume calibration for well-path ranking. EPOC'96: European Production Operations Conference.
[3] Deutsch, C.V. (1998) Fortran Programs for Calculating Connectivity of Three-Dimensional Numerical Models and for Ranking Multiple Realizations. Computers & Geosciences, 24, 69-76. http://dx.doi.org/10.1016/S0098-3004(97)00085-X
[4] Henery, F., Trimbitasu, T. and Johnson J. (2011) An Inte-grated Workflow for Reservoir Sweet Spot Identification. 2011 Gussow Geoscience Conference, Banff, Alber-ta.
[5] Vasantharajan, S. and Cullick, A.S. (1993) Well Site Selection Using Integer Programming. Proceedings of IAMG '97: Volume 1, pages 421-426. CIMNE.
[6] Talbi, E.G. (2009) Metaheuristics: From Design to Implementation (Vol. 74). John Wiley & Sons. http://dx.doi.org/10.1002/9780470496916
[7] Sen, M.K. and Stoffa, P.L. (1995) Global Optimization Methods in Geophysical Inversion. Elsevier.
[8] Emerick, A.A., et al. (2009) Well Placement Optimization Using a Genetic Al-gorithm with Nonlinear Constraints. SPE reservoir Simulation Symposium.
[9] AlQahtani, G., Vadapalli, R., Siddiqui, S. and Bhatta-charya, S. (2012) Well Optimization Strategies in Conventional Reservoirs. Proceedings of SPE Saudi Arabia Section Technical Symposium and Exhibition, Al-Khobar, 8-11 April 2012, 13 p. http://dx.doi.org/10.2118/160861-MS
[10] Ding, D.Y. (2008) Optimization of Well Placement Using Evolutionary Algorithms. SPE EUROPEC/EAGE Annual Conference and Exhibition, SPE. Vol. 113525.
[11] Bangerth, W., Klie, H., Wheeler, M.F., Stoffa, P.L. and Sen, M.K. (2006) On Optimization Algorithms for the Reservoir Oil Well Placement Problem. Computational Geosciences, 10, 303-319. http://dx.doi.org/10.1007/s10596-006-9025-7
[12] AlQahatani, G., Alzahabi, A., Kozyreff, E., de Farias Jr., I.R. and Soliman, M. (2013) A Comparison between Evolutionary Metaheuristics and Mathematical Optimization to Solve the Wells Placement Problem. Advances in Chemical Engineering and Science, Paper ID 3700353.

  
comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.