Comparison of Algorithms for Finding Optimal Timetable for Railway Network

The problem of finding the optimal locomotive timetable for the railroad network of a mining enterprise is considered. The purpose of this paper is to compare the following algorithms: the full brute force algorithm and the vertex gluing algorithm. The first algorithm is resource-intensive and slow, while the second algorithm can significantly save time and computational resources. To achieve this goal, we developed an application software product and conducted a number of numerical experiments on test data, which allowed us to evaluate how much more efficient the vertex gluing algorithm is than the brute-force algorithm. The results of two test experiments are presented in this paper. In the future, the results of this study can be used to improve the management of railway transport at mining companies and improve the efficiency of their activities as a whole.