Adjusting a railway timetable in case of partial or complete blockades

Unexpected events, such as accidents or track damages, can have a significant impact on the railway system so that trains need to be canceled and delayed. In case of a disruption it is important that dispatchers quickly present a good solution in order to minimize the nuisance for the passengers. In this paper, we focus on adjusting the timetable of a passenger railway operator in case of major disruptions. Both a partial and a complete blockade of a railway line are considered. Given a disrupted infrastructure situation and a forecast of the characteristics of the disruption, our goal is to determine a disposition timetable, specifying which trains will still be operated during the disruption and determining the timetable of these trains. Without explicitly taking the rolling stock rescheduling problem into account, we develop our models such that the probability that feasible solutions to this problem exist, is high. The main objective is to maximize the service level offered to the passengers. We present integer programming formulations and test our models using instances from Netherlands Railways.     

A column generation approach for the rail crew re-scheduling problem

When tracks are out of service for maintenance during a certain period, trains cannot be operated on those tracks. This leads to a modified timetable, and results in infeasible rolling stock and crew schedules. Therefore, these schedules need to be repaired. The topic of this paper is the re-scheduling of crew.     

Investigation of mechanical properties of water-based friction modifier for railway applicationsRecherches des propriétés mécaniques du modificateur frottement dans une forme de l'émulsion d'eau applique dans les chemins de fer

This Note outlines the investigation of the water-based friction modifier used in railway technology. This investigation involves measurements made using a novel measuring stand, a new modelling of the modifier and the identification of its parameters using measured results. The proposed model of the modifier is composed of a dry friction slider, a dash-pot and a spring. The investigation contributes to a deeper understanding of the modifier's performance. To cite this article: J. Piotrowski, C. R. Mecanique 332 (2004).     

青藏铁路多年冻土工程地质特征及其评价

青藏高原多年冻土是地质历史时期高海拔寒冷气候条件下的产物,也是青藏铁路建设的三大难题之一;而多年冻土工程地质特征及其评价工作是作出合理、可靠的工程设计的基础。结合青藏铁路沿线多年冻土区的15个地形地貌分区,在青藏铁路多年冻土区选择了70个典型断面进行了地质勘查,采用地质钻探和室内试验相结合的方法,研究了各区的工程地质特征并对其工程地质类型进行了评价。研究表明:青藏铁路多年冻土区冻土类型多样,高含冰量冻土、厚层地下冰广泛分布,不同区段地温差异性较大,工程地质条件复杂多变,良好、一般、不良和极差的工程地质区段交错分布。     

Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths

We study the multicommodity network flow problem with fixed costs on paths, with specific application to the empty freight car distribution process of a rail operator. The classification costs for sending a group of cars do not depend on the number of cars in the group, as long as the group is kept together as one unit. Arcs correspond to trains, so we have capacity restrictions on arcs but fixed costs on the paths corresponding to routes for groups of cars. As solution method, we propose a Lagrangian based heuristic using dual subgradient search and primal heuristics based on path information of the Lagrangian subproblem solutions. The method illustrates several ways of exploiting the specific structures of the problem. Computational tests indicate that the method is able to generate fairly good primal feasible solutions and lower bounds on the optimal objective function value.     

Solving railroad blocking problem using ant colony optimization algorithm

The railroad blocking problem is one of the most important decision in freight railroads. The objective of this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and specifying the assignment of commodities to these blocks, while observing limits on the number and aggregate volume of the blocks assembled at each terminal. This paper presents a metaheuristic algorithm based on ant colony optimization for solving this problem. To evaluate the efficiency of the proposed algorithm and the quality of solutions, experimental analysis is conducted, using several simulated test problems. The results on the test problems are compared with those of solution generated with CPLEX software. The results show high efficiency and effectiveness of the proposed algorithms. The solution method is applied to build car blocking plan in Islamic Republic of Iran Railways. By applying the presented model, Iran Railways can reduce the operational cost considerably and save the time in shipping the freights as well.     

A Lagrangian-based heuristic for large-scale set covering problems

We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state-of-the-art codes on a test-bed provided by the company, which includes instances with sizes ranging from 50,000 variables and 500 constraints to 1,000,000 variables and 5000 constraints. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Corresponding author.This research was performed while the author was affiliated with IASI, CNR and Dipartimento di Informatica e Sistemistica, Università di Roma, La Sapienza, Italy.This research was partially supported by National Research Program Metodi di Ottimizzazione per le Decisioni, MURST, Roma, Italy.     

SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions

In this paper, we present a new approach to solve the railway rescheduling problem. This problem deals with the reparation of a disturbed railway timetable after incidents in such a way to minimize the difference between the original plan and the new provisional plan. We use a mixed integer linear programming (MIP) formulation that models this problem correctly. However, the large number of variables and constraints denies the possibility to solve this problem efficiently using a standard MIP solver. A new approach called SAPI (Statistical Analysis of Propagation of Incidents) has been developed to tackle the problem. The key point of SAPI is to estimate the probability that an event, one step of the itinerary of a train, is affected by a set of incidents. Using these probabilities, the search space is reduced, obtaining very good solutions in a short time. The method has been tested with two different networks located in France and Chile. The numerical results show that our procedure is viable in practice.