«Proceedings of Gubkin University»

Automated determination method of gas pipeline optimal route from gas supply source to consumer

UDC: 622.691.4.07
DOI: 10.33285/2073-9028-2023-2(311)-109-117

Authors:

¹ National University of Oil and Gas “Gubkin University”, Moscow, Russian Federation

Keywords: graph algorithms, Dijkstra algorithm, Lee algorithm, Floyd – Warshall algorithm, Bellman – Ford algorithm, gas distribution systems, design automation, development of gas networks, design of gas distribution systems, gas supply problems

Annotation:

The paper presents a method for gas pipeline optimal route automated determination using the Dijkstra algorithm, taking into account the cost of construction of gas pipelines, the influence of soil type, the presence of obstacles, social and environmental consequences of the construction of the pipeline and other factors. The possibility of considering geographical features of the area and using machine-learning algorithms to optimize the pipeline route are investigated. Criteria for evaluating the optimality of the pipeline route are introduced, and the use of digital terrain model data and other big data is proposed. The paper analyzes of existing algorithms on graphs that allow solving the problems of choosing a gas pipeline route at the design stage, taking into account the terrain features. The proposed method allows reducing the costs of construction and operation of gas pipelines, improving the reliability and safety of gas distribution networks, as well as reducing the design time. The results of the study can be used to automate the process of designing gas pipelines when connecting new consumers.

Bibliography:

1. Formirovanie principov optimal’nogo razvitiya i funkcionirovaniya gazotransportnyh sistem/B.V. Budzulyak, D.N. Levitskij, A.S. Lopatin, A.S. Kuznechikov//Trudy Rossijskogo gosudarstvennogo universiteta nefti i gaza imeni I.M. Gubkina. – 2018. – № 4 (293). – S. 88–95.
2. Bolotnikova O.V., Tarasov D.V., Tarasov R.V. Linejnoe programmirovanie: transportnye i setevye modeli: uchebnoe posobie. – Penza: Izd-vo PGU, 2016. – 88 s.
3. Izotova T.Yu. Obzor algoritmov poiska kratchajshego puti v grafe//Novye informacionnye tekhnologii v avtomatizirovannyh sistemah. – 2016. – № 19. – S. 341–344.
4. Shortest Path Finding in Geographical Information Systems Using Node Combination and Dijkstra Algorithm/A. Fitro, O.S. Bachri, A.I.S. Purnomo, I. Frendianata//Int. J. Mech. Eng. Technol. – 2018. – Vol. 9. – P. 755–760.
5. Osnovnye polozheniya po proektirovaniyu i ekspluatacii gazoraspredelitel’nyh sistem: uchebnoe posobie/F.G. Tuhbatullin, I.V. Orekhova, D.S. Semejchenkov, I.V. Gladkov. – M.: RGU nefti i gaza (NIU) imeni I.M. Gubkina, 2020. – 106 s.
6. Nikolaev N.N. Modelirovanie transportnyh processov i sistem. Metodicheskie ukazaniya dlya vypolneniya kursovoj raboty. – Zernograd: FGOU VPO ACHGAA, 2009. – 70 s.
7. Mel’kumov V.N., Kuznecov I.S., Kuznecov R.N. Opredelenie optimal’nogo marshruta trassy gazoprovoda na osnove kart stoimosti vliyayushchih faktorov//Nauchnyj vestnik Voronezhskogo gosudarstvennogo arhitekturno-stroitel’nogo universiteta. Stroitel’stvo i arhitektura. – 2009. – № 13. – S. 21–27.
8. Da’ad Ahmad Albalawneh, Mohamad Afendee Mohamed. Evaluation of Using Genetic Algorithm and ArcGIS for Determining the Optimal-Time Path in the Optimization of Vehicle Routing Applications//Mathematical Problems in Engineering. – 2022. – Vol. 2022. – 20 p. – DOI: 10.1155/ 2022/7769951
9. Spektor N.Yu., Sarkisov A.S. Ocenka effektivnosti stroitel’stva gazoraspredelitel’nyh setej nizkogo davleniya//Problemy ekonomiki i upravleniya neftegazovym kompleksom. – 2016. – № 7. – S. 12–19.
10. Tim Rafgarden. Sovershennyj algoritm. Algoritmy dlya NP-trudnyh zadach. – SPb.: Piter, 2021. – 300 c.