• Home
  • Search
  • Shortest Path Algorithm for Pore-scale Simulation of Water-alternating-gas Injection
  • Cite Icon5
  • https://doi.org/10.3997/2214-4609.20146359Copy DOI Icon

Shortest Path Algorithm for Pore-scale Simulation of Water-alternating-gas Injection

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

For simulation of three-phase flow processes, such as water-alternating-gas injection (WAG), accurate descriptions of the three-phase capillary pressures and relative permeabilities as functions of the phase saturations are essential. Instead of deriving these functions from experiments, which is very difficult, they may be obtained from pore-scale network simulations. During multiple injection processes, especially under mixed-wet conditions, isolated clusters of the three phases occur. These clusters may still be mobilized, even under the assumption of capillary-dominated flow, as part of so-called multiple displacement chains of adjacent clusters stretching from inlet to outlet of the model. To determine the most favourable displacement chain requires implementation of an efficient shortest path algorithm. For the present problem the distances or costs are the capillary entry pressures between the various phase clusters. Because these entry pressures can also be negative, so-called negative cost cycles arise, which invalidate traditional algorithms. Instead, we have implemented an efficient shortest path algorithm with negative cycle detection If negative cycles arise, the corresponding cyclic displacement chains are carried out before any linear displacement from inlet to outlet. Negative cost cycles correspond to spontaneous displacements, for which the prevailing invading phase pressure is higher than required. Additionally, and probably even more significant, the shortest path algorithm determines in principle the pressures of all phase clusters in the network. These pressures are in turn used in the accurate calculation of the three-phase entry pressures, as well as the film and layer volumes and conductances in pore corners. Some WAG network simulations in mixed-wet media have been carried out using the new algorithm to demonstrate the occurrence of long displacement chains and the much improved efficiency, also for increasing network sizes. A significant number of negative cycles occurred, but the corresponding displacement chains were short. Additionally, we have analysed the obtained values of the cluster pressures.

Similar Papers
  • Conference Article
  • Citations1

The Effect of Displacement History on Three-Phase Capillary Pressure and Relative Permeability Derived from Triangular Pore Cross Sections with Contact-Angle Hysteresis

  • Apr 22, 2006
  • SPE/DOE Symposium on Improved Oil Recovery
  • J O Helland +1
  • Conference Article
  • Citations1

Simulation of Three Phase Capillary Pressure Curves Directly in 2D Rock Images

  • Mar 26, 2013
  • Y Zhou +2
  • Research Article
  • Citations2

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem

  • Oct 28, 2014
  • Algorithmica
  • Matthew Williamson +2
  • Conference Article
  • Citations8

Autonomous routing algorithms for networks with wide-spread failures

  • Oct 01, 2009
  • Wajahat Khan +2
  • Research Article
  • Citations169

Negative-cycle detection algorithms

  • Jun 01, 1999
  • Mathematical Programming
  • Boris V Cherkassky +1
  • PDF
  • Research Article
  • Citations8

Shortest Path Algorithms for Pedestrian Navigation Systems

  • May 25, 2022
  • Information
  • Kyriakos Koritsoglou +3
  • Book Chapter
  • Citations2

Consistency of three-phase capillary entry pressures and pore phase occupancies

  • Jan 01, 2004
  • Developments in Water Science
  • M.I.J Van Dijke +1
  • Research Article
  • Citations3

On the negative cost girth problem in planar networks

  • Oct 08, 2015
  • Journal of Discrete Algorithms
  • Matthew Williamson +1
  • Book Chapter
  • Citations6

Balanced Multipath Source Routing

  • Jan 01, 2008
  • Shreyas Prasad +3
  • Conference Article
  • Citations3

Improved Route Selection Strategy Based on K Shortest Path

  • Jun 01, 2019
  • Guanghao Huang +3
  • Research Article
  • Citations180

Distributed energy-efficient cooperative routing in wireless networks

  • Oct 01, 2008
  • IEEE Transactions on Wireless Communications
  • Ahmed S Ibrahim +2
  • Research Article
  • Citations1

Enhanced bi-directional dynamic programming algorithm for the resource constrained shortest path problem

  • Jan 01, 2024
  • Transportation Research Procedia
  • Matteo Salani +2
  • Research Article
  • Citations45

New Polynomial Shortest Path Algorithms and Their Computational Attributes

  • Sep 01, 1985
  • Management Science
  • Fred Glover +3
  • Research Article
  • Citations2

Bridgeless Cuk PFC converter with full load range soft switching operation by using a simple auxiliary circuit

  • Dec 02, 2024
  • Computers and Electrical Engineering
  • Atefe Shameli +1
  • Research Article
  • Citations30

The time-dependent shortest path and vehicle routing problem

  • Aug 28, 2021
  • INFOR: Information Systems and Operational Research
  • Rabie Jaballah +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.