On the Algorithm of Cargoes Transportation Scheduling in the Transport Network

The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion value is proposed in the problem under consideration. The algorithm is constructed on the base of solutions of mixed integer linear programming problems. The applicability of the algorithm is tested by the example with more than 90 million binary variables.