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

HTML  Download Download as PDF (Size: 831KB)  PP. 59-73  
DOI: 10.4236/msce.2014.210009    5,559 Downloads   6,749 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.


Share and Cite:

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.

Copyright © 2024 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.