Two-staged algorithm for freight traffic’s route finding in constrained railway network

The article deals with the problem of freight trains’ route constructing in railway networks having capacity restrictions on stations and segments of lines that connect stations. This paper describes solving two-staged algorithm for this problem based on two approaches: methods of shortest path finding in graphs and linear problem solving methods. Developed algorithm quadratically depends of number of stations and linearly depends of number of freights, practical recommendations of reducing dependency of stations to linear is given in this article. This paper contains calculations until 10$^\wedge$10 dimension, comparative analysis of both approaches and their comparison with exact solution of this problem.