Skip to main content
SpringerLink
Log in

Two-directional traffic scheduling problem solution for a single-track railway with siding

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The paper is concerned with scheduling trains moving in both directions between two stations connected by a single-track railway with a siding. The paper presents dynamic programming based algorithms which minimizes two objective functions: maximum lateness and total weighted completion time. The complexity of these algorithms is O(n 2).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    MathSciNet  Google Scholar 

  2. De Oliveira, E., Solving Single-Track Railway Scheduling Problem Using Constraint Programming, PhD Dissertation, Leeds Univ., 2001.

    Google Scholar 

  3. Lusby, R., Larsen, J., Ehrgott, M., et al., Railway Track Allocation: Models and Methods, OR Spectr., 2011, vol. 33, no. 4, pp. 843–883, Secaucus, New Jersey, USA.

    Article  MathSciNet  MATH  Google Scholar 

  4. Frank, O., Two-Way Traffic on a Single Line of Railway, Oper. Res., 1966, vol. 14, no. 5, pp. 801–811.

    Article  MATH  Google Scholar 

  5. Szpigel, B., Optimal Train Scheduling on a Single Line Railway, Oper. Res., 1973, pp. 344–351.

    Google Scholar 

  6. Brucker, P., Scheduling Algorithms, Secaucus, New Jersey: Springer, 2001, 3rd ed.

    Book  MATH  Google Scholar 

  7. Gafarov, E., Dolgui, A., and Lazarev, A., Two-station Single-track Railway Scheduling Problem with Trains of Equal Speed, Comput. Indust. Engin., 2015, vol. 85, pp. 260–267.

    Article  Google Scholar 

  8. Harbering, J., Ranade, A., and Schmidt, M., Single Track Train Scheduling, in Proc. 7 Multidisciplinary Int. Conf. on Scheduling: Theory and Applications (MISTA 2015), August 25–28, 2015, Prague, Czech Republic, 2015, pp. 102–117.

    Google Scholar 

  9. Sotskov, Y. and Gholami, O., Shifting Bottleneck Algorithm for Train Scheduling in a Singletrack Railway, in Proc. 14 IFAC Sympos. on Inform. Control Problems, Bucharest, Romania, 2012, part 1, pp. 87–92.

    Google Scholar 

  10. Sotskov, Y. and Gholami, O., Mixed Graph Model and Algorithms for Parallel-machine Job-shop Scheduling Problems, Int. J. Product. Res., published online, 2015, p. 16, http://dx.doi.org/10.1080/00207543.2015.1075666.

    Google Scholar 

  11. Brannlund, U., Lindberg, P., Nou, A., et al., Railway Timetabling Using Lagrangian Relaxation, Transport. Sci. Inst. Oper. Res. Manage. Sci. (INFORMS), 1998, vol. 32, no. 4, pp. 358–369, Linthicum, Maryland, USA.

    MATH  Google Scholar 

  12. Lazarev, A.A. and Musatova, E.G., Integer Formulations of the Problem of Railway Train Formation and Timetabling, Upravlen. Bol’shimi Sist., 2012, no. 38, pp. 161–169.

    Google Scholar 

  13. Mu, S. and Dessouky, M., Scheduling Freight Trains Traveling on Complex Networks, Transport. Res., Part B, Methodol., 2011, vol. 45, no. 7, pp. 1103–1123.

    Article  Google Scholar 

  14. Carey, M. and Lockwood, D., A Model, Algorithms and Strategy for Train Pathing, J. Oper. Res. Soc., 1995, vol. 8, no. 46, pp. 988–1005.

    Article  MATH  Google Scholar 

  15. Disser, Y., Klimm, M., and Lubbecke, E., Scheduling Bidirectional Traffic on a Path, in Proc. 42 Int. Colloquium on Automata, Languages, and Programming (ICALP), 2015, pp. 406–418.

    Google Scholar 

  16. Brucker, P., Heitmann, S., and Knust, S., Scheduling Railway Traffic at a Construction Site, OR Spectrum, 2002, no. 24, pp. 19–30.

    Article  MathSciNet  MATH  Google Scholar 

  17. Lazarev, A.A. and Tarasov, I.A., Optimal Scheduling of Trains between Two Stations Connected by a Single Track Railway with Siding Line, Upravlen. Bol’shimi Sist., 2015, no. 58, pp. 244–284.

    Google Scholar 

  18. Graham, R., Lawler, E., and Lenstra, J., Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Ann. Discret. Math., 1979, vol. 5, pp. 287–326.

    Article  MathSciNet  MATH  Google Scholar 

  19. Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A., Teoriya raspisanii. Mnogostadiinye sistemy (Scheduling Theory. Multistage Systems), Moscow: Nauka, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    A. A. Lazarev, E. G. Musatova & I. A. Tarasov

  2. Lomonosov State University, Moscow, Russia

    A. A. Lazarev & I. A. Tarasov

  3. National Research University Higher School of Economics, Moscow, Russia

    A. A. Lazarev

  4. Moscow Physical and Technical Institute (State University), Dolgoprudnyi, Russia

    A. A. Lazarev

Authors
  1. A. A. Lazarev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. G. Musatova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. A. Tarasov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Lazarev.

Additional information

Original Russian Text © A.A. Lazarev, E.G. Musatova, I.A. Tarasov, 2016, published in Avtomatika i Telemekhanika, 2016, No. 11, pp. 158–174.

This paper was recommended for publication by A.I. Kibzun, a member of the Editorial Board

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lazarev, A.A., Musatova, E.G. & Tarasov, I.A. Two-directional traffic scheduling problem solution for a single-track railway with siding. Autom Remote Control 77, 2118–2131 (2016). https://doi.org/10.1134/S0005117916120031

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117916120031

Search

Navigation