Tracing of large branched pipeline
News of the Kabardin-Balkar scientific center of RAS, no. 4 (2023), pp. 39-54
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper deals with a tracing technique for large branched pipeline hydraulic networks of
the high optimality rank. The novelty of the method is that while increasing the optimization rank of the
designed networks, the redundant graph of possible connections between nodes is dynamically reduced.
In this case, the redundant graph of the follow-up rank is formed from previous networks rank. The
method provides a computer solution to the problem of tracing of large networks containing more than one
hundred nodes of the seventh optimality rank. The system is developed for large pipeline networks design
of regional and interregional pipe distribution network (PDN) for irrigation purpose.
Keywords:
pipeline flow network, computer design, tracing, dynamic graph of possible connections of
network nodes, dimension reduction, optimality rank increase.
@article{IZKAB_2023_4_a0,
author = {M. B. Abazokov and V. Ch. Kudaev},
title = {Tracing of large branched pipeline},
journal = {News of the Kabardin-Balkar scientific center of RAS},
pages = {39--54},
publisher = {mathdoc},
number = {4},
year = {2023},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IZKAB_2023_4_a0/}
}
M. B. Abazokov; V. Ch. Kudaev. Tracing of large branched pipeline. News of the Kabardin-Balkar scientific center of RAS, no. 4 (2023), pp. 39-54. http://geodesic.mathdoc.fr/item/IZKAB_2023_4_a0/