ИССЛЕДОВАНИЕ НЕКОТОРЫХ КЛАССИЧЕСКИХ АЛГОРИТМОВ ЗАДАЧИ МАРШРУТИЗАЦИИ ТРАНСПОРТА

The article is devoted to the study of some classical algorithms for transport routing problems. The article describes the existing classical transport routing algorithms, such as the Clark-Wright algorithm and its extended algorithm. The main minus of Clarke-Wright’s algorithm has been revealed, which consists in the efficiency of its operation decreases as it approaches the end of the calculations, while at the beginning of the work, the solutions are relatively successful. To improve the performance of the Clark-Wright algorithm, three approaches have been proposed in its extended algorithm. Also were explored the algorithms of Mole-Jameson and Christofides, Mingozzi and Tossa, which can be used for tasks with an unspecified in advance number of vehicles, are investigated. The algorithm of the Notes, which is used for the initial processing of the problems of ZMT, is proposed. Classical improvement algorithms for MMT are investigated, in which either a single route at a time or several routes are processed. The above algorithms give more interesting results than their predecessors, and are considered optimal in terms of the use of certain resources.