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
2014-12-15
Issue
Section
Articles
License
- Papers must be submitted on the understanding that they have not been published elsewhere (except in the form of an abstract or as part of a published lecture, review, or thesis) and are not currently under consideration by another journal published by any other publisher.
- It is also the authors responsibility to ensure that the articles emanating from a particular source are submitted with the necessary approval.
- The authors warrant that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required.
- The authors ensure that all the references carefully and they are accurate in the text as well as in the list of references (and vice versa).
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Attribution-NonCommercial 4.0 International that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
- The journal/publisher is not responsible for subsequent uses of the work. It is the author's responsibility to bring an infringement action if so desired by the author.
How to Cite
Universal Optimization Algorithm for Gas-condensate Gathering. (2014). Asian Journal of Applied Sciences, 2(6). https://ajouronline.com/index.php/AJAS/article/view/2087
