TY - CHAP A1 - Borndörfer, Ralf A1 - Grimm, Boris A1 - Schlechte, Thomas T1 - Re-optimizing ICE Rotations after a Tunnel Breakdown near Rastatt T2 - Proceedings of the 8th International Conference on Railway Operations Modelling and Analysis - RailNorrköping 2019 N2 - Planning rolling stock movements in industrial passenger railway applications isa long-term process based on timetables which are also often valid for long periods of time. For these timetables and rotation plans, i.e., plans of railway vehicle movements are constructed as templates for these periods. During operation the rotation plans are affected by all kinds of unplanned events. An unusal example for that is the collapse of a tunnel ceiling near Rastatt in southern Germany due to construction works related to the renewal of the central station in Stuttgart. As a result the main railway connection between Stuttgart and Frankfurt am Main, located on top of the tunnel, had to be closed from August 12th to October 2nd 2017. This had a major impact on the railway network in southern Germany. Hence, all rotation plans and train schedules for both passenger and cargo traffic had to be revised. In this paper we focus on a case study for this situation and compute new rotation plans via mixed integer programming for the ICE high speed fleet of DB Fernverkehr AG one of the largest passenger railway companies in Europe. In our approach we take care of some side constraints to ensure a smooth continuation of the rotation plans after the disruption has ended. Y1 - 2019 UR - http://www.ep.liu.se/ecp/article.asp?issue=069&article=011&volume= SN - 978-91-7929-992-7 SN - 1650-3686 VL - Linköping Electronic Conference Proceedings IS - 069 SP - 160 EP - 168 PB - Linköping University Electronic Press, Linköpings universitet CY - Linköping, Sweden ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Grimm, Boris A1 - Reuther, Markus A1 - Schlechte, Thomas T1 - Optimization of handouts for rolling stock rotations JF - Journal of Rail Transport Planning & Management N2 - A railway operator creates (rolling stock) rotations in order to have a precise master plan for the operation of a timetable by railway vehicles. A rotation is considered as a cycle that multiply traverses a set of operational days while covering trips of the timetable. As it is well known, the proper creation of rolling stock rotations by, e.g., optimization algorithms is challenging and still a topical research subject. Nevertheless, we study a completely different but strongly related question in this paper, i.e.: How to visualize a rotation? For this purpose, we introduce a basic handout concept, which directly leads to the visualization, i.e., handout of a rotation. In our industrial application at DB Fernverkehr AG, the handout is exactly as important as the rotation itself. Moreover, it turns out that also other European railway operators use exactly the same methodology (but not terminology). Since a rotation can have many handouts of different quality, we show how to compute optimal ones through an integer program (IP) by standard software. In addition, a construction as well as an improvement heuristic are presented. Our computational results show that the heuristics are a very reliable standalone approach to quickly find near-optimal and even optimal handouts. The efficiency of the heuristics is shown via a computational comparison to the IP approach. Y1 - 2019 U6 - https://doi.org/10.1016/j.jrtpm.2019.02.001 IS - 10 SP - 1 EP - 8 ER - TY - CHAP A1 - Berthold, Timo A1 - Grimm, Boris A1 - Reuther, Markus A1 - Schade, Stanley A1 - Schlechte, Thomas T1 - Strategic Planning of Rolling Stock Rotations for Public Tenders T2 - Proceedings of the 8th International Conference on Railway Operations Modelling and Analysis - RailNorrköping 2019 N2 - Since railway companies have to apply for long-term public contracts to operate railway lines in public tenders, the question how they can estimate the operating cost for long-term periods adequately arises naturally. We consider a rolling stock rotation problem for a time period of ten years, which is based on a real world instance provided by an industry partner. We use a two stage approach for the cost estimation of the required rolling stock. In the first stage, we determine a weekly rotation plan. In the second stage, we roll out this weekly rotation plan for a longer time period and incorporate scheduled maintenance treatments. We present a heuristic approach and a mixed integer programming model to implement the process of the second stage. Finally, we discuss computational results for a real world tendering scenario. Y1 - 2019 UR - http://www.ep.liu.se/ecp/article.asp?issue=069&article=009&volume= SN - 978-91-7929-992-7 SN - 1650-3686 VL - Linköping Electronic Conference Proceedings IS - 069 SP - 148 EP - 159 PB - Linköping University Electronic Press, Linköpings universitet ER - TY - BOOK A1 - Abbink, Erwin A1 - Bärmann, Andreas A1 - Bešinovic, Nikola A1 - Bohlin, Markus A1 - Cacchiani, Valentina A1 - Caimi, Gabrio A1 - de Fabris, Stefano A1 - Dollevoet, Twan A1 - Fischer, Frank A1 - Fügenschuh, Armin A1 - Galli, Laura A1 - Goverde, Rob M.P. A1 - Hansmann, Ronny A1 - Homfeld, Henning A1 - Huisman, Dennis A1 - Johann, Marc A1 - Klug, Torsten A1 - Törnquist Krasemann, Johanna A1 - Kroon, Leo A1 - Lamorgese, Leonardo A1 - Liers, Frauke A1 - Mannino, Carlo A1 - Medeossi, Giorgio A1 - Pacciarelli, Dario A1 - Reuther, Markus A1 - Schlechte, Thomas A1 - Schmidt, Marie A1 - Schöbel, Anita A1 - Schülldorf, Hanno A1 - Stieber, Anke A1 - Stiller, Sebastian A1 - Toth, Paolo A1 - Zimmermann, Uwe ED - Borndörfer, Ralf ED - Klug, Torsten ED - Lamorgese, Leonardo ED - Mannino, Carlo ED - Reuther, Markus ED - Schlechte, Thomas T1 - Handbook of Optimization in the Railway Industry N2 - This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the state-of-the-art. There are three main clusters of articles, corresponding to the classical stages of the planning process: strategic, tactical, and operational. These three clusters are further subdivided into five parts which correspond to the main phases of the railway network planning process: network assessment, capacity planning, timetabling, resource planning, and operational planning. Individual chapters cover: Simulation Capacity Assessment Network Design Train Routing Robust Timetabling Event Scheduling Track Allocation Blocking Shunting Rolling Stock Crew Scheduling Dispatching Delay Propagation Y1 - 2018 SN - 978-3-319-72152-1 U6 - https://doi.org/10.1007/978-3-319-72153-8 VL - 268 PB - Springer Verlag ER - TY - GEN A1 - Borndörfer, Ralf A1 - Reuther, Markus A1 - Schlechte, Thomas A1 - Weider, Steffen T1 - A Hypergraph Model for Railway Vehicle Rotation Planning N2 - We propose a model for the integrated optimization of vehicle rotations and vehicle compositions in long distance railway passenger transport. The main contribution of the paper is a hypergraph model that is able to handle the challenging technical requirements as well as very general stipulations with respect to the ``regularity'' of a schedule. The hypergraph model directly generalizes network flow models, replacing arcs with hyperarcs. Although NP-hard in general, the model is computationally well-behaved in practice. High quality solutions can be produced in reasonable time using high performance Integer Programming techniques, in particular, column generation and rapid branching. We show that, in this way, large-scale real world instances of our cooperation partner DB Fernverkehr can be solved. T3 - ZIB-Report - 11-36 KW - Rolling Stock Planning, Hypergraph Modeling, Integer Programming, Column Generation, Rapid Branching Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-32746 SN - 1438-0064 ER - TY - GEN A1 - Grimm, Boris A1 - Borndörfer, Ralf A1 - Reuther, Markus A1 - Schlechte, Thomas T1 - A Cut Separation Approach for the Rolling Stock Rotation Problem with Vehicle Maintenance T2 - 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019) N2 - For providing railway services the company’s railway rolling stock is one if not the most important ingredient. It decides about the number of passenger or cargo trips the company can offer, about the quality a passenger experiences the train ride and it is often related to the image of the company itself. Thus, it is highly desired to have the available rolling stock in the best shape possible. Moreover, in many countries, as Germany where our industrial partner DB Fernverkehr AG (DBF) is located, laws enforce regular vehicle inspections to ensure the safety of the passengers. This leads to rolling stock optimization problems with complex rules for vehicle maintenance. This problem is well studied in the literature for example see Maroti and Kroon 2005, or Cordeau et. al. 2001 for applications including vehicle maintenance. The contribution of this paper is a new algorithmic approach to solve the Rolling Stock Rotation Problem for the ICE high speed train fleet of DBF with included vehicle maintenance. It is based on a relaxation of a mixed integer linear programming model with an iterative cut generation to enforce the feasibility of a solution of the relaxation in the solution space of the original problem. The resulting mixed integer linear programming model is based on a hypergraph approach presented in Borndörfer et. al. 2015. The new approach is tested on real world instances modeling different scenarios for the ICE high speed train network in Germany and compared to the approaches of Reuther 2017 that are in operation at DB Fernverkehr AG. The approach shows a significant reduction of the run time to produce solutions with comparable or even better objective function values. T3 - ZIB-Report - 19-61 Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-75501 SN - 1438-0064 ER - TY - CHAP A1 - Grimm, Boris A1 - Borndörfer, Ralf A1 - Reuther, Markus A1 - Schlechte, Thomas ED - Cacchiani, Valentina ED - Marchetti-Spaccamela, Alberto T1 - A Cut Separation Approach for the Rolling Stock Rotation Problem with Vehicle Maintenance T2 - 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019) N2 - For providing railway services the company's railway rolling stock is one if not the most important ingredient. It decides about the number of passenger or cargo trips the company can offer, about the quality a passenger experiences the train ride and it is often related to the image of the company itself. Thus, it is highly desired to have the available rolling stock in the best shape possible. Moreover, in many countries, as Germany where our industrial partner DB Fernverkehr AG (DBF) is located, laws enforce regular vehicle inspections to ensure the safety of the passengers. This leads to rolling stock optimization problems with complex rules for vehicle maintenance. This problem is well studied in the literature for example see [Maróti and Kroon, 2005; Gábor Maróti and Leo G. Kroon, 2007], or [Cordeau et al., 2001] for applications including vehicle maintenance. The contribution of this paper is a new algorithmic approach to solve the Rolling Stock Rotation Problem for the ICE high speed train fleet of DBF with included vehicle maintenance. It is based on a relaxation of a mixed integer linear programming model with an iterative cut generation to enforce the feasibility of a solution of the relaxation in the solution space of the original problem. The resulting mixed integer linear programming model is based on a hypergraph approach presented in [Ralf Borndörfer et al., 2015]. The new approach is tested on real world instances modeling different scenarios for the ICE high speed train network in Germany and compared to the approaches of [Reuther, 2017] that are in operation at DB Fernverkehr AG. The approach shows a significant reduction of the run time to produce solutions with comparable or even better objective function values. Y1 - 2019 UR - https://drops.dagstuhl.de/opus/volltexte/2019/11413/ U6 - https://doi.org/10.4230/OASIcs.ATMOS.2019.1 VL - 75 SP - 1:1 EP - 1:12 PB - Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik CY - Dagstuhl, Germany ER - TY - CHAP A1 - Borndörfer, Ralf A1 - Karbstein, Marika A1 - Mehrgahrdt, Julika A1 - Reuther, Markus A1 - Schlechte, Thomas T1 - The Cycle Embedding Problem T2 - Operations Research Proceedings 2014 N2 - Given two hypergraphs, representing a fine and a coarse "layer", and a cycle cover of the nodes of the coarse layer, the cycle embedding problem (CEP) asks for an embedding of the coarse cycles into the fine layer. The CEP is NP-hard for general hypergraphs, but it can be solved in polynomial time for graphs. We propose an integer rogramming formulation for the CEP that provides a complete escription of the CEP polytope for the graphical case. The CEP comes up in railway vehicle rotation scheduling. We present computational results for problem instances of DB Fernverkehr AG that justify a sequential coarse-first-fine-second planning approach. Y1 - 2016 U6 - https://doi.org/10.1007/978-3-319-28697-6_65 SP - 465 EP - 472 ER - TY - CHAP A1 - Renken, Malte A1 - Ahmadi, Amin A1 - Borndörfer, Ralf A1 - Sahin, Guvenc A1 - Schlechte, Thomas T1 - Demand-Driven Line Planning with Selfish Routing T2 - Operations Research Proceedings 2017 N2 - Bus rapid transit systems in developing and newly industrialized countries are often operated at the limits of passenger capacity. In particular, demand during morning and afternoon peaks is hardly or even not covered with available line plans. In order to develop demand-driven line plans, we use two mathematical models in the form of integer programming problem formulations. While the actual demand data is specified with origin-destination pairs, the arc-based model considers the demand over the arcs derived from the origin-destination demand. In order to test the accuracy of the models in terms of demand satisfaction, we simulate the optimal solutions and compare number of transfers and travel times. We also question the effect of a selfish route choice behavior which in theory results in a Braess-like paradox by increasing the number of transfers when system capacity is increased with additional lines. Y1 - 2018 U6 - https://doi.org/10.1007/978-3-319-89920-6_91 SP - 687 EP - 692 PB - Springer International Publishing ER - TY - CHAP A1 - Schade, Stanley A1 - Schlechte, Thomas A1 - Witzig, Jakob T1 - Structure-based Decomposition for Pattern-Detection for Railway Timetables T2 - Operations Research Proceedings 2017 N2 - We consider the problem of pattern detection in large scale railway timetables. This problem arises in rolling stock optimization planning in order to identify invariant sections of the timetable for which a cyclic rotation plan is adequate. We propose a dual reduction technique which leads to an decomposition and enumeration method. Computational results for real world instances demonstrate that the method is able to produce optimal solutions as fast as standard MIP solvers. Y1 - 2018 U6 - https://doi.org/10.1007/978-3-319-89920-6_95 SP - 715 EP - 721 PB - Springer International Publishing ER -