The Application of the k-shortest Paths Method for Constructing an Optimal Hypernet

Abstract

The utility networks optimization problem by the minimum construction cost criterion with a reliability constraint is considered. It is assumed that failures occur in the communication channels of the primary network, and the nodes in the secondary network must be connected reliably enough. An algorithm for building networks has been obtained, which can be applied in upgrading existing or designing new networks in accordance with the development and expansion plan of modern cities. In addition, the approximate algorithm proposed allows us to construct the cheapest network, taking into account its reliability.