Investigation of a Stochastic Optimization Method for Automatic History Matching of SAGD Processes
Notice bibliographique
Résumé
Abstract Western Canada has large reserves of heavy crude oil and bitumen. The Steam Assisted Gravity Drainage (SAGD) process, which couples a steam-based in-situ recovery method to horizontal well technology, has emerged as an economic and efficient way to produce the shallow heavy oil reservoirs in Western Canada. Numerical reservoir simulation allows the ideal way of predicting reservoir performance under a SAGD process. However, prior to the prediction phase, integration of production data into the reservoir model by means of history matching is the key stage in the numerical simulation workflow. Therefore, research and developments on efficient history matching techniques is encouraged. In this paper an automated technique to assist in the history-matching phase of a numerical flow simulation study for a SAGD process is implemented. The developed technique is based on a global optimization method known as Simultaneous Perturbation Stochastic Approximation (SPSA). This technique is easy to implement, robust with respect to non-optimal solutions, can be easily parallel zed and has shown an excellent performance for the solution of complex optimization problems in different fields of science and engineering. The reservoir parameters are estimated at reservoir scale by solving an inverse problem. At each iteration, selected reservoir parameters are adjusted. Then, a commercial thermal reservoir simulator is used to evaluate the impact of these new parameters on the field production data. Finally, after comparing the simulated production curves to the field data, a decision is made to keep or reject the altered parameters tested. A Matlab code coupled with a reservoir simulator is implemented to use the SPSA technique to study the optimization of a SAGD process. A synthetic case that considers average reservoir and fluid properties present in Alberta heavy oil reservoirs is presented to highlight the advantages and disadvantages of the technique. Introduction The Simultaneous Perturbation Stochastic Approximation (SPSA) methodology[1] has been implemented in optimization problems in a variety of fields with excellent performance. This paper mainly features production data integration into reservoir modeling for Steam Assisted Gravity Drainage (SAGD) processes by automatic history matching with SPSA. Essentially, automatic history matching problems turn out to be an optimization process, which can be translated into finding the minimum of an objective function. As one of the most important aspects related to the overall efficiency of an optimization methodology, the efficient determination of the gradient of the objective function cannot be omitted. For some cases, it is easy to obtain the gradient of the objective function and the application of ‘gradient-based’ methods for the solution of the optimization problem is usually the natural choice in these circumstances. However, for majority of practical problems, it is time-consuming and expensive to estimate the gradient of the objective function. The notion of ‘gradient-free’ ethods is introduced to overcome this problem. As a method in this category SPSA provides a powerful technique for automatic history matching. In this work, the objective function related to a synthetic SAGD case is defined for automatic history matching. The SPSA algorithm is implemented to improve the efficiency of the iterative procedure during the minimization phase.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».