RUS  ENG
Full version
JOURNALS // Vestnik KRAUNC. Fiziko-Matematicheskie Nauki // Archive

Vestnik KRAUNC. Fiz.-Mat. Nauki, 2025 Volume 52, Number 3, Pages 75–94 (Mi vkam699)

MATHEMATICAL MODELING

The method of rank bush optimization for the large branched stream networks with concave objective function

M. B. Abazokov

Institute of Applied Mathematics and Automation of the Kabardino-Balkar Scientific Center of RAS

Abstract: The design and optimization of large-scale branched stream networks for regional and interregional water supply is an urgent task due to the scarcity of water resources. Optimizing such networks is NP-complete “essentially-multi-extremality” problem. To solve this problem, the directly optimizing rankbased measures (P-optimization) was developed. The method is based on the principle of system optimality: “Every part of the optimal system is optimal (if the boundary conditions with the rest of the network are fixed)”. However, for large values of the rank P, this approach requires considerable computational time, since the computational time for solving the problem is exponential in rank P. In order to reduce the dimensionality of the problem, a method grounded on the bush optimization in the construction of the large-scale water distribution network with a high optimality rank has been developed and proposed. This technique restricts the solution search space and thus allows achieving the higher rankings. Thus, the designed approach associates each network vertex with a corresponding subgraph of the base graph (a bush). The subgraph is marked in the current spanning tree and has a certain dimensionality. The direct optimization applied to each bush provides a higher order of optimality than when it is applied to the entire network. At the same time, the total bush optimization time does not exceed the entire network optimization time. This paper proposes the method that provides to uniquely constructing a bush with a predetermined marginal number of vertexes. In addition, the developed method does not require specifying a range of the number of vertices; it only needs to specify a predetermined marginal number of bush vertices and the rank of optimization. The direct rank and bush optimization methods presented here are intended for use in the design and optimization of large-scale regional and interregional water distribution networks.

Keywords: large water distribution networks, structure optimization, ranks of extrema, rank optimization method, bush optimization method, computer-aided design, regional and interregional water distribution network, dimensionality reduction.

UDC: 519.85, 519.17

MSC: Primary 90C26; Secondary 05C21, 05C85

Received: 11.09.2025
Revised: 10.11.2025
Accepted: 28.10.2025

DOI: 10.26117/2079-6641-2025-52-3-75-94



© Steklov Math. Inst. of RAS, 2026