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.