Algorithmic software of the optimization problem for cargo delivering by water transport

The paper considers the problem of constructing an optimal route of homogeneous cargo delivery from a family of producers to a family of consumers with the location of points on two riverbanks by a ship with limited capacity. Problems of this type arise, in particular, for the delivery of food and essential items to flood victims. The corresponding mathematical model is constructed. Several algorithms are suggested for solution of this problem (the exact algorithm of branch and bound, the greedy algorithm and two original heuristic algorithms that take into account the specific features of the problem). A computer experiment on simulated data was conducted using the developed software. A comparative analysis of the efficiency of the algorithms was conducted by the experiment. Heuristic algorithms make it possible to solve the problem with the number of points equal to 50.