Javascript must be enabled to continue!
Optimizing Automatic History Matching for Field Application Using Genetic Algorithm and Particle Swarm Optimization
View through CrossRef
Abstract
History matching is a commonly used process that integrates a static model with dynamic data to obtain an accurate tool for predicting reservoir performance. Automatic History Matching (AHM) assisted by computers helps engineers control a large number of parameters efficiently to minimize a misfit compared to the traditional trial and error approach. However, effort is necessary to optimize the process of AHM to reduce simulation running time.
Stochastic algorithms such as the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) can be combined with the least squares single objective function to explore the parameter space. Parameterization and realization methods are employed to enhance the effectiveness of history matching. In this field study history matching was conducted while identifying the feasibility of each method. A number of realisations of various properties such as porosity, net to gross, relative permeability, horizontal and vertical permeability, and aquifer size were selected for controlling throughout the AHM. The optimized process is discussed to provide guidelines.
We found that stochastic algorithms are efficient at handling a large number of control parameters in heterogeneous reservoirs to improve the match. It was observed that GA was able to update a large number of control parameters. However, GA is a costly algorithm that requires more computing time. The realization and parameterization methods improved the accuracy of a full-field application although errors remained in predictions of the bottomhole pressure.
While simple relatively homogenous fields may be manually history matched, more complex fields require a good parameterization scheme. In addition we observed that selecting too many parameters makes the problem difficult to solve while selecting too few leads to false convergence.
In this study, we observed that the PSO had a shorter convergence time compared to the GA, Using the GA as a follow up method helped find better results. Overall this study can be used as a guideline in selecting an appropriate history matching method.
Title: Optimizing Automatic History Matching for Field Application Using Genetic Algorithm and Particle Swarm Optimization
Description:
Abstract
History matching is a commonly used process that integrates a static model with dynamic data to obtain an accurate tool for predicting reservoir performance.
Automatic History Matching (AHM) assisted by computers helps engineers control a large number of parameters efficiently to minimize a misfit compared to the traditional trial and error approach.
However, effort is necessary to optimize the process of AHM to reduce simulation running time.
Stochastic algorithms such as the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) can be combined with the least squares single objective function to explore the parameter space.
Parameterization and realization methods are employed to enhance the effectiveness of history matching.
In this field study history matching was conducted while identifying the feasibility of each method.
A number of realisations of various properties such as porosity, net to gross, relative permeability, horizontal and vertical permeability, and aquifer size were selected for controlling throughout the AHM.
The optimized process is discussed to provide guidelines.
We found that stochastic algorithms are efficient at handling a large number of control parameters in heterogeneous reservoirs to improve the match.
It was observed that GA was able to update a large number of control parameters.
However, GA is a costly algorithm that requires more computing time.
The realization and parameterization methods improved the accuracy of a full-field application although errors remained in predictions of the bottomhole pressure.
While simple relatively homogenous fields may be manually history matched, more complex fields require a good parameterization scheme.
In addition we observed that selecting too many parameters makes the problem difficult to solve while selecting too few leads to false convergence.
In this study, we observed that the PSO had a shorter convergence time compared to the GA, Using the GA as a follow up method helped find better results.
Overall this study can be used as a guideline in selecting an appropriate history matching method.
Related Results
Quantum Behaved Particle Swarm Optimization Algorithm Based on Artificial Fish Swarm
Quantum Behaved Particle Swarm Optimization Algorithm Based on Artificial Fish Swarm
Quantum behaved particle swarm algorithm is a new intelligent optimization algorithm; the algorithm has less parameters and is easily implemented. In view of the existing quantum b...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
Trajectory optimization of manipulator based on particle swarm optimization with mutation strategy
Trajectory optimization of manipulator based on particle swarm optimization with mutation strategy
Abstract
In order to solve the problems of slow convergence speed and low convergence accuracy of adaptive particle swarm algorithm, a particle swarm optimization algorithm...
2021 Census to Census Coverage Survey Matching Results.
2021 Census to Census Coverage Survey Matching Results.
The 2021 England and Wales Census was matched to the Census Coverage Survey (CCS). This was an essential requisite for estimating undercount in the Census. To ensure outputs could ...
Field Application Study on Automatic History Matching Using Particle Swarm Optimization
Field Application Study on Automatic History Matching Using Particle Swarm Optimization
Abstract
The traditional trial and error approach of history matching to obtain an accurate model requires engineers to control each uncertain parameter and can be q...
Topology Identification of Low-voltage Transformer Area Based on Improved Particle Swarm Algorithm
Topology Identification of Low-voltage Transformer Area Based on Improved Particle Swarm Algorithm
Abstract
With the continuous changes in the user-side power environment, the low-voltage distribution network has become more and more complex, which brings great ch...
Multi-objective Optimal Scheduling Analysis of Power System Based on Improved Particle Swarm Algorithm
Multi-objective Optimal Scheduling Analysis of Power System Based on Improved Particle Swarm Algorithm
Economic Environmental Dispatching (EED) in power systems is a multi-variable, strongly constrained, non-convex, multi-objective optimization problem that is difficult to properly ...

