Solving the logistics problem in a quantile formulation with a limitation on the delivery time

<jats:p>&lt;p&gt;&lt;strong&gt;Context and relevance.&lt;/strong&gt; The article discusses the quantile statement of the logistics problem with a limitation on the task execution time. The problems of transport logistics have long been well studied in deterministic formulation, however, taking into account the probabilistic limitation on the time of delivery of cargo, the problem translates into the class of stochastic optimization problems and requires the development of special solution methods. &lt;strong&gt;Objective.&lt;/strong&gt; For the company, it is necessary to transport the same type of cargo from several warehouses to the final consumers. The delivery time for each consumer is limited. It is required to minimize the costs associated with the delivery of goods, taking into account the fact that the travel time from each warehouse to each end consumer is stochastic. A number of vehicles are assigned to each warehouse. All vehicles are of the same type and within the framework of the task they carry out only one delivery from the warehouse to one consumer. &lt;strong&gt;Hypothesis.&lt;/strong&gt; To solve the problem, the development of a special solution algorithm is required, since the use of algorithms for solving deterministic optimization problems run into difficulties associated with a large dimension of an equivalent deterministic problem. &lt;strong&gt;Methods and materials.&lt;/strong&gt; The problem is formulated in terms of stochastic linear programming with a quantile criterion and an optimization strategy in the form of a matrix of Boolean variables. The confidence level reflects the likelihood of meeting a joint time limit on the delivery of goods to each of the consumers. To solve the problem, an effective solution algorithm is proposed. &lt;strong&gt;Results.&lt;/strong&gt; The results of the numerical experiment are given, reflecting the effectiveness of the algorithm. &lt;strong&gt;Conclusions.&lt;/strong&gt; The shown results show the effectiveness of the proposed algorithm in comparison with standard deterministic optimization algorithms used to solve the equivalent deterministic problem given in the work.&lt;/p&gt;</jats:p>