文章基本信息

标题：Methods for optimizing routes in digital logistics
本地全文：下载
作者：Lubov Ivanova ; Andrey Kurkin ; Sergei Ivanov 等
期刊名称：E3S Web of Conferences
印刷版ISSN：2267-1242
电子版ISSN：2267-1242
出版年度：2021
卷号：258
页码：1-9
DOI：10.1051/e3sconf/202125802015
语种：English
出版社：EDP Sciences
摘要：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.