It is shown that due to the growth of waste generated by the metropolis, the processes of their removal and disposal must be more accurately accounted and controlled. If it is impossible to introduce “smart” control systems, it is proposed to search for reserves to increase the efficiency of the processes in their structure. A structural model of operations has been developed that can reduce time costs. The use of incomplete information on the accumulation and removal of garbage leads to unplanned mileage of trucks. In order to avoid unforeseen costs, it is proposed to use early garbage collection, which reduces the frequency of emptying containers. This leads to an increase in the number of truck arrivals to load, but eliminates unforeseen mileage due to inconsistencies in the loading forecast. It is shown that to effectively organize the work of garbage trucks on the transport network of the city, an active, shortest schedule of operations is required, which must be made for several periods. To develop an optimal cyclic schedule of garbage trucks, a method based on the ordering of mixed graphs is proposed. The mixed graph shows the set of garbage collection operations and the time relationships between their execution times. In order to develop an optimal schedule from such a graph, cycles must be removed from the graph. To do this, the “divide and conquer” method was used. The proposed algorithm for graph ordering is used to study the current garbage collection system. As a result of research, higher productivity of garbage trucks and timely removal of organic waste were achieved. The reduction of the weekly working time of 6 garbage trucks with the use of the 70 % container filling level reached 42 hours.

This article is devoted to the coordination of single stages of the multimodal delivery process, taking into account the fact that the process is discrete in its content. The tact, which has the content of a time window for performing the operation is used for discrete processes. Due to the fact that multimodal transportation of goods is carried out on a large network, time is one of the most important criteria for their perfection. Two timing criteria are applied in the article, which take into account the fact that the multimodal process must be synchronized and that the transportation of a large group of goods can be carried out in separate parts. An estimation criterion was also applied, which takes into account constant, variable, contingent costs, which are carried out depending on the structure of the process. The goal of the study is to create such multimodal cargo delivery routes that are characterized by the highest level of selec-tion criteria. In contrast to known studies, the dependence of the optimization criteria of the multimodal process on the total volume of cargo delivery was shown. The method of analyzing the transport scheme of multimodal transportation and the corresponding algorithm and computer program were developed. The methodology involves a complete review of all possible route options using three types of continent transport, namely road, rail, and river. The method of struc-tural optimization is applied to the example of a transcontinental transport corridor.

Purpose. To develop a method of simulation of the process of execution of random orders, which would allow substantiating a set of decisions of the transport company Trans-Service Ltd. The decisions concern the use of their own rolling stock, or the involvement of leased vehicles, as well as the rational sequence of orders. Methodology. A simulation model of transport cycles with discrete time is developed. The smallest indivisible duration of a cycle is one working shift. The incoming flow of orders is reflected by the random coordinates of the point of departure and destination of goods. The coordinates of potential orders are formed by a random number generator. Each order is set with its characteristics, which include: point of departure and delivery point, delivery volume, average delivery time, group size, time window. At each step of route planning, a set of orders is known, which are characterized by their compatibility. Rules for selecting orders and distributing them among existing vehicles have been developed. An algorithm and a computer program for simulation have been developed. Findings. Simulation was performed for 30 calendar days, when incoming order flows are stationary. The number of simulation steps is appropriate. The simulation was performed with 20 repetitions. The results are presented by the average value of repetitions. The dependences of the number of orders received, executed, and rejected by the carrier, as well as the number of their own vehicles used by the enterprise are obtained. We also received the number of orders that are not fulfilled by Companys own transport, but are accepted for execution with the help of leased fleet. The allowable order compatibility ratio varied for each series of experiments. The corresponding time indicators of cooperation under conditions of different intensity of the input flow were obtained. To perform simulation experiments with the initial data, which were observed in the transport company Trans-Service Ltd, Ukraine, an array of initial data was formed. Originality. For the first time, an indicator of organizational and technological compatibility of orders was used to select orders to be serviced by the transport company during simulation, which made it possible to select orders from the stochastic flow and form a rational sequence of their execution. Practical value. The obtained results are useful in developing a freight plan based on the data obtained on freight orders and the status and capabilities of partners.

The concept of sustainable transportation of goods as the primary paradigm for designing contemporary logistics systems assumes the use of energy-efficient and affordable modes of transport in a way that guarantees the most cost-efficient variant of the delivery scheme. That especially applies to road transport deliveries, where the number of alternatives for organizing the transportation process is numerous and the choice of the optimal solution is complicated by the multiple stochastic influences of the environment on the technological processes. In this paper, we contribute to solving the problem of shaping the sustainable delivery schemes by proposing an approach to shape the complete set of alternative transport and technological schemes for packaged cargo delivery by road transport. The developed mathematical model allows estimating the efficiency of each alternative delivery scheme for the given request and chooses the best variant that minimizes the total costs of all participants in the delivery process. The proposed algorithms are implemented in the C# programming language within the frame of a class library for modeling transport delivery processes. A case of transport processes for Delivery Ltd. (Kharkiv, Ukraine) is applied to illustrate the procedure of using the developed approach to choose the optimal transport and technological schemes for long-distance deliveries. As the result of simulating the goods transportation processes, we show the regression models that represent dependencies of the total costs for the implementation of a delivery scheme from the parameters of demand for the transportation of goods. These regression models allow estimating the most efficient delivery schemes based on the functional analysis of the obtained dependencies for the given demand parameters.

Development of the procedure for simulation modeling of interrelated transport processes on the main road network

The article deals with the modified Dijkstra’s algorithm of searching the shortest routes between all transport nodes of the road-transport network, which allows presenting the transport problem in the classical matrix form. This makes it possible to apply each of the known methods of optimal transport plans to solve it. The object of study is the transport process of freight transportation on the transport network by routes of international transport corridors. The purpose of the work is to improve the methods of solving the problems of finding the shortest routes on the transport network, including sections of international transport corridors. The research method is the analysis and modeling of freight transportation on road networks. The modified Dijkstra’s method of finding the shortest paths between all nodes of the road-transport network was work out, which allows to represent the transport problem in the classical matrix form, i.e. in the form of a table of connections. This makes it possible to apply each of the known methods of constructing optimal plans of cargo transportation in the table of connections. The software complex based on the developed algorithm was designed in the algorithmic language Delphi, which was tested on the example of a transport problem set in the form of a road network, as well as complex testing and debugging of a computer system to support decision-making on the optimization of freight traffic on Ukrainian and Western Europe transport systems.