On Track Procession Assignment Problem at the Railway Network Sections

Abstract

We consider the problem of assigning a “track procession,” i.e., the time for railway network maintenance, when train movements are forbidden. The railway network is presented in the form of an undirected multigraph. Movements along this multigraph are carried out with a set of conflict-free subslots, where each “subslot” is a five-tuple of the arrival and departure vertices, number of the edge used for movement, and arrival and departure times. In this work, we construct a mathematical model for carrying out transportations plan with accounting for constraints on time when trains are for departure as well as constraints on arrival time. An optimization problem on time selection for track processions assignment and trains schedule corresponds to a mixed integer linear programming problem with a criteria of the minimization of total time spend by trains in run. An applied implementation of the proposed approach was performed using ILOG CPLEX software. We present the results of a numerical experiment.

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

References

  1. 1.

    Gainanov, D.N., Konygin, A.V., and Rasskazova, V.A., Modelling Railway Freight Traffic Using the Methods of Graph Theory and Combinatorial Optimization, Autom. Remote Control, 2016, vol. 77, no. 11, pp. 1928–1943.

    MathSciNet  Article  Google Scholar 

  2. 2.

    Cordeau, J.-F., Toth, P., and Vigo, D., A Survey of Optimization Models for Train Routing and Scheduling, Transport. Sci., 1998, vol. 32, no. 4, pp. 380–404.

    Article  Google Scholar 

  3. 3.

    Kroon, L., Maroti, G., et al., Stochastic Improvement of Cyclic Railway Timetables, Transportation Res., Part B: Methodological, 2008, vol. 42, no. 6, pp. 553–570.

    Article  Google Scholar 

  4. 4.

    Lazarev, A.A. and Musatova, E.G., Integer-Valued Settings for the Problem of Constructing Railroad Trains and Their Schedules, Upravlen. Bol’shimi Sist., 2012, no. 38, pp. 161–169.

  5. 5.

    Zinder, Ya.A., 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.

    MathSciNet  Article  Google Scholar 

  6. 6.

    Bosov, A.V., Ignatov, A.N., and Naumov, A.V., Model for Train and Shunting Engine Movement on a Railroad Station in Application to the Estimation and Analysis of the Probability of Side Collisions, Informat. Primen., 2018, vol. 12, no. 3, pp. 107–114.

    Google Scholar 

  7. 7.

    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.

  8. 8.

    Ahuja, R.K., Liu, J., et al., Solving Real-Life Locomotive-Scheduling Problems, Transport. Sci., 2005, vol. 39, no. 4, pp. 503–517.

    Article  Google Scholar 

  9. 9.

    Buyanov, M.V., Ivanov, S.V., Kibzun, A.I., and Naumov, A.V., Development of the Mathematical Model for Controlling Freight Transportation on a Railroad Network Segment with Random Factors, Informat. Primen., 2017, vol. 11, no. 4, pp. 85–93.

    Google Scholar 

  10. 10.

    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.

    MathSciNet  Article  Google Scholar 

  11. 11.

    Powell, W.B., Simao, H.P., and Bouzaiene-Ayari, B., Approximate Dynamic Programming in Transportation and Logistics: A Unified Framework, EURO J. Transp. Logist., 2012, no. 1, pp. 237–284.

  12. 12.

    Pravila tekhnicheskoi ekspluatatsii zheleznykh dorog Rossiiskoi Federatsii (Rules for the Technical Operation of Russian Railroads), 09.02.2018 edition, Moscow: Morkniga, 2019.

  13. 13.

    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 

  14. 14.

    Forsgren, M., Aronsson, M., and Gestrelius, S., Maintaining Tracks and Traffic Flow at the Same Time, J. Rail Transport Planning Manage., 2013, vol. 3, no. 3, pp. 111–123.

    Article  Google Scholar 

  15. 15.

    Liden, T. and Joborn, M., An Optimization Model for Integrated Planning of Railway Traffic and Network Maintenance, Transportation Res., Part C: Emerging Technol., 2017, no. 74, pp. 327–347.

  16. 16.

    Ignatov, A.N. and Naumov, A.V., On Time Selection for Track Possession Assignment at the Railway Station, Bull. South Ural State Univ., Ser. Mat. Model. Progr., 2019, vol. 12, no. 3, pp. 5–16.

    MATH  Google Scholar 

Download references

Acknowledgments

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

Author information

Affiliations

Authors

Corresponding authors

Correspondence to D. N. Gainanov or A. N. Ignatov or A. V. Naumov or V. A. Rasskazova.

Additional information

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

Russian Text © The Author(s), 2020, published in Avtomatika i Telemekhanika, 2020, No. 6, pp. 3–16.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Gainanov, D.N., Ignatov, A.N., Naumov, A.V. et al. On Track Procession Assignment Problem at the Railway Network Sections. Autom Remote Control 81, 967–977 (2020). https://doi.org/10.1134/S0005117920060028

Download citation

Keywords

  • “track procession”
  • railway network
  • multigraph
  • subslot
  • mixed integer linear programming