Efficiency comparison of the routing algorithms used in centralized traffic management systems

The aim of the paper is to compare the efficiency of vehicle routing algorithms used in transport networks. We consider a centralized approach, in which the calculation of the routes of all vehicles is performed in a centralized traffic management system. We investigate routing algorithms based on the shortest path algorithm in a static time-dependent network, as well as the effect of the rerouting procedure on the total travel time. Comparison of the algorithms efficiency is carried out in microscopic simulation of a real-world traffic environment in the network of Samara, Russia.