One generalization of the traveling salesman problem

The salesman route planning problem with summed minimal along interaction the coute between the station pairs as the criterion.
The possibility of solving this problem by the dynamic method is proved. Applications of the model to planning the traffic routes, ranging and linear deployment of facilities are described.