DESIGN OF TRAFFIC SCHEMES WITH A LIMIT OF THE NUMBER OF POINTS FOR LOT OF CARGO TRANSPORTATION FROM MULTIPLE BASES

The actual problem of choosing a rational scheme of movement from one and two bases when delivering cargo along circular routes with a limited number of unloading points is considered. The amount of cargo at the bases is not limited. The same quantity of goods is delivered to each point. The objective function is the minimum length of all routes. To solve the problem, an im-proved model of the method of fictitious nodes and branches has been developed, according to which the databases can be visited repeatedly. The fulfillment of restrictions on the number of vis-iting points is achieved by blocking branches with the maximum score on the decision tree. The proposed solution algorithm is demonstrated by a numerical example for three circular routes with three points in each.