K. Wiegand, Y. Zaretskiy, K. Mukundakrishnan, L. Patacchini
{"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}
引用次数: 0
Abstract
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.