首页 | 本学科首页   官方微博 | 高级检索  
     


Rapid Learning-Based and Geologically Consistent History Matching
Authors:Pejman Tahmasebi  Muhammad Sahimi  Mehrdad G. Shirangi
Affiliation:1.Department of Petroleum Engineering,University of Wyoming,Laramie,USA;2.Mork Family Department of Chemical Engineering and Materials Science,University of Southern California,Los Angeles,USA;3.Department of Energy Resources Engineering,Stanford University,Stanford,USA
Abstract:Various types of data become available at different stages of a reservoir’s life. The production data are integrated into the flow simulation models through a process referred to as history matching. The history-matching process is iterative, and it usually involves a large number of simulation runs. Hence, this process requires significant computational time. In most history-matching methods, the initial geological assumptions in the reservoir model are destroyed or significantly altered in the process. Furthermore, they do not account for the information obtained during the previous trials, and lack learning from the previous failures. In this paper, we introduce a new methodology that maintains the geological realism. The candidate realizations are selected through a learning-based history-matching (LHM) algorithm by which all the previously successful patterns are preserved and used to assist the construction of the next realizations. The various pieces of matching regions are assembled together to make a pool of the successful candidates. Such regions are then utilized for making an auxiliary dataset in a multiscale framework by which the next model is generated. To prevent from trapping in local minima, ideas from the genetic algorithm is adapted. The LHM algorithm can be applied to both categorical and continuous distributions. The LHM provides a conditional map by which the new production data are immediately incorporated into the existing reservoir models. We apply the LHM algorithm to various 2D and 3D examples with very complex binary and continuous properties. The algorithm is shown to produce history-matched models with significantly smaller CPU times.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号