1887
PDF

Abstract

Summary

Site screening is a critical step in Carbon Capture and Storage (CCS) projects, particularly in saline aquifers, where CO2 plume migration is influenced by reservoir heterogeneity. While classical methods like the Dykstra-Parsons index quantify heterogeneity, they do not focus on spatial arrangement of permeability contrasts, which significantly affect CO2 flow paths. To address this, we propose an interdisciplinary approach that integrates the Dijkstra algorithm, a computational tool widely used in solving shortest path problems, to map directed tortuosity in reservoirs.

By transforming a 2D reservoir grid into a graph, where nodes represent grid cells and edges represent permeability relationships, the Dijkstra algorithm identifies the shortest path from injection points to the reservoir top. This allows for a fast and effective evaluation of tortuosity, offering a computationally efficient alternative to traditional numerical simulations. The methodology highlights how spatially organized heterogeneities influence CO2 trapping mechanisms and provides valuable insights for site screening, well placement, and reservoir comparison in CCS projects.

This approach demonstrates the potential of combining classical reservoir characterization techniques with advanced computational algorithms to optimize CCS site evaluation and support energy transition initiatives.

Loading

Article metrics loading...

/content/papers/10.3997/2214-4609.202522084
2025-09-01
2026-02-13
Loading full text...

Full text loading...

/deliver/fulltext/2214-4609/2025/wccus/84.html?itemId=/content/papers/10.3997/2214-4609.202522084&mimeType=html&fmt=ahah

References

  1. Alexander P.Bump et al., [2023]. Composite confining systems: Rethinking geologic seals for permanent CO2 sequestration. International Journal of Greenhouse Gas Control, Volume 126.
    [Google Scholar]
  2. Dykstra, H., Parsons, R. [1950]. The Prediction of Oil Recovery by Water Flood. Secondary Recovery of Oil in the United States, 2nd ed. American Petroleum Institute 1950
    [Google Scholar]
  3. Dijkstra, E.W. [1959]. A Note on Two Problems in Connection with Graphs. Numerische Mathematik, vol. 1, pp. 269–271.
    [Google Scholar]
  4. F.Benjamin Zhan, Charles E.Noon. [1998]. Shortest Path Algorithms: An Evaluation Using Real Road Networks. Transportation Science32(1):65–73.
    [Google Scholar]
  5. M.Abderrahim, H.Hakim, H.Boujemaa and F.Touati. [2019]. Energy-Efficient Transmission Technique based on Dijkstra Algorithm for decreasing energy consumption in WSNs. 19th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA), 599–604. Sousse, Tunisia,pp.
    [Google Scholar]
  6. M.Luo, X.Hou and J.Yang. [2020]. Surface Optimal Path Planning Using an Extended Dijkstra Algorithm. IEEE Access, vol. 8.
    [Google Scholar]
  7. Madalimov, Medet, Li, Dachang, Saifutdinov, Raif, and YernazSatybaldiyev. [2023]. A Method of Reservoir Connectivity Analysis for Single- and Dual-Porosity/Dual-Permeability Models. Paper presented at the SPE Annual Technical Conference and Exhibition. San Antonio, Texas, USA.
    [Google Scholar]
  8. Schmalz, J. P. and Rahme, H. D. [1950]. The Variation of Waterflood Performance With Variation in Permeability Profile. Producer Monthly15 (9): 9–12.
    [Google Scholar]
  9. Shook, G. Michael, and Kameron M.Mitchell. [2009]. A Robust Measure of Heterogeneity for Ranking Earth Models: The F-PHI Curve and Dynamic Lorenz Coefficient. Paper presented at the SPE Annual Technical Conference and Exhibition. New Orleans, Louisiana.
    [Google Scholar]
/content/papers/10.3997/2214-4609.202522084
Loading
/content/papers/10.3997/2214-4609.202522084
Loading

Data & Media loading...

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error