A METHOD FOR SOLVING THE CANONICAL PROBLEM OF TRANSPORT LOGISTICS IN CONDITIONS OF UNCERTAINTY

Subject.The canonical task of transport logistics in the distributed system "suppliers - consumers" is considered. Goal. Development of an accurate algorithm for solving this problem according to the probabilistic criterion in the assumption of the random nature of transportation costs has been done. Tasks. 1. Development of an exact method for solving the problem of finding a plan that minimizes the total cost of transportation in conditions when their costs are given by their distribution densities. 2. Development of a method for solving the problem when the distribution density of the cost of transportation is not known. Methods. A computational scheme for solving the problem is proposed, which is implemented by an iterative procedure for sequential improvement of the transportation plan. The convergence of this procedure is proved. In order to accelerate the convergence of the computational procedure to the exact solution, an alternative method is proposed based on the solution of a nontrivial problem of fractional nonlinear programming. The method reduces the original complex problem to solving a sequence of simpler problems. 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. To solve the problem in this case, a minimax method is proposed for finding the best transportation plan in the most unfavorable situation, when the distribution densities of the random cost of transportation are the worst. To find such densities, the modern mathematical apparatus of continuous linear programming was used. Results. A mathematical model and a method for solving the problem of transport logistics in conditions of uncertainty of the initial data are proposed. The desired plan is achieved using the solution of the fractional nonlinear programming problem. Conclusions: The problem of forming a transportation plan is considered, provided that their costs are random values. Also, a method for solving the problem of optimization of transportation for a situation where the density of distribution of random cost cannot be correctly determined is considered