Methods for optimizing routes in digital logistics

Abstract

The current problem of digital logistics is investigated - the calculation of optimal routes for freight transportation by computer means to reduce time and distance. Heuristic methods used in logistics for constructing optimal routes are considered. A comparative analysis of ten methods for solving the optimization problem of the “nondeterministic polynomial time” complexity class traveling salesman is carried out. The study performs a comparative analysis of the following methods: “convex hull, cheapest insertion and angle selection”, “greedy”, “greedy-cycle”, “integer-linear-programming”, “or-opt”, “or-zweig”, “remove crossings”, “space filling curve”, “simulated annealing”, “two-opt”. A computational experiment is performed, on the basis of which the accuracy and computational complexity of the considered methods are estimated. The results of the computational experiment show the construction of the optimal route by the “integer-linear-programming” method and the highest computation speed for the “greedy” method. Application of the “integer-linear-programming” method in logistics is the most accurate at the optimal time for calculating efficient routes of freight traffic.