Combinatorial algorithms for construction of multiple delivery routes

Analytical solution of a general routing task includes the whole complex of conditions - from the cargo presence in departure points to minimization of transportation costs. The analysis of a route map structure is an important thing also. In this paper, we make attempt to make the general algorithm to search for all possible ways of cargo delivery to a given destination point. In this connection, it will be kept in mind all the combined variants and appropriate limits considering a shipment from one or more points.