An Overview and Categorization of Approaches for Train Timetable Generation

A train timetable is a crucial component of railway transportation systems as it directly impacts the system’s performance and the customer satisfaction. Various approaches can be found in the literature that deal with timetable generation. However, the approaches proposed in the literature differ significantly in terms of the use case for which they are in tended. Differences in objective function, timetable periodicity, and solution methods have led to a confusing number of works on this topic. Therefore, this paper presents a com pact literature review of approaches to train timetable generation. The reviewed papers are briefly summarized and categorized by objective function and periodicity. Special emphasis is given to approaches that have been applied to real-world railway data

A MILP model for quasi-periodic strategic train timetabling

In railways, the long-term strategic planning is the process of evaluating improvements to the railway network (e.g., upgrading a single track line to a double track line) and changes to the composition/frequency of train services (e.g., adding 1 train per hour along a certain route). The effects of different combinations of infrastructure upgrades and updated train services (also called scenarios), are usually evaluated by creating new feasible timetables followed by extensive simulation. Strategic Train Timetabling (STT) is indeed the task of producing new tentative timetables for these what-if scenarios. Unlike the more classic train timetabling, STT can often overlook (or at least give less importance to) some complementary aspects, such as crew and rolling stock scheduling. On the other hand, the different scenarios are likely to lead to very different timetables, hindering the common and effective practice of using existing timetables to warm start the solution process. We introduce the concept of quasi-periodic timetables, that are timetables where certain subsets of trains need to start at almost (rather than precisely) the same minute of every period. The additional flexibility offered by quasi-periodic timetables turned out to be crucial in real-life scenarios characterized by elevated train traffic. We describe a MILP based approach for strategic quasi-periodic train timetabling and we test it on 4 different realistic what-if scenarios for an important line in Norway. The timetables produced by our algorithm were ultimately used by the Norwegian Railway Directorate to select 3 out of the 4 scenarios for phasing the progressive expansion of the JȪren line.publishedVersio

State of the Art Overview on Automatic Railway Timetable Generation and Optimization

In railway transportation, each train needs to have a timetable that specifies which track at which time will be occupied by it. This task can be addressed by automatization techniques both in generating a timetable and in optimizing an existing one. In this paper, we give an overview on the state of the art of these techniques. We study the computation of a technically valid slot for a train that guarantees a (short) spatial and temporal way through the network. Furthermore, the construction of a cyclic timetable where trains operate e.g. every 60 minutes, and the simultaneous construction of timetables for multiple trains are considered in this paper. Finally, timetables also need to be robust against minor delays. We will review the state of the art in the literature for these aspects of railway timetabling with respect to models, solution algorithms, complexity results and applications in practice

Inserting Extra Train Services on High-Speed Railway

With the aim of supporting future traffic needs, an account of how to reconstruct an existing cyclic timetable by inserting additional train services will be given in this paper. The Timetable-based Extra Train Services Inserting (TETSI) problem is regarded as an integration of railway scheduling and rescheduling problem. The TETSI problem therefore is considered involving many constraints, such as flexible running times, dwell times, headway and time windows. Characterized based on an event-activity graph, a general Mixed Integer Program model for this problem is formulated. In addition, several extensions to the general model are further proposed. The real-world constraints that concerning the acceleration and deceleration times, priority for overtaking, allowed adjustments, periodic structure and frequency of services are incorporated into the general model. From numerical investigations using data from Shanghai-Hangzhou High-Speed Railway in China, the proposed framework and associated techniques are tested and shown to be effective

Development of a prototype for the automated generation of timetable scenarios specified by the transport service intention

