IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v13y2020i16p4235-d399736.html
   My bibliography  Save this article

Water Intrusion Characterization in Naturally Fractured Gas Reservoir Based on Spatial DFN Connectivity Analysis

Author

Listed:
  • Pengyu Chen

    (The Research Institute of Petroleum Exploration and Development CNPC, Beijing 100083, China)

  • Mauricio Fiallos-Torres

    (Hildebrand Department of Petroleum and Geosystems Engineering, The University of Texas at Austin, Austin, TX 78712, USA
    Sim Tech LLC, Houston, TX 77494, USA)

  • Yuzhong Xing

    (The Research Institute of Petroleum Exploration and Development CNPC, Beijing 100083, China)

  • Wei Yu

    (Hildebrand Department of Petroleum and Geosystems Engineering, The University of Texas at Austin, Austin, TX 78712, USA
    Sim Tech LLC, Houston, TX 77494, USA)

  • Chunqiu Guo

    (The Research Institute of Petroleum Exploration and Development CNPC, Beijing 100083, China)

  • Joseph Leines-Artieda

    (Hildebrand Department of Petroleum and Geosystems Engineering, The University of Texas at Austin, Austin, TX 78712, USA)

  • Muwei Cheng

    (The Research Institute of Petroleum Exploration and Development CNPC, Beijing 100083, China)

  • Hongbing Xie

    (Sim Tech LLC, Houston, TX 77494, USA)

  • Haidong Shi

    (The Research Institute of Petroleum Exploration and Development CNPC, Beijing 100083, China)

  • Zhenyu Mao

    (Sim Tech LLC, Houston, TX 77494, USA)

  • Jijun Miao

    (Sim Tech LLC, Houston, TX 77494, USA)

  • Kamy Sepehrnoori

    (Hildebrand Department of Petroleum and Geosystems Engineering, The University of Texas at Austin, Austin, TX 78712, USA)

Abstract

In this study, the non-intrusive embedded discrete fracture model (EDFM) in combination with the Oda method are employed to characterize natural fracture networks fast and accurately, by identifying the dominant water flow paths through spatial connectivity analysis. The purpose of this study is to present a successful field case application in which a novel workflow integrates field data, discrete fracture network (DFN), and production analysis with spatial fracture connectivity analysis to characterize dominant flow paths for water intrusion in a field-scale numerical simulation. Initially, the water intrusion of single-well sector models was history matched. Then, resulting parameters of the single-well models were incorporated into the full field model, and the pressure and water breakthrough of all the producing wells were matched. Finally, forecast results were evaluated. Consequently, one of the findings is that wellbore connectivity to the fracture network has a considerable effect on characterizing the water intrusion in fractured gas reservoirs. Additionally, dominant water flow paths within the fracture network, easily modeled by EDFM as effective fracture zones, aid in understanding and predicting the water intrusion phenomena. Therefore, fracture clustering as shortest paths from the water contacts to the wellbore endorses the results of the numerical simulation. Finally, matching the breakthrough time depends on merging responses from multiple dominant water flow paths within the distributions of the fracture network. The conclusions of this investigation are crucial to field modeling and the decision-making process of well operation by anticipating water intrusion behavior through probable flow paths within the fracture networks.

Suggested Citation

  • Pengyu Chen & Mauricio Fiallos-Torres & Yuzhong Xing & Wei Yu & Chunqiu Guo & Joseph Leines-Artieda & Muwei Cheng & Hongbing Xie & Haidong Shi & Zhenyu Mao & Jijun Miao & Kamy Sepehrnoori, 2020. "Water Intrusion Characterization in Naturally Fractured Gas Reservoir Based on Spatial DFN Connectivity Analysis," Energies, MDPI, vol. 13(16), pages 1-37, August.
  • Handle: RePEc:gam:jeners:v:13:y:2020:i:16:p:4235-:d:399736
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/13/16/4235/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/13/16/4235/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    2. Benmadi Milad & Sayantan Ghosh & Roger Slatt & Kurt Marfurt & Mashhad Fahes, 2020. "Practical Aspects of Upscaling Geocellular Geological Models for Reservoir Fluid Flow Simulations: A Case Study in Integrating Geology, Geophysics, and Petroleum Engineering Multiscale Data from the H," Energies, MDPI, vol. 13(7), pages 1-27, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    2. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    3. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    4. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
    5. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    6. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    7. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    8. Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.
    9. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    10. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    11. Alessandra Griffa & Mathieu Mach & Julien Dedelley & Daniel Gutierrez-Barragan & Alessandro Gozzi & Gilles Allali & Joanes Grandjean & Dimitri Ville & Enrico Amico, 2023. "Evidence for increased parallel information transmission in human brain networks compared to macaques and male mice," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    12. Qiang Tu & Han He & Xiaomin Lai & Chuan Jiang & Zhanji Zheng, 2024. "Identifying Critical Links in Degradable Road Networks Using a Traffic Demand-Based Indicator," Sustainability, MDPI, vol. 16(18), pages 1-20, September.
    13. T. Gomes & J. Craveirinha & L. Jorge, 2010. "An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 394-414, April.
    14. Zhou, Bo & Eskandarian, Azim, 2006. "A Non-Deterministic Path Generation Algorithm for Traffic Networks," 47th Annual Transportation Research Forum, New York, New York, March 23-25, 2006 208047, Transportation Research Forum.
    15. Baṣak Altan & Okan Örsan Özener, 2021. "A Game Theoretical Approach for Improving the Operational Efficiencies of Less-than-truckload Carriers Through Load Exchanges," Networks and Spatial Economics, Springer, vol. 21(3), pages 547-579, September.
    16. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    17. Yücel, E. & Salman, F.S. & Arsik, I., 2018. "Improving post-disaster road network accessibility by strengthening links against failures," European Journal of Operational Research, Elsevier, vol. 269(2), pages 406-422.
    18. Liu, Zhaocai & Chen, Zhibin & He, Yi & Song, Ziqi, 2021. "Network user equilibrium problems with infrastructure-enabled autonomy," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 207-241.
    19. Noruzoliaee, Mohamadhossein & Zou, Bo, 2022. "One-to-many matching and section-based formulation of autonomous ridesharing equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 72-100.
    20. Azar Sadeghnejad-Barkousaraie & Rajan Batta & Moises Sudit, 2017. "Convoy movement problem: a civilian perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 14-33, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:13:y:2020:i:16:p:4235-:d:399736. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.