Abstract
The paper is concerned with scheduling the two-way traffic between two stations connected by a single-track railway with a siding. It is shown that if, for each station, the order in which trains leave this station is known or can be found, then for various objective functions an optimal schedule can be constructed in polynomial time using the method of dynamic programming. Based on this result, the paper also presents a polynomial-time algorithm minimising the weighted number of late trains.
Similar content being viewed by others
References
Lazarev, A.A., Musatova, E.G., and Taracov, I.A., Two-Directional Traffic Scheduling Problem Solution for a Single-Track Railway with Siding, Autom. Remote Control, 2016, vol. 77, no. 12, pp. 2118–2131.
Harrod, S., A Tutorial on Fundamental Model Structures for Railway Timetable Optimization, Surv. Oper. Res. Manage. Sci., 2012, vol. 17, no. 2, pp. 85–96.
De Oliveira, E., Solving Single-Track Railway Scheduling Problem Using Constraint Programming, PhD Dissertation, Univ. of Leeds, 2001.
Lusby, R., Larsen, J., Ehrgott, M., et al., Railway Track Allocation: Models and Methods, OR Spectr., 2011, vol. 33, no. 4, pp. 843–883.
Frank, O., Two-Way Traffic on a Single Line of Railway, Oper. Res., 1966, vol. 14, no. 5, pp. 801–811.
Szpigel, B., Optimal Train Scheduling on a Single Line Railway, Oper. Res., 1973, pp. 344–351.
Brucker, P., Scheduling Algorithms, New York: Springer-Verlag, 2001, 3rd ed.
Gafarov, E., Dolgui, A., and Lazarev, A., Two-Station Single-Track Railway Scheduling Problem with Trains of Equal Speed, Comput. Indust. Eng., 2015, vol. 85, pp. 260–267.
Harbering, J., Ranade, A., and Schmidt, M., Single Track Train Scheduling, Proc. 7th Multidisciplinary Int. Conf. Scheduling: Theory Appl. (MISTA 2015), Prague, 2015, pp. 102–117.
Sotskov, Y. and Gholami, O., Shifting Bottleneck Algorithm for Train Scheduling in a Singletrack Railway, Proc. 14th IFAC Sympos. Inform. Control Probl., Part 1, Bucharest, Romania, 2012, pp. 87–92.
Sotskov, Y. and Gholami, O., Mixed Graph Model and Algorithms for Parallel-Machine Job-Shop Scheduling Problems, Int. J. Product. Res., 2015, p. 16. http://dx.doi.org/10.1080/00207543.2015. 1075666
Zinder, Ya. and Shkurba, V., Effective Iterative Algorithms in Scheduling Theory, Cybernetics, 1985, vol. 21, no. 1, pp. 86–90.
Zinder, Ya., Lazarev, A., Musatova, E., Tarasov, I., and Khusnullin, N., Two-Station Single Track Scheduling Problem, IFAC-PapersOnLine, 2016, vol. 49, no. 12, pp. 231–236.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Y. Zinder, A.A. Lazarev, E.G. Musatova, I.A. Tarasov, 2018, published in Avtomatika i Telemekhanika, 2018, No. 3, pp. 144–166.
Rights and permissions
About this article
Cite this article
Zinder, Y., Lazarev, A.A., Musatova, E.G. et al. Scheduling the Two-Way Traffic on a Single-Track Railway with a Siding. Autom Remote Control 79, 506–523 (2018). https://doi.org/10.1134/S0005117918030098
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117918030098