The Repair Works Planning Problems in the Utility Networks Nodes

The results of the numerical experiments on location of the engineering network in a given area are presented. In this paper the task of delivering repair crews and carrying out repair work in networks nodes, in the form of a modified traveling salesman problem, was solved. In contrast to the classic traveling salesman problem, here the possibilities, firstly, the simultaneous use of more than one salesman, secondly, not only the costs of transporting repair crews from the production site to the engineering network nodes and back were taken into account network, but also the cost of repair work in the network nodes were considered. The results of the work by a numerical example demonstrate the effectiveness of the proposed approach, in comparison with the known models of transport routing are illustrated.

I. Introduction

The effectiveness of the functioning of engineering or transport networks, allowing transferring from one node to another some product largely depends on the timely maintenance of the elements of these networks. In other words, reliable and trouble-free exploitation of engineering networks is achieved through regular maintenance and repair work, or the replacement of individual nodes and lines of these networks. Therefore, it is very important to monitor its condition and timely spend repair work on the maintenance of elements of these systems. For this purpose, maintenance of networks is carried out, the purpose of which is to carry out a set of measures and works in respect of utility networks, allowing ensuring their reliable and trouble-free exploitation during the entire standard service life.