Skip to main content
SpringerLink
Log in

On the Problem of Increasing the Railway Station Capacity

  • CONTROL IN TECHNICAL SCIENCES
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We consider the problem of increasing the capacity of a railway station taking into account some basic timetable for the station. To this end, the time and route for each additional train are determined by solving a set of mixed integer linear programming problems. A scheme is proposed to take into account the influence of random delays in the movement of trains on the possibility of their passage through the railway station. The results of a numerical experiment are presented.

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

Fig. 1.

Similar content being viewed by others

REFERENCES

  1. Cordeau, J.-F., Toth, P., and Vigo, D., A survey of optimization models for train routing and scheduling, Transp. Sci., 1998, vol. 32, no. 4, pp. 380–404.

    Article  Google Scholar 

  2. Kroon, L., Maroti, G., et al., Stochastic improvement of cyclic railway timetables, Transp. Res. Part B: Methodol., 2008, vol. 42, no. 6, pp. 553–570.

    Article  Google Scholar 

  3. Lazarev, A.A. and Musatova, E.G., The problem of trains formation and scheduling: Integer statements, Autom. Remote Control, 2013, vol. 74, no. 12, pp. 2064–2068.

    Article  MathSciNet  Google Scholar 

  4. Zinder, Y., Lazarev, A.A., et al., Scheduling the two-way traffic on a single-track railway with a siding, Autom. Remote Control, 2018, vol. 79, no. 3, pp. 506–523.

    Article  MathSciNet  Google Scholar 

  5. Ziarati, K., Soumis, F., et al., Locomotive assignment with heterogeneous consists at CN North America, Eur. J. Oper. Res., 1997, no. 97, pp. 281–292.

  6. Ahuja, R.K., Liu, J., et al., Solving real-life locomotive-scheduling problems, Transp. Sci., 2005, vol. 39, no. 4, pp. 503–517.

    Article  Google Scholar 

  7. Buyanov, M.V., Ivanov, S.V., et al., Development of the mathematical model of cargo transportation control on a railway network segment taking into account random factors, Inf. Ee Primen., 2017, vol. 11, no. 4, pp. 85–93.

    Google Scholar 

  8. Buyanov, M.V. and Naumov, A.V., Optimizing the operation of rolling stock in organizing cargo transportation at a railway network segment, Autom. Remote Control, 2018, vol. 79, no. 9, pp. 1661–1672.

    Article  MathSciNet  Google Scholar 

  9. Powell, W.B., Simao, H.P., and Bouzaiene-Ayari, B., Approximate dynamic programming in transportation and logistics: a unified framework, Eur. J. Transp. Logist., 2012, no. 1, pp. 237–284.

  10. Albrecht, A.R., Panton, D.M., and Lee, D.H., Rescheduling rail networks with maintenance disruptions using problem space search, Comput. Oper. Res., 2013, vol. 40, no. 3, pp. 703–712.

    Article  Google Scholar 

  11. Forsgren, M., Aronsson, M., and Gestrelius, S., Maintaining tracks and traffic flow at the same time, J. Rail Transp. Plan. & Manage., 2013, vol. 3, no. 3, pp. 111–123.

    Google Scholar 

  12. Liden, T. and Joborn, M., An optimization model for integrated planning of railway traffic and network maintenance, Transp. Res. Part C: Emerging Technol., 2017, no. 74, pp. 327–347.

  13. Gainanov, D.N., Ignatov, A.N., et al., On track procession assignment problem at the railway network sections, Autom. Remote Control, 2020, vol. 81, no. 6, pp. 967–977.

    Article  Google Scholar 

  14. Bosov, A.V., Ignatov, A.N., and Naumov, A.V., Model of transportation of trains and shunting locomotives at a railway station for evaluation and analysis of side-collision probability, Inf. Ee Primen., 2018, vol. 12, no. 3, pp. 107–114.

    Google Scholar 

  15. Ignatov, A.N. and Naumov, A.V., On time selection for track possession assignment at the railway station, Bull. South Ural State Univ. Ser. Math. Model. Progr. Comput. Software, 2019, vol. 12, no. 3, pp. 5–16.

    MATH  Google Scholar 

  16. Abril, M., Barber, F., et al., An assessment of railway capacity, Transp. Res. Part E: Logist. Transp. Rev., 2008, vol. 44, no. 5, pp. 774–806.

    Article  Google Scholar 

  17. Petering, M.E.H., Heydar, M., and Bergmann, D.R., Mixed-integer programming for railway capacity analysis and cyclic, combined train timetabling and platforming, Transp. Sci., 2016, vol. 50, no. 3, pp. 892–909.

    Article  Google Scholar 

  18. Sels, P., Vansteenwegen, P., et al., The train platforming problem: the infrastructure management company perspective, Transp. Res. Part B: Methodol., 2014, vol. 61, pp. 55–72.

    Article  Google Scholar 

  19. Hansen, P., Mladenovic, N., et al., Variable neighborhood search, in Handbook of Metaheuristics, Gendreau, M. and Potvin, J.-Y., Eds., 2010, pp. 61–86.

Download references

Funding

This work was supported by the Russian Foundation for Basic Research, project no. 20-07-00046_A.

Author information

Authors and Affiliations

  1. Moscow Aviation Institute, Moscow, 125993, Russia

    A. N. Ignatov & A. V. Naumov

Authors
  1. A. N. Ignatov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Naumov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. N. Ignatov or A. V. Naumov.

Additional information

Translated by V. Potapchouck

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ignatov, A.N., Naumov, A.V. On the Problem of Increasing the Railway Station Capacity. Autom Remote Control 82, 102–114 (2021). https://doi.org/10.1134/S0005117921010070

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation