Dynamic railway junction rescheduling using population based ant colony optimisation

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Efficient rescheduling after a perturbation is an important concern of the railway industry. Extreme delays can result in large fines for the train company as well as dissatisfied customers. The problem is exacerbated by the fact that it is a dynamic one; more timetabled trains may be arriving as the perturbed trains are waiting to be rescheduled. The new trains may have different priorities to the existing trains and thus the rescheduling problem is a dynamic one that changes over time. The aim of this research is to apply a population-based ant colony optimisation algorithm to address this dynamic railway junction rescheduling problem using a simulator modelled on a real-world junction in the UK railway network. The results are promising: the algorithm performs well, particularly when the dynamic changes are of a high magnitude and frequency

Algorithmic Support for Railway Disruption Management

Disruptions of a railway system are responsible for longer travel times and much discomfort for the passengers. Since disruptions are inevitable, the railway system should be prepared to deal with them effectively. This paper explains that, in case of a disruption, rescheduling the timetable, the rolling stock circulation, and the crew duties is so complex that solving them manually is too time consuming in a time critical situation where every minute counts. Therefore, algorithmic support is badly needed. To that end, we describe models and algorithms for real-time rolling stock rescheduling and real-time crew rescheduling that are currently being developed and that are to be used as the kernel of decision support tools for disruption management. Furthermore, this paper argues that a stronger passenger orientation, facilitated by powerful algorithmic support, will allow to mitigate the adverse effects of the disruptions for the passengers. The latter will contribute to an increased service quality provided by the railway system. This will be instrumental in increasing the market share of the public transport system in the mobility market.

Railway Crew Rescheduling with Retiming

Railway operations are disrupted frequently, e.g. the Dutch railway network experiences about three large disruptions per day on average. In such a disrupted situation railway operators need to quickly adjust their resource schedules. Nowadays, the timetable, the rolling stock and the crew schedule are recovered in a sequential way. In this paper, we model and solve the crew rescheduling problem with retiming. This problem extends the crew rescheduling problem by the possibility to delay the departure of some trains. In this way we partly integrate timetable adjustment and crew rescheduling. The algorithm is based on column generation techniques combined with Lagrangian heuristics. In order to prevent a large increase in computational time, retiming is allowed only for a limited number of trains where it seems very promising. Computational experiments with real-life disruption data show that, compared to the classical approach, it is possible to find better solutions by using crew rescheduling with retiming.

Railway traffic disturbance management by means of control strategies applied to operations in the transit system

Railway systems in metropolitan areas support a high density of daily traffic that is exposed to different types of disturbances in the service. An interesting topic in the literature is to obtain action protocols in the presence of contingencies which can affect the system operation, avoiding the propagation of perturbation and minimizing its negative consequences. Assume that, with a small margin of time (e.g. one day), the decision-maker of the transportation network is knowing that a part of the train fleet will become inoperative temporarily along a specific transit line and none additional vehicle will be able to restore the affected services. The decision to be taken in consequence will require to reschedule the existing services by possibly reducing the number of expeditions (line runs). This will affect travellers who regularly use the transit system to get around. Consider that the decision-maker aims to lose the least number of passengers as a consequence of having introduced changes into the transit line. A strategy that could be applied in this context is to remove those line runs which are historically less used by travellers without affecting the remaining services. Another alternative strategy might be to reschedule the timetables of the available units, taking into account the pattern of arrivals of users to the boarding stations and the user behavior during waiting times (announced in situ). The aim of this work consists of assessing the strategy of train rescheduling along the current transportation line when the supply must be reduced in order to reinforce the service of another line, exploited by the same public operator, which has suffered an incidence or emergency.Ministerio de Economía y CompetitividadFondo Europeo de Desarrollo Regiona

Ant Colony Optimisation for Dynamic and Dynamic Multi-objective Railway Rescheduling Problems

Recovering the timetable after a delay is essential to the smooth and efficient operation of the railways for both passengers and railway operators. Most current railway rescheduling research concentrates on static problems where all delays are known about in advance. However, due to the unpredictable nature of the railway system, it is possible that further unforeseen incidents could occur while the trains are running to the new rescheduled timetable. This will change the problem, making it a dynamic problem that changes over time. The aim of this work is to investigate the application of ant colony optimisation (ACO) to dynamic and dynamic multiobjective railway rescheduling problems. ACO is a promising approach for dynamic combinatorial optimisation problems as its inbuilt mechanisms allow it to adapt to the new environment while retaining potentially useful information from the previous environment. In addition, ACO is able to handle multi-objective problems by the addition of multiple colonies and/or multiple pheromone and heuristic matrices. The contributions of this work are the development of a junction simulator to model unique dynamic and multi-objective railway rescheduling problems and an investigation into the application of ACO algorithms to solve those problems. A further contribution is the development of a unique two-colony ACO framework to solve the separate problems of platform reallocation and train resequencing at a UK railway station in dynamic delay scenarios. Results showed that ACO can be e ectively applied to the rescheduling of trains in both dynamic and dynamic multi-objective rescheduling problems. In the dynamic junction rescheduling problem ACO outperformed First Come First Served (FCFS), while in the dynamic multi-objective rescheduling problem ACO outperformed FCFS and Non-dominated Sorting Genetic Algorithm II (NSGA-II), a stateof- the-art multi-objective algorithm. When considering platform reallocation and rescheduling in dynamic environments, ACO outperformed Variable Neighbourhood Search (VNS), Tabu Search (TS) and running with no rescheduling algorithm. These results suggest that ACO shows promise for the rescheduling of trains in both dynamic and dynamic multi-objective environments.Engineering and Physical Sciences Research Council (EPSRC

A column generation approach to solve the crew re-scheduling problem

When tracks are out of service for maintenance during a certainperiod, trains cannot be operated on those tracks. This leads to amodified timetable, and results in infeasible rolling stock andcrew schedules. Therefore, these schedules need to be repaired.The topic of this paper is the rescheduling of crew.In this paper, we define the Crew Re-Scheduling Problem (CRSP).Furthermore, we show that it can be formulated as a large-scaleset covering problem. The problem is solved with a columngeneration based algorithm. The performance of the algorithm istested on real-world instances of NS, the largest passengerrailway operator in the Netherlands. Finally, we discuss somebenefits of the proposed methodology for the company.column generation;transportation;railways;crew re-scheduling;large-scale optimization

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

Susceptibility of optimal train schedules to stochastic disturbances of process times

This work focuses on the stochastic evaluation of train schedules computed by a microscopic scheduler of railway operations based on deterministic information. The research question is to assess the degree of sensitivity of various rescheduling algorithms to variations in process times (running and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced rescheduling algorithms. Computational results are based on a complex and densely occupied Dutch railway area; train delays are computed based on accepted statistical distributions, and dwell and running times of trains are subject to additional stochastic variations. From the results obtained on a real case study, an advanced branch and bound algorithm, on average, outperforms a First In First Out scheduling rule both in deterministic and stochastic traffic scenarios. However, the characteristic of the stochastic processes and the way a stochastic instance is handled turn out to have a serious impact on the scheduler performance

A mixed integer linear programming model with heuristic improvements for single-track railway rescheduling problem

A rescheduling algorithm for trains on a single-track railway was developed in case of disturbances that would cause conflicts between trains. This algorithm is based on mixed integer linear programming (MILP) with speed-up routines. The model considers station capacities explicitly (i.e., the number of available tracks for meeting and overtaking operations). Because the model is too hard for the solvers (CPLEX in this study) to tackle, three speed-up routines were devised when rescheduling trains. These routines are a greedy heuristic to reduce the solution space, using the lazy constraint attribute of the solver and a multiobjective approach to find a good initial feasible solution that conforms to actual railway operation. The algorithm was tested on a hypothetical rail line for different sizes of timetable instances with disturbed trains in a maximum two-hour time horizon. It managed to solve the hardest instances within a three-minute time limit thus minimizing the total weighted delay of rescheduled trains. The optimality gap metric is used to show the effectiveness and efficiencies of the speed-up heuristics developed