Skip to main content
SpringerLink
Log in

A Joint Problem of Track Closure Planning and Train Run Rescheduling with Detours

  • Conference paper
  • First Online:
Advances in Systems Science (ICSS 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 539))

Included in the following conference series:

Abstract

The main goal of this paper is to present an extended model and a solution algorithm for the joint problem of train run rescheduling and track closure planning. Inclusion of the possibility of rerouting increases the complexity, on one hand, but potentially leads to better overall solutions, on the other. Presented and tested is a heuristic solution algorithm working under the assumption of obligatory character of both runs and closures. The algorithm finds both, time shifts of planned runs and execution times of closures while attempting to minimize the total time divergence of the new schedule as compared with the original schedule. This approach fits squarely into a concept of a multi-stage train run and closure selection and scheduling system which is referenced in this work.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albrecht, A.R., Panton, D.M., Lee, D.H.: Rescheduling rail networks with maintenance disruptions using problem space search. Comput. Oper. Res. 40(3), 703–712 (2013)

    Article  Google Scholar 

  2. Brannlund, U., Lindberg, P.O., Nou, A., Nilsson, J.-E.: Railway timetabling using Lagrangian relaxation. Transp. Sci. 32(4), 358–369 (1998)

    Article  MATH  Google Scholar 

  3. Cacchiani, V., Huisman, D., Kidd, M., Kroon, L., Toth, P., Veelentruf, L., Wagenaar, J.: An overview of recovery models and algorithms for real-time railway rescheduling. Transp. Res. Part B Methodol. 63, 15–37 (2014)

    Article  Google Scholar 

  4. Filcek, G., Gąsior, D., Hojda, M., Józefczyk, J.: Joint train rescheduling and track closures planning: model and solution algorithm. In: Borzemski, L., Grzech, A., Świątek, J., Wilimowska, Z. (eds.) Information Systems Architecture and Technology: Proceedings of 36th International Conference on Information Systems Architecture and Technology – ISAT 2015 – Part I. AISC, vol. 429, pp. 215–225. Springer, Heidelberg (2016). doi:10.1007/978-3-319-28555-9_19

    Google Scholar 

  5. Fokkert, J., Hertog, D., Berg, F., Verhoeven, J.: The Netherlands schedules track maintenance to improve track workers safety. Interfaces 37(2), 133–142 (2007)

    Article  Google Scholar 

  6. Hojda, M.: Optimization of time shifts in train timetables and track closure schedules. In: Proceedings of Krajowa Konferencja Automatyzacji Procesw Dyskretnych 2016, Poland (in print, 2016)

    Google Scholar 

  7. Lid, T.: Survey of railway maintenance activities from a planning perspective and literature review concerning the use of mathematical algorithms for solving such planning and scheduling problems, Technical report, Linkpings universitet (2014)

    Google Scholar 

  8. Meng, L., Zhou, X.: Simultaneous train rerouting, rescheduling on an N-track network, : A model reformulation with network-based cumulative flow variables. Transp. Res. Part B: Methodological 67, 208–234 (2014)

    Article  Google Scholar 

  9. Niu, H., Zhou, X.: Optimizing urban rail timetable under time-dependent demand and oversaturated conditions. Trans. Res. Part C: Emerg. Technol. 36, 212–230 (2013)

    Article  MathSciNet  Google Scholar 

  10. Schobel, A.: Capacity constraints in delay management. J. Public Transp. 1, 135–154 (2009)

    Article  Google Scholar 

  11. Tornquist, J., Persson, J.: Train traffic deviation handling using tabu search and simulated annealing. In: Proceedings of 38th Hawaii International Conference on System Sciences, p. 73a. IEEE (2005)

    Google Scholar 

  12. Tornquist, J., Persson, J.: N-tracked railway traffic rescheduling during disturbances. Transp. Res. Part B 41, 342–362 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Management, Wroclaw University of Science and Technology, 27 Wyb. Wyspianskiego Street, 50-370, Wroclaw, Poland

    Maciej Hojda & Grzegorz Filcek

Authors
  1. Maciej Hojda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grzegorz Filcek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maciej Hojda .

Editor information

Editors and Affiliations

  1. Wroclaw University of Science and Technology, Wroclaw, Poland

    Jerzy Świątek

  2. Wroclaw University of Science and Technology, Wroclaw, Poland

    Jakub M. Tomczak

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Hojda, M., Filcek, G. (2017). A Joint Problem of Track Closure Planning and Train Run Rescheduling with Detours. In: Świątek, J., Tomczak, J. (eds) Advances in Systems Science. ICSS 2016. Advances in Intelligent Systems and Computing, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-319-48944-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48944-5_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48943-8

  • Online ISBN: 978-3-319-48944-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation