Abstract

The problem of optimizing the transmission capacity of a pipeline network is important for ensuring its operability. The problem arises at different stages of the network life cycle (design, optimization, development). The problem is to determine the diameters of the pipelines, the locations of the pumps and the heads on them, the locations of the regulators (flow and pressure) and their parameters. The article proposes a new algorithm based on dynamic programming, which implements an original approach to organizing a computational procedure. The general principles of the algorithm and the content of its steps do not depend on the purpose of the network and the composition of its equipment. The algorithm is versatile and allows one to optimize networks for various purposes. The proposed algorithm is implemented in the IRNET software. On its basis, calculations were made for the development of real district heating systems.

Highlights

  • Among the design problems of energy pipeline systems the problem of optimizing the transmission capacity of the network is of particular importance

  • At ESI SB RAS, an iterative method has been developed for optimizing the parameters of looped pipeline networks [15, 3], which uses dynamic programming to optimize the network transformed into a tree

  • This paper presents an algorithm based on dynamic programming to optimize the transmission capacity of pipeline tree-like power networks of various types and purposes

Read more

Summary

Introduction

Among the design problems of energy pipeline systems the problem of optimizing the transmission capacity of the network is of particular importance. One of the basic principles of the theory of hydraulic circuits is that the methods and algorithms developed within this discipline must be versatile and able to be applied to calculate pipeline networks of various types and. At ESI SB RAS, an iterative method has been developed for optimizing the parameters of looped pipeline networks [15, 3], which uses dynamic programming to optimize the network transformed into a tree. This paper presents an algorithm based on dynamic programming to optimize the transmission capacity of pipeline tree-like power networks of various types and purposes. There is a separation of these models and algorithms, which become universal, and their software implementations can be reused for solving problems of pipeline system optimization of various types and purposes

Statement of the optimization problem
Optimization algorithm
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.