Abstract
Consideration was given to the problem of optimal design of the field pipeline network for oil collection and transportation. The object was described; the problem was formulated; and the formulations of extremal problems were presented. A numerical method of solution was proposed on the basis of the universal procedure of determining the spanning trees of the edge-weighted graph arranged in the nondecreasing order of their lengths. The method was illustrated by a numerical example.
Similar content being viewed by others
REFERENCES
Babich, O.A. and Pershin, O.Yu., A Method for Calculating the Optimal Variants of Surface Communication Networks at the Stage of Planning Investments into Exploitation of an Oil Deposit. I, Avtom. Telemekh., 1996, no. 11, pp. 105-113.
Babich, O.A. and Pershin, O.Yu., A Method for Calculating the Optimal Variants of Surface Communication Networks at the Stage of Planning Investments into Exploitation of an Oil Deposit. II, Avtom. Telemekh., 1996, no. 12, pp. 109-123.
Pershin, O.Yu., Design of the Shortest Connecting Networks under Additional Conditions, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2000, no. 1, pp. 113-119.
Christofides, N., Graph Theory. An Algorithmic Approach, New York: Academic, 1975. Translated under the title Teoriya grafov. Algoritmicheskii podkhod, Moscow: Mir, 1978.
Spravochnoe rukovodstvo po proektirovaniyu razrabotki i ekspluatatsii neftyanykh mestorozhdenii. Dobycha nefti (Manual for Designing Development and Exploitation of Oil Deposits. Oil Extraction), Gimautdinov, Sh.K., Ed., Moscow: Nedra, 1983.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Babich, O.A., Pershin, O.Y. & Mushtonin, A.V. A Method to Design a Hierarchical Network of Field Pipelines by Solving a Sequence of Extremal Problems. Automation and Remote Control 64, 806–814 (2003). https://doi.org/10.1023/A:1023671023567
Issue Date:
DOI: https://doi.org/10.1023/A:1023671023567