使用聚类技术实现组合模型中组件的自动集总

M. Cancelliere, J. A. Saint Antonin
{"title":"使用聚类技术实现组合模型中组件的自动集总","authors":"M. Cancelliere, J. A. Saint Antonin","doi":"10.2118/212211-ms","DOIUrl":null,"url":null,"abstract":"\n Compositional simulation run times grow significantly as we increase the number of components used to characterize our fluid (SPE 69575). Therefore, having usable and practical models requires that we minimize the number of components without sacrificing prediction accuracy. In this paper we validate a novel approach that automates the compositional lumping as a part of the simulator pre-processing and allows quick evaluation of the impact on results and run-times of reducing the number of components in actual simulation runs.\n Different clustering techniques such as K-means or Agglomerative are applied on five different compositions from the literature which typically would require compositional modelling (gas condensate to volatile oil). The performance of these lumped compositions obtained from clustering are compared with an exhaustive brute-search lumping and the original full composition. These comparisons are made by simulating classical CCE & DLE or CVD lab experiments. The results are quantitatively assessed for proximity to the full composition simulation. With the techniques already validated, a preprocessor is developed that allows the user to input a full composition and set the number of components to be used for the run. These heuristic clustering techniques provide excellent results with minimal time. Although brute-force search may occasionally deliver marginally better outcomes, it does so at immense computational costs and any advantage vanishes after regression.\n To the best of our knowledge, advanced clustering techniques have not previously been applied to the problem of lumping as the industry has relied mostly on theoretical or empirical arguments to prescribe the lumping approach, to be carried out manually, with the occasional study on brute force search (SPE-170912). An additional novelty is to automate compositional lumping in the simulator preprocessor, allowing for accelerated validation of the lumping approach under the expected reservoir conditions. The speed and flexibility of the approach makes it an excellent practical option to test and scale the number of components used in compositional models.","PeriodicalId":225811,"journal":{"name":"Day 1 Tue, March 28, 2023","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Use of Clustering Techniques for Automated Lumping of Components in Compositional Models\",\"authors\":\"M. Cancelliere, J. A. Saint Antonin\",\"doi\":\"10.2118/212211-ms\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n Compositional simulation run times grow significantly as we increase the number of components used to characterize our fluid (SPE 69575). Therefore, having usable and practical models requires that we minimize the number of components without sacrificing prediction accuracy. In this paper we validate a novel approach that automates the compositional lumping as a part of the simulator pre-processing and allows quick evaluation of the impact on results and run-times of reducing the number of components in actual simulation runs.\\n Different clustering techniques such as K-means or Agglomerative are applied on five different compositions from the literature which typically would require compositional modelling (gas condensate to volatile oil). The performance of these lumped compositions obtained from clustering are compared with an exhaustive brute-search lumping and the original full composition. These comparisons are made by simulating classical CCE & DLE or CVD lab experiments. The results are quantitatively assessed for proximity to the full composition simulation. With the techniques already validated, a preprocessor is developed that allows the user to input a full composition and set the number of components to be used for the run. These heuristic clustering techniques provide excellent results with minimal time. Although brute-force search may occasionally deliver marginally better outcomes, it does so at immense computational costs and any advantage vanishes after regression.\\n To the best of our knowledge, advanced clustering techniques have not previously been applied to the problem of lumping as the industry has relied mostly on theoretical or empirical arguments to prescribe the lumping approach, to be carried out manually, with the occasional study on brute force search (SPE-170912). An additional novelty is to automate compositional lumping in the simulator preprocessor, allowing for accelerated validation of the lumping approach under the expected reservoir conditions. The speed and flexibility of the approach makes it an excellent practical option to test and scale the number of components used in compositional models.\",\"PeriodicalId\":225811,\"journal\":{\"name\":\"Day 1 Tue, March 28, 2023\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Day 1 Tue, March 28, 2023\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2118/212211-ms\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Day 1 Tue, March 28, 2023","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2118/212211-ms","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着用于表征流体特性的组件数量的增加,组合模拟运行时间显著增加(SPE 69575)。因此,拥有可用和实用的模型要求我们在不牺牲预测精度的情况下最小化组件的数量。在本文中,我们验证了一种新的方法,该方法将组合集总自动化作为模拟器预处理的一部分,并允许快速评估在实际模拟运行中减少组件数量对结果和运行时间的影响。不同的聚类技术,如K-means或Agglomerative应用于文献中的五种不同的成分,这些成分通常需要成分建模(凝析油到挥发油)。将聚类得到的集总组合的性能与穷举式暴力搜索集总和原始的完整组合进行了比较。这些比较是通过模拟经典CCE和DLE或CVD实验室实验进行的。结果是定量评估接近全组成模拟。随着技术的验证,开发了一个预处理器,允许用户输入完整的组合并设置要用于运行的组件数量。这些启发式聚类技术以最少的时间提供了极好的结果。尽管暴力搜索可能偶尔会产生稍微好一点的结果,但这样做的计算成本很高,任何优势在回归后都会消失。据我们所知,高级聚类技术以前没有应用于集总问题,因为业界主要依赖于理论或经验论点来规定集总方法,手动执行,偶尔研究蛮力搜索(SPE-170912)。另一个新颖之处是在模拟器预处理器中自动进行组合集总,从而在预期的油藏条件下加速集总方法的验证。该方法的速度和灵活性使其成为测试和扩展组合模型中使用的组件数量的极好的实用选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Use of Clustering Techniques for Automated Lumping of Components in Compositional Models
Compositional simulation run times grow significantly as we increase the number of components used to characterize our fluid (SPE 69575). Therefore, having usable and practical models requires that we minimize the number of components without sacrificing prediction accuracy. In this paper we validate a novel approach that automates the compositional lumping as a part of the simulator pre-processing and allows quick evaluation of the impact on results and run-times of reducing the number of components in actual simulation runs. Different clustering techniques such as K-means or Agglomerative are applied on five different compositions from the literature which typically would require compositional modelling (gas condensate to volatile oil). The performance of these lumped compositions obtained from clustering are compared with an exhaustive brute-search lumping and the original full composition. These comparisons are made by simulating classical CCE & DLE or CVD lab experiments. The results are quantitatively assessed for proximity to the full composition simulation. With the techniques already validated, a preprocessor is developed that allows the user to input a full composition and set the number of components to be used for the run. These heuristic clustering techniques provide excellent results with minimal time. Although brute-force search may occasionally deliver marginally better outcomes, it does so at immense computational costs and any advantage vanishes after regression. To the best of our knowledge, advanced clustering techniques have not previously been applied to the problem of lumping as the industry has relied mostly on theoretical or empirical arguments to prescribe the lumping approach, to be carried out manually, with the occasional study on brute force search (SPE-170912). An additional novelty is to automate compositional lumping in the simulator preprocessor, allowing for accelerated validation of the lumping approach under the expected reservoir conditions. The speed and flexibility of the approach makes it an excellent practical option to test and scale the number of components used in compositional models.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信