Development of Methods for Supply Management in Transportation Networks under Conditions of Uncertainty of Transportation Cost Values

The problem of transport management in a distributed logistics system "suppliers – consumers" is considered. Under the assumption of a random nature of transportation costs, an exact algorithm for solving this problem by a probabilistic criterion has been developed. This algorithm is implemented by an iterative procedure for sequential improvement of the transportation plan. The rate of convergence of a computational procedure to an exact solution depends significantly on the dimension of the problem and is unacceptably low in real problems. In this regard, an alternative method is proposed, based on reducing the original problem to solving a nontrivial problem of fractional-nonlinear programming. A method for solving this problem has been developed and substantiated. The corresponding computational algorithm reduces the fractional-nonlinear model to the quadratic one. The resulting problem is solved by known methods. Further, the original problem is supplemented by considering a situation that is important for practice, when in the conditions of a small sample of initial data there is no possibility of obtaining adequate analytical descriptions for the distribution densities of the random costs of transportation. In this case, the available volume of statistical material is sufficient only to estimate the first two moments of unknown distribution densities. For this marginal case, a minimax method for finding the transportation plan is proposed. The first step is to solve the problem of determining the worst distribution density with the given values of the first two moments. In the second step, the transportation plan is found, which is the best in this most unfavorable situation, when the distribution densities of the random cost of transportation are the worst. To find such densities, let’s use the modern mathematical apparatus of continuous linear programming