Within the next 5 to 10 years, public transport in Switzerland as well as in other European countries will experience major technological and organisational changes. However, changes will also take place on the customer side, resulting in different mobility behaviour and demand patterns. These changes will lead to additional challenges for transport service providers in private as well as public domains. Time to market will be a key success factor and it is unnecessary to mention that due to these factors the speed and flexibility of business processes in freight as well as in passenger transport industry have to be increased significantly. Within the railway value chain (line planning, timetabling and vehicle scheduling etc.) the coordination of the individual planning steps is a key success factor. SBB as the leading service provider in public transport in Switzerland has recognized this challenge and, together with various partners, initiated the strategic project Smart Rail 4.0. The ZHAW and especially the Institute for Data Analysis and Process Design (IDP) of the School of Engineering wants to be part of this transformation process and to contribute with research and educational activities. The IDP research therefore aims for the transformation of academic and scientific know-how to practical applicability. In a first step this concerns directly the current Smart Rail 4.0 TMS-PAS project activities, that concentrate on timetabling issues. The IDP project team considers the integration of the line planning and the timetabling process as crucial for practical applications. To address this in the current research project, we present an application concept that enables the integration of these two major process steps in the transport service value-chain. Although it turns out from our research, that the technical requirements for the integration of the process can be satisfied, rules and conditions for a closer cooperation of the involved business units, the train operating companies and the infrastructure operating company, have to be improved and to be worked out in more detail. In addition to a detailed application concept with use cases for the timetabling process we propose a methodology for computer aided timetable generation based on the central planning object known as ‘service intention’. The service intention can be used to iteratively develop the timetable relying on a ‘progressive feasibility assessment’, a feature that is requested in practice. Our proposed model is based on the ‘track-choice’ and line rotation extension of the commonly known method for the generation of periodic event schedules ‘PESP’. The extension makes use of the track infrastructure representation which is also used in the line planning and timetabling system Viriato. This system that is widely used by public transport planners and operators. With the help of Viriato, it is rather easy to configure the timetabling problem in sufficient detail. On the other side, the level of detail of the considered data is light enough to algorithmically solve practical timetabling problems of realistic sizes. Taking into consideration the technical and operational constraints given by rolling stock, station and track topology data on one hand, and the commercial requirements defined by a given line concept on the other, the method presented generates periodic timetables including train-track assignments. In the first step, the standardized data structure ‘service intention’ represents the line concept consisting of train paths and frequencies. Due to the utilization of infrastructure-based track capacities, we are also able to assess the feasibility of the line concept given. Additionally, the method allows for handling temporary resource restrictions (e.g. caused by construction sites or operational disturbances). In order to assess the performance of the resulting timetable we present a framework for performance measurement that addresses the customer convenience (in terms of start-to-end travel time) as well as operational stability requirements (in terms of delay sensitivity and critical relations)

Operations research in passenger railway transportation

In this paper, we give an overview of state-of-the-art OperationsResearch models and techniques used in passenger railwaytransportation. For each planning phase (strategic, tactical andoperational), we describe the planning problems arising there anddiscuss some models and algorithms to solve them. We do not onlyconsider classical, well-known topics such as timetabling, rollingstock scheduling and crew scheduling, but we also discuss somerecently developed topics as shunting and reliability oftimetables.Finally, we focus on several practical aspects for each of theseproblems at the largest Dutch railway operator, NS Reizigers.passenger railway transportation;operation research;planning problems

An adjustable robust optimization approach for periodic timetabling

In this paper, we consider the Robust Periodic Timetabling Problem (RPTP), the problem of designing a periodic timetable that can easily be adjusted in case of small periodic disturbances. We develop a solution method for a parametrized class of uncertainty regions. This class relates closely to uncertainty regions known in the robust optimization literature, and naturally defines a metric for the robustness of the timetable. The proposed solution method combines a linear decision rule with well-known reformulation techniques and cutting-plane methods. We show that the RPTP can be solved for practical-sized instances by applying the solution method to practical cases of Netherlands Railways (NS). In particular, we show that the trade-off between the efficiency and robustness of a timetable can be analyzed using our solution method

Optimization in railway timetabling for regional and intercity trains in Zealand: A case of study of DSB

The Train Timetabling Problem is one of the main tactical problems in the railway planning process. Depending on the size of the network, the problem can be hard to solve directly and alternative methods should be studied. In this thesis, the Train Timetabling Problem is formulated using a graph formu-lation that takes advantage of the symmetric timetabling strategy and assumed fixed running times between station. The problem is formulated for the morning rush hour period of the Regional and InterCity train network of Zealand. The solution method implemented is based on a Large Neighborhood Search model that iteratively applies a dive-and-cut-and-price procedure. An LP relax version of the problem is solved using Column Generation considering only a subset of columns and constraints. Each column corresponds to the train paths of a line that are found by shortest paths in the graphs. Then, violated constraints are added by separation and an heuristic process is applied to help finding integer solutions. Last, the passengers are routed on the network based on the found timetable and the passenger travel time calculated. The process is repeated taking into account the best transfers from the solution found. A parameter tuning is conducted to find the best algorithm setting. Then, the model is solved for different scenarios where the robustness and quality of the solution is analyzed. The model shows good performance in most of the scenarios being able to find good quality solutions relatively fast. The way the best transfers are considered between timetable solutions does not add significant value in terms of solution quality but could be useful from a planning perspective. In addition, most of the real-life conflicts are taken into account in the model but not all of them. As a result, the model can still be improved in order to provide completely conflict-free timetables. In general, the model appears to be useful for the timetabling planning process of DSB. It allows to test different network requirements and preferences easily. The model not only generates a timetable but also estimates the passenger travel time and the occupancy of the trains quite accurately. Also, any modification in the line plan can easily be included without affecting the core model.Outgoin