Complex delay dynamics on railway networks: from universal laws to realistic modelling

Railways are a key infrastructure for any modern country. The reliability and resilience of this peculiar transportation system may be challenged by different shocks such as disruptions, strikes and adverse weather conditions. These events compromise the correct functioning of the system and trigger the spreading of delays into the railway network on a daily basis. Despite their importance, a general theoretical understanding of the underlying causes of these disruptions is still lacking. In this work, we analyse the Italian and German railway networks by leveraging on the train schedules and actual delay data retrieved during the year 2015. We use {these} data to infer simple statistical laws ruling the emergence of localized delays in different areas of the network and we model the spreading of these delays throughout the network by exploiting a framework inspired by epidemic spreading models. Our model offers a fast and easy tool for the preliminary assessment of the {effectiveness of} traffic handling policies, and of the railway {network} criticalities.Comment: 32 pages (with appendix), 28 Figures (with appendix), 2 Table

Applicability of rescheduling strategies in tram networks

Highly utilized tram networks, where multiple lines share tracks and stations, are inevitably affected by dis-turbances during daily operation. While consequences of small, local perturbations may be counteracted by schedule characteristics, e.g. robustness, long lasting disturbances have to be addressed by dispatchers via schedule adjustments. Several methods for the identification and assessment of different rescheduling actions have been proposed. However, most of these methods have only been applied in railway networks. Therefore, in this paper we compare different rescheduling strategies and assess their applicability in tram networks. This paper begins with a description of possible rescheduling actions and the requirements and limitations to rescheduling strategies in tram networks. Different strategies for railway networks are then described and compared in regard to their applicability in tram networks

Evaluating the Applicability of Advanced Techniques for Practical Real-time Train Scheduling

AbstractThis paper reports on the practical applicability of published techniques for real-time train scheduling. The final goal is the development of an advanced decision support system for supporting dispatchers’ work and for guiding them toward near-optimal real-time re-timing, re-ordering and re-routing decisions. The paper focuses on the optimization system AGLIBRARY that manages trains at the microscopic level of block sections and block signals and at a precision of seconds. The system outcome is a detailed conflict-free train schedule, being able to avoid deadlocks and to minimize train delays. Experiments on a British railway nearby London demonstrate that AGLIBRARY can quickly compute near-optimal solutions

Applicability of rescheduling strategies in tram networks

Highly utilized tram networks, where multiple lines share tracks and stations, are inevitably affected by dis-turbances during daily operation. While consequences of small, local perturbations may be counteracted by schedule characteristics, e.g. robustness, long lasting disturbances have to be addressed by dispatchers via schedule adjustments. Several methods for the identification and assessment of different rescheduling actions have been proposed. However, most of these methods have only been applied in railway networks. Therefore, in this paper we compare different rescheduling strategies and assess their applicability in tram networks. This paper begins with a description of possible rescheduling actions and the requirements and limitations to rescheduling strategies in tram networks. Different strategies for railway networks are then described and compared in regard to their applicability in tram networks

Simulation and Control of Groups of People in Multi-modal Mobility

Tourism and transport are constantly growing and, with it, the movements of travellers. This entails two fundamental effects on which we must focus: control of mass tourism and the organization of transport. Good transport organization and travel planning avoid crowds and therefore mass tourism. This allows promoting sustainable tourism in which it is sought to offer a quality service to tourists taking care of the environment. In this thesis the objective is to manage the flow of groups of people through means of transport. This control of groups of people is aimed at customer satisfaction by offering quality tourism. On the one hand, the study focuses on the problem to mitigate the negative effects due to mass arrivals in touristic locations. A TEN network has been developed to define the optimal tours for different groups of tourists. A related mixed integer quadratic optimization model has been developed with three main objectives: it minimizes the maximum value of occupancy in the selected destinations to limit mass tourism, reduces the divergence between the proposed visit tour and one required by the tourist group and the overall duration of their visit, and a heuristic approach has been introduced. On the other hand, it has been implemented a railway scheduling and rescheduling problem introducing optimization-based and min-max approaches on the regional and high-speed railway network. The scheduling model defines the best schedules for a set of trains considering costumers\u2019 demand and the priority of the trains to cover the rail sections in case of conflict on the railway lines. Consecutively, the generated feasible timetables are used to minimize possible consequences due to events that may negatively affect the real time traffic management. The main contribution of this section is the introduction in the second approach the innovative concept to prioritize the train that can access on the block section in case of conflicts on the network

Railway Capacity Enhancement with Modern Signalling Systems – A Literature Review

In times of ever stronger awareness of environmental protection and potentiation of a beneficial modal split, the railway sector with efficient asset utilization and proper investment planning has the highest chance of meeting customer expectations and attracting new users more effectively. Continuous increase in railway demand leads to an increase in the utilization of railway infrastructure, and the inevitable lack of capacity, a burning problem that many national railways are continually facing. To address it more effectively, this paper reviews available methodologies for railway capacity determination and techniques for its enhancement in the recent scientific literature. Particular focus is given to the possibility of increasing railway capacity through signalling systems and installing the European Train Control System (ETCS). The most important relationships with segments of existing research have been identified, and in line with this, the directions for a potential continuation of research are suggested

Stochastic Improvement of Cyclic Railway Timetables

Real-time railway operations are subject to stochastic disturbances. However, a railway timetable is a deterministic plan. Thus a timetable should be designed in such a way that it can cope with the stochastic disturbances as well as possible. For that purpose, a timetable usually contains time supplements in several process times and buffer times between pairs of consecutive trains. This paper describes a Stochastic Optimization Model that can be used to allocate the time supplements and the buffer times in a given timetable in such a way that the timetable becomes maximally robust against stochastic disturbances. The Stochastic Optimization Model was tested on several instances of NS Reizigers, the main operator of passenger trains in the Netherlands. Moreover, a timetable that was computed by the model was operated in practice in a timetable experiment on the so-called “Zaanlijn”. The results show that the average delays of trains can often be reduced significantly by applying relatively small modifications to a given timetable

Using information engineering to understand the impact of train positioning uncertainties on railway subsystems

Many studies propose new advanced railway subsystems, such as Driver Advisory System (DAS), Automatic Door Operation (ADO) and Traffic Management System (TMS), designed to improve the overall performance of current railway systems. Real time train positioning information is one of the key pieces of input data for most of these new subsystems. Many studies presenting and examining the effectiveness of such subsystems assume the availability of very accurate train positioning data in real time. However, providing and using high accuracy positioning data may not always be the most cost-effective solution, nor is it always available. The accuracy of train position information is varied, based on the technological complexity of the positioning systems and the methods that are used. In reality, different subsystems, henceforth referred to as ‘applications’, need different minimum resolutions of train positioning data to work effectively, and uncertainty or inaccuracy in this data may reduce the effectiveness of the new applications. However, the trade-off between the accuracy of the positioning data and the required effectiveness of the proposed applications is so far not clear. A framework for assessing the impact of uncertainties in train positions against application performance has been developed. The required performance of the application is assessed based on the characteristics of the railway system, consisting of the infrastructure, rolling stock and operational data. The uncertainty in the train positioning data is considered based on the characteristics of the positioning system. The framework is applied to determine the impact of the positioning uncertainty on the application’s outcome. So, in that way, the desired position resolution associated with acceptable application performance can be characterised. In this thesis, the framework described above is implemented for DAS and TMS applications to understand the influence of positioning uncertainty on their fundamental functions compared to base case with high accuracy (actual position). A DAS system is modelled and implemented with uncertainty characteristic of a Global Navigation Satellite System (GNSS). The train energy consumption and journey time are used as performance measures to evaluate the impact of these uncertainties compared to a base case. A TMS is modelled and implemented with the uncertainties of an on-board low-cost low-accuracy positioning system. The impact of positioning uncertainty on the modelled TMS is evaluated in terms of arrival punctuality for different levels of capacity consumption. The implementation of the framework for DAS and TMS applications determines the following: • which of the application functions are influenced by positioning uncertainty; • how positioning uncertainty influences the application output variables; • how the impact of positioning uncertainties can be identified, through the application output variables, whilst considering the impact of other railway uncertainties; • what is the impact of the underperforming application, due to positioning uncertainty, on the whole railway system in terms of energy, punctuality and capacity

Integer programming based solution approaches for the train dispatching problem

Railroads face the challenge of competing with the trucking industry in a fastpaced environment. In this respect, they are working toward running freight trains on schedule and reducing travel times. The planned train schedules consist of departure and arrival times at main stations on the rail network. A detailed timetable, on the other hand, consists of the departure and arrival times of each train in each track section of its route. The train dispatching problem aims to determine detailed timetables over a rail network in order to minimize deviations from the planned schedule. We provide a new integer programming formulation for this problem based on a spacetime network; we propose heuristic algorithms to solve it and present computational results of these algorithms. Our approach includes some realistic constraints that have not been previously considered as well as all the assumptions and practical issues considered by the earlier works