Graph theory applications to continuity and ranking in geologic models

被引:12
作者
Hirsch, LM [1 ]
Schuette, JF [1 ]
机构
[1] Exxon Prod Res Co, Houston, TX 77252 USA
关键词
graph theory; continuity; connectivity; geologic models; reservoirs;
D O I
10.1016/S0098-3004(98)00116-2
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Continuity of permeable and impermeable units strongly affects the flow simulation response in geologic media. Important factors include the size of permeable and impermeable bodies, their internal geometries, and whether they connect to injection and production wells at different stages of reservoir development. Most of the currently available analysis tools for geologic modeling cannot easily handle irregularities such as faults, onlap and truncations, or they are strongly limited in the dimensions of the models that are amenable to analysis. We adopt algorithmic graph theory for computationally efficient, continuity analysis. This method can treat irregularities in the geologic model including unstructured grids of unequal cell sizes. Geologic models are transformed from a cell-based representation to a node- and connection-based representation, where both nodes and area (connections) can have associated properties. Quantities such as connected components. maximum flow, shortest paths, minimum-cost paths and many other connectivity measures can be determined. These connectivity measures involve connections whose lengths or Values are weighted by reservoir parameters such as porosity and permeability. Because graph algorithms are efficient, connectivity can be rapidly evaluated for different wells that might become important during reservoir development. Graph theory algorithms can be applied to rank the anticipated flow performance of different geologic model realizations, to aid in delineating contiguous regions of similar character for use in upscaling, as well as to assess how well a scaled-up model preserves the continuity of the original detailed geologic model, (C) 1999 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:127 / 139
页数:13
相关论文
共 16 条
[1]  
Bland R. G., 1993, NETWORK FLOWS MATCHI, P119
[2]  
Chartrand G., 1985, INTRO GRAPH THEORY
[3]   Shortest paths algorithms: Theory and experimental evaluation [J].
Cherkassky, BV ;
Goldberg, AV ;
Radzik, T .
MATHEMATICAL PROGRAMMING, 1996, 73 (02) :129-174
[4]   SHORTEST-PATH ALGORITHMS - TAXONOMY AND ANNOTATION [J].
DEO, N ;
PANG, CY .
NETWORKS, 1984, 14 (02) :275-323
[5]  
DEUTSCH CV, 1994, P 69 ANN TECHN C EXH, P523
[6]  
DEUTSCH CV, 1996, P SPE DOE 10 S IMPR, P105
[7]  
EULER L, 1936, SCI AM, V189, P66
[8]  
Evans J.R., 1992, OPTIMIZATION ALGORIT, V2nd
[9]  
Ford L. R, 1962, FLOWS NETWORKS
[10]  
GALLO G, 1986, MATH PROGRAM STUD, V26, P38, DOI 10.1007/BFb0121087