Abstract
This chapter addresses the classical task to decide which train runs on which track in a railway network. In this context a track allocation defines the precise routing of trains through a railway network, which usually has only a limited capacity. Moreover, the departure and arrival times at the visited stations of each train must simultaneously meet several operational and safety requirements. The problem to find the “best possible” allocation for all trains is called the track allocation problem (TAP). Railway systems can be modeled on a very detailed scale covering the behavior of individual trains and the safety system to a large extent. However, those microscopic models are too big and not scalable to large networks, which make them inappropriate for mathematical optimization on a network wide level. Hence, most network optimization approaches consider simplified, so called macroscopic, models. In the first part we take a look at the challenge to construct a reliable and condensed macroscopic model for the associated microscopic model and to facilitate the transition between both models of different scale. In the main part we focus on the optimization problem for macroscopic models of the railway system. Based on classical graph-theoretical tools the track allocation problem is formulated to determine conflict-free paths in corresponding time-expanded graphs. We present standard integer programming model formulations for the track allocation problem that model resource or block conflicts in terms of packing constraints. In addition, we discuss the role of maximal clique inequalities and the concept of configuration networks. We will also present classical decomposition approaches like Lagrangian relaxation and bundle methods. Furthermore, we will discuss recently developed techniques, e. g., dynamic graph generation. Finally, we will discuss the status quo and show a vision of mathematical optimization to support real world track allocation, i. e. integrated train routing and scheduling, in a data-dominated and digitized railway future.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Blanco M, Schlechte T (2013) Analysis of micro-macro transformations of railway networks. In: Huisman D, Louwerse I, Wagelmans APM (eds) Operations research proceedings 2013. Springer, Berlin, pp 37–42. ISBN: 978-3-319-07000-1. https://doi.org/10.1007/978-3-319-07001-8_6 (cited on page 146)
Borndörfer R, Schlechte T (2007) Models for railway track allocation. In: Liebchen C, Ahuja RK, Mesa JA (eds) Proceedings of the 7th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS’07). OpenAccess series in informatics (OASIcs), vol 7. Schloss Dagstuhl, Wadern. ISBN: 978-3-939897-04-0. https://doi.org/10.4230/OASIcs.ATMOS.2007.1170 (cited on page 150)
Borndörfer R, Erol B, Graffagnino T, Schlechte T, Swarat E (2014) Optimizing the Simplon railway corridor. Ann Oper Res 218(1):93–106. https://doi.org/10.1007/s10479-012-1260-9 (cited on page 155)
Brännlund U, Lindberg PO, Nou A, Nilsson J-E (1998) Railway timetabling using Lagrangian relaxation. Transp Sci 32(4):358–369. https://doi.org/10.1287/trsc.32.4.358 (cited on page 146)
Caimi GC (2009) Algorithmic decision support for train scheduling in a large and highly utilised railway network. PhD thesis, Eidgenössische Technische Hochschule Zürich. https://doi.org/10.3929/ethz-a-005947637 (cited on pages 145, 146, 147)
Caimi G, Chudak F, Fuchsberger M, Laumanns M, Zenklusen R (2011) A new resource-constrained multicommodity flow model for routing and scheduling. Transp Sci 45(2):212–227. ISSN: 1526-5447. https://doi.org/10.1287/trsc.1100.0349 (cited on page 149)
Caimi G, Fuchsberger M, Laumanns M, Schüpbach K (2011) A multi-level framework for generating train schedules in highly utilised networks. English. Public Transp 3(1):3–24. ISSN: 1866-749X. https://doi.org/10.1007/s12469-011-0041-1 (cited on page 145)
Caimi G, Kroon LG, Liebchen C (2017) Models for railway timetable optimization: applicability and applications in practice. J Rail Transp Plann Manage 6(4):285–312. https://doi.org/10.1016/j.jrtpm.2016.11.002 (cited on page 146)
Caprara A, Fischetti M, Toth P (2002) Modeling and solving the train timetabling problem. English. Oper Res 50(5):851–861. https://doi.org/10.1287/opre.50.5.851.362 (cited on pages 146, 147)
Dollevoet T, Corman F, D’Ariano A, Huisman D (2014) An iterative optimization framework for delay management and train scheduling. English. Flex Serv Manuf J 26(4):490–515. ISSN: 1936-6582. https://doi.org/10.1007/s10696-013-9187-2 (cited on page 145)
Fischer F (2013) Dynamic graph generation and an asynchronous parallel bundle method motivated by train timetabling. PhD thesis, Chemnitz University of Technology. URN: urn:nbn:de:bsz:ch1-qucosa-118358 (cited on pages 148, 152, 154, 155)
Fischer F (2015) Ordering constraints in time expanded networks for train timetabling problems. In: Italiano GF, Schmidt M (eds) 15th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS 2015). OpenAccess Series in Informatics (OASIcs), vol 48. Schloss Dagstuhl, Wadern, pp 97–110. ISBN: 978-3-939897-99-6. https://doi.org/10.4230/OASIcs.ATMOS.2015.97 (cited on page 150)
Fischer F, Helmberg C (2014) Dynamic graph generation for the shortest path problem in time expanded networks. English. Math Program A 143(1–2):257–297. ISSN: 0025-5610. https://doi.org/10.1007/s10107-012-0610-3 (cited on page 154)
Fischer F, Schlechte T (2015) Comparing two dual relaxations of large scale train timetabling problems. In: Proceedings of conference on advanced systems in public transport (CASPT 2015) (URN links to ZIB report). URN: urn:nbn:de:0297-zib-56068 (cited on page 150)
Goverde R, Besinovic N, Binder A, Cacchiani V, Quaglietta E, Roberti R, Toth P (2015) A three-level framework for performance-based railway timetabling. In: 6th international conference on railway operations modelling and analysis, RailTokyo. UUID: b095c1cd-36dd-4fb3-98a4-ef96c2fff7d7 (cited on page 146)
Harrod S (2010) Modeling network transition constraints with hypergraphs. English. Transp Sci 10:293–310. https://doi.org/10.1287/trsc.1100.0337 (cited on page 148)
Helly E (1923) Über Mengen konvexer Körper mit gemeinschaftlichen Punkten. German. Jahresbericht der Deutschen Mathematiker-Vereinigung 32:175–176 (cited on page 149)
Hiriart-Urruty J-B, Lemaréchal C (1993) Convex analysis and minimization algorithms I. A series of comprehensive studies in mathematics, vol 305. Springer, Berlin. https://doi.org/10.1007/978-3-662-02796-7 (cited on page 152)
Hiriart-Urruty J-B, Lemaréchal C (1993) Convex analysis and minimization algorithms II. A series of comprehensive studies in mathematics, vol 306. Springer, Berlin. https://doi.org/10.1007/978-3-662-06409-2 (cited on page 152)
Liebchen C (2006) Periodic timetable optimization in public transport. PhD thesis, TU Berlin. dissertation.de. ISBN: 978-3-86624-150-3 (cited on page 146)
Lukac SG (2004) Holes, antiholes and maximal cliques in a railway model for a single track. English. Technical Report, ZIB Report 04-18. Zuse-Institut Berlin. URN: urn:nbn:de:0297-zib-7939 (cited on page 149)
Lusby RM, Larsen J, Ehrgott M, Ryan D (2011) Railway track allocation: models and methods. OR Spectr 33(4):843–883. https://doi.org/10.1007/s00291-009-0189-0 (cited on page 146)
OpenTrack (2010) ETH Zürich. www.opentrack.ch (cited on page 155)
Schlechte T (2012) Railway track allocation - models and algorithms. PhD thesis, TU Berlin. https://doi.org/10.14279/depositonce-3124 (cited on pages 145, 148, 149, 150)
Schlechte T, Borndörfer R, Erol B, Graffagnino T, Swarat E (2011) Micro-macro transformation of railway networks. English. J Rail Transp Plann Manage 1(1):38–48. https://doi.org/10.1016/j.jrtpm.2011.09.001 (cited on page 146)
Sewcyk B (2004) Makroskopische Abbildung des Eisenbahnbetriebs in Modellen zur langfristigen Infrastrukturplanung. Deutsch. PhD thesis. Universität Hannover. Eurailpress. ISBN: 978-3-7771-0323-5. http://d-nb.info/973559918 (cited on page 144)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Caimi, G., Fischer, F., Schlechte, T. (2018). Railway Track Allocation. In: Borndörfer, R., Klug, T., Lamorgese, L., Mannino, C., Reuther, M., Schlechte, T. (eds) Handbook of Optimization in the Railway Industry. International Series in Operations Research & Management Science, vol 268. Springer, Cham. https://doi.org/10.1007/978-3-319-72153-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-72153-8_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72152-1
Online ISBN: 978-3-319-72153-8
eBook Packages: Business and ManagementBusiness and Management (R0)