基于优化的油藏模拟配井设施网络求解器

K. Wiegand, Y. Zaretskiy, K. Mukundakrishnan, L. Patacchini
{"title":"基于优化的油藏模拟配井设施网络求解器","authors":"K. Wiegand, Y. Zaretskiy, K. Mukundakrishnan, L. Patacchini","doi":"10.2118/203954-ms","DOIUrl":null,"url":null,"abstract":"\n When coupling reservoir simulators to surface network solvers, an often used strategy is to perform a rule or priority-driven allocation based on individual well and group constraints, augmented by back-pressure constraints computed periodically by the network solver. The allocation algorithm uses an iteration that applies well-established heuristics in a sequential manner until all constraints are met. The rationale for this approach is simply to maximize performance and simulation throughput; one of its drawbacks is that the computed allocation may not be feasible with respect to the overall network balance, especially in cases where not all wells can be choked individually. In the work presented here, the authors integrate the well allocation process into the network flow solver, in the form of an optimization engine, to ensure that the solution conforms to the network rate and pressure balance equations. Results for three stand-alone test cases are discussed.","PeriodicalId":11146,"journal":{"name":"Day 1 Tue, October 26, 2021","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Optimization-Based Facility Network Solver for Well Allocation in Reservoir Simulation\",\"authors\":\"K. Wiegand, Y. Zaretskiy, K. Mukundakrishnan, L. Patacchini\",\"doi\":\"10.2118/203954-ms\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n When coupling reservoir simulators to surface network solvers, an often used strategy is to perform a rule or priority-driven allocation based on individual well and group constraints, augmented by back-pressure constraints computed periodically by the network solver. The allocation algorithm uses an iteration that applies well-established heuristics in a sequential manner until all constraints are met. The rationale for this approach is simply to maximize performance and simulation throughput; one of its drawbacks is that the computed allocation may not be feasible with respect to the overall network balance, especially in cases where not all wells can be choked individually. In the work presented here, the authors integrate the well allocation process into the network flow solver, in the form of an optimization engine, to ensure that the solution conforms to the network rate and pressure balance equations. Results for three stand-alone test cases are discussed.\",\"PeriodicalId\":11146,\"journal\":{\"name\":\"Day 1 Tue, October 26, 2021\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Day 1 Tue, October 26, 2021\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2118/203954-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, October 26, 2021","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2118/203954-ms","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

当将油藏模拟器与地面网络求解器耦合时,一种常用的策略是根据单井和井群约束执行规则或优先级驱动的分配,并辅以网络求解器周期性计算的背压约束。分配算法使用迭代,以顺序的方式应用已建立的启发式,直到满足所有约束。这种方法的基本原理只是为了最大化性能和模拟吞吐量;它的一个缺点是,计算分配对于整个网络平衡来说可能不可行,特别是在并非所有井都可以单独堵塞的情况下。在本文中,作者将井分配过程以优化引擎的形式集成到网络流量求解器中,以确保解符合网络速率和压力平衡方程。讨论了三个独立测试用例的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Optimization-Based Facility Network Solver for Well Allocation in Reservoir Simulation
When coupling reservoir simulators to surface network solvers, an often used strategy is to perform a rule or priority-driven allocation based on individual well and group constraints, augmented by back-pressure constraints computed periodically by the network solver. The allocation algorithm uses an iteration that applies well-established heuristics in a sequential manner until all constraints are met. The rationale for this approach is simply to maximize performance and simulation throughput; one of its drawbacks is that the computed allocation may not be feasible with respect to the overall network balance, especially in cases where not all wells can be choked individually. In the work presented here, the authors integrate the well allocation process into the network flow solver, in the form of an optimization engine, to ensure that the solution conforms to the network rate and pressure balance equations. Results for three stand-alone test cases are discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Urban landscape and technical systems in the river valleys of the Right Bank of Ukraine Assessment of general and professional competences formation level by bachelors studying of specialty 101 Ecology Relief and geological structure of Vyzhnytskyi and Cheremoskyi national natural parks (Ukrainian Carpathians) Simulation of large-scale forest fire parameters Comparative characteristics of the land use structure for different types of territorial communities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1