The paper is devoted to the problem of organizing the flow in both directions, in the most efficient way, for the linear section of a single-track railway. The authors propose an algorithm for scheduling with independent orientations of edges, investigate the properties of this algorithm and perform computational experiments. The authors also present some estimates for the track capacity of the section.
Digital Object Identifier (DOI)
N. Akimova, Elena; N. Gainanov, Damir; A. Golubev, Oleg; D. Kolmogortsev, Ilya; and V. Konygin, Anton
"Optimal Scheduling for the Linear Section of a Single-Track Railway with Independent Edges Orientations,"
Applied Mathematics & Information Sciences: Vol. 10
, Article 16.
Available at: https://dc.naturalspublishing.com/amis/vol10/iss5/16