Universal Optimization Algorithm for Gas-condensate Gathering
Keywords:
Dynamic programming, gas-condensate, optimization taskAbstract
In this article we consider a solution of the condensate gathering optimization task when developing the gas-condensate field. As a feature of production control mathematical models appear nonlinear systems of equations that are irresolvable in an explicit form. This complicates the solutions of the optimization tasks significantly. In this article the optimization task was considered in the algebraic equations system being solved with an iterative method. The dynamic programming method was proposed to find out of optimal discrete choke diameters set, that provides the maximal condensate gathering with a restriction on gas production. In this work we evaluate the time advantage for discrete optimization task solution with the proposed method in comparison with the brute force method.References
Beggs H. D., Brill J. P. - A Study of Two Phase Flow in Inclined Pipes. JPT, 1973. p. 607 - 617.
Bellman R. Dynamic Programming. Princeton University Press, 1957. p. 340.
Cormen T., Leiserson C., Rivest R., Stein C. Introduction to Algorithms: second edition. MIT Press. 2002. p. 1296.
Fedorov K. M., Vershinin V. E. Mathematical model of operational management of a gas-condensate field. Neft' I Gaz. Tyumen State Oil and Gas University, vol. 3 (105), 2014. p. 77-83.
Marteno S., Toth P., Knapsack problems: algorithms and computer implementa¬tions. John Wiley & Sons. 1990. 306 p.
Muskat M. The flow of homogeneous fluids through porous media. McGraw-hill book company, Inc, 1937. 782p.
Downloads
Published
Issue
Section
License
Copyright © The Author(s). This article is published under the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.