|
This article is cited in 3 scientific papers (total in 3 papers)
Computer modeling and design automation
Tracing of large branched pipeline
hydraulic networks of high optimality rank
with graph presentation
M. B. Abazokov, V. Ch. Kudaev Institute of Applied Mathematics and Automation –
branch of Kabardino-Balkarian Scientific Center of the Russian Academy of Sciences,
360000, Russia, Nalchik, 89 A Shortanov street
Abstract:
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.
Received: 26.07.2023 Revised: 03.08.2023 Accepted: 08.08.2023
Citation:
M. B. Abazokov, V. Ch. Kudaev, “Tracing of large branched pipeline
hydraulic networks of high optimality rank
with graph presentation”, News of the Kabardino-Balkarian Scientific Center of the Russian Academy of Sciences, 2023, no. 4, 39–54
Linking options:
https://www.mathnet.ru/eng/izkab709 https://www.mathnet.ru/eng/izkab/y2023/i4/p39
|
|