Skip to main content

Railway Track Allocation

  • Conference paper
  • First Online:
Operations Research Proceedings 2012

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

This article gives an overview of the results of the author’s PhD thesis [8]. The thesis deals with the mathematical optimization for the efficient use of railway infrastructure. We address the optimal allocation of the available railway track capacity—the track allocation problem. This track allocation problem is a major challenge for a railway company, independent of whether a free market, a private monopoly, or a public monopoly is given. Planning and operating railway transportation systems is extremely hard due to the combinatorial complexity of the underlying discrete optimization problems, the technical intricacies, and the immense sizes of the problem instances. Mathematical models and optimization techniques can result in huge gains for both railway customers and operators, e.g., in terms of cost reductions or service quality improvements. We tackle this challenge by developing novel mathematical models and associated innovative algorithmic solution methods for large scale instances. We made considerable progress on solving track allocation problems by two main features—a novel modeling approach for the macroscopic track allocation problem and algorithmic improvements based on the utilization of the bundle method. This allows us to produce for the first time reliable solutions for a real world instance, i.e., the Simplon corridor in Switzerland.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Borndörfer, R., Schlechte, T.: Models for railway track allocation, in ATMOS 2007–7th workshop on algorithmic approaches for transportation modeling, optimization, and systems. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) Vol. 07001 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2007).

    Google Scholar 

  2. Brännlund, U., Lindberg, P., Nou, A., Nilsson, J.-E.: Railway timetabling using langangian relaxation. Transp. Sci. 32, 358–369 (1998)

    Article  Google Scholar 

  3. Borndörfer, R., Löbel, A., Weider, S.: A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. Computer-aided systems in public transport (CASPT 2004). In: Hickman, M., Mirchandani, P., Voß, S. (eds.) Vol. 600 of Lecture Notes in Economics and Mathematical Systems, pp. 3–24. Springer (2008).

    Google Scholar 

  4. Borndörfer, R., Löbel, A., Reuther, M., Thomas, S., Weider, S.: Rapid branching, ZIB report 12–10, ZIB, Takustr. 7, 14195. Submitted 17.02.2011 to Proceedings of Conference on Advanced Systems for Public, Transport 2012 (CASPT12), Berlin (2010).

    Google Scholar 

  5. Borndörfer, R., Schlechte, T., Weider, S.: Railway track allocation by rapid branching. In: Erlebach, T., Lübbecke, M. (eds.) Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. OpenAccess Series in Informatics (OASIcs), vol. 14, pp. 13–23. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2010).

    Google Scholar 

  6. Borndörfer, R., Erol, B., Graffagnino, T., Schlechte, T., Swarat, E.: Optimizing the simplon railway corridor. Ann. Oper. Res. 1–14 (2012).<error l="84" c="Undefined command " />.

    Google Scholar 

  7. Caprara, A., Monaci, M., Toth, P., Guida, P.L.: A lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Appl. Math. 154, 738–753 (2006)

    Article  Google Scholar 

  8. Schlechte, T.: Railway Track Allocation-Models and Algorithms. PhD thesis, Technische Universität Berlin (2012).

    Google Scholar 

  9. Schlechte, T., Borndörfer, R., Erol, B., Graffagnino, T., Swarat, E.: Micro-macro transformation of railway networks. J. Rail Transp. Plann. Manag. 1, 38–48 (2011)

    Article  Google Scholar 

  10. Weider, S.: Integration of Vehicle and Duty Scheduling in Public Transport. PhD thesis, TU Berlin (2007).

    Google Scholar 

Download references

Acknowledgments

Finally, I thank Martin Grötschel, Gottfried Ilgmann, and Klemens Polatschek for their important support in organizing and realizing this project, and in particular the Simplon case-study. Most of all I want to thank my supervisor Dr. habil. Ralf Borndörfer and special thanks goes also to Dr. Steffen Weider. Applied research is really applied only if it is done and evaluated in close collaboration with an industrial and operating partner. Therefore, I am very thankful for all discussions with external experts in particular from Swiss Federal Railways (SBB). Special thanks go to Thomas Graffagnino, Martin Balser, and Elmar Swarat for explaining various technical details of railway systems and discussing several results. In addition, I want to thank Daniel Hürlimann for his support for the simulation tool OpenTrack .

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thomas Schlechte .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Schlechte, T. (2014). Railway Track Allocation. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_3

Download citation

Publish with us

Policies and ethics