Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Improving the methodology for optimizing multimodal transportation delivery routes and cyclic schedules in a transnational direction

Taran Igor, Bikhimova Guldana, Danchuk Victor, Toktamyssova Aliya, Tursymbekova Zakira, Oliskevych Myroslav

Transport Problems

2024

T. 19, z. 1

157--170

This study considers the task of planning the routes of multimodal transnational cargo transportation. Due to the extremely long length of such routes, delivery times and costs per cargo unit are extremely important. Delays in various types of transport and in the case of cargo transshipment are associated not only with the growth of cargo flows but also with the inconsistency of vehicle schedules. The purpose of this study is to improve the previously developed methodology for optimizing multimodal cargo transportation, taking into account the need for its application to transnational transport corridors. The content of the formulated network problem is reduced to a modification of the traveling salesman problem with an unknown number of transport points the route should pass through. Such a problem is NP-hard due to the time complexity of the algorithms. A modified algorithm has been developed, according to which the general problem with the number of N points is divided into several subproblems. Transport points are grouped into consecutive subsets that are related by only one non-alternative way of transportation. This way can be any “bottleneck” of the transport network or an artificially created one. Such a decomposition of the problem gives a set of partial solutions, which were combined into the final optimal solution. The obtained solution to the routing problem of multimodal routes takes into account the cyclical schedules of the transport operation and gives a guaranteed exact optimum for calculations performed within the permissible time. In addition to determining the optimal route, the algorithm makes it possible to determine the required number of vehicles and their work schedules depending on the total cargo flow on the route.

An algorithm for garbage truck routing in cities with a fixation on container filling level

Oliskevych Myroslav, Danchuk Victor

Transport Problems

2023

T. 18, z. 1

75--87

An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.