Rolling Stock Recovery Problem (original) (raw)

Short-term Rail Rolling Stock Rostering and Maintenance Scheduling

Transportation Research Procedia, 2014

This paper describes an optimization framework for railway rolling stock rostering and maintenance scheduling. A key problem in railway rostering planning requires covering a given set of services and maintenance works with limited rolling stock units. The problem is solved via a two-step approach that combines the scheduling tasks related to train services, short-term maintenance operations and empty runs. A commercial MIP solver is used for the development of a real-time decision support tool. A campaign of experiments on real-world scenarios from Trenitalia (Italian train operating company) illustrates the improvement achievable by the approach when compared to the practical solutions.

Re-scheduling in railways: the rolling stock balancing problem

2007

This paper addresses the Rolling Stock Balancing Problem (RSBP). This problem arises at a passenger railway operator when the rolling stock has to be re-scheduled due to changing circumstances. These problems arise both in the planning process and during operations.

A sequential approach to Rolling Stock management in Railway Rapid Transit Systems

Rolling stock is one of the most important operational issues for railway transportation companies. Rolling stock and infrastructure maintenance suppose about 75% of total annual cost for a typical railway transportation system (a metro or a urban railway network). Basically, rolling stock circulation consists of determining individual train paths over the network with the objective of minimizing costs while accomplishing a pre-defined schedule. Moreover, maintenance of train units should be also considered in some way. Due to its easy implementation, an interesting policy in Railway Rapid Transit (RRT) systems maintenance consists on designing rotating maintenance plans. In this paper we propose, in the context of RRT systems, a methodology based on the sequential resolution of two mixed integer programming models in order to develop rotating rolling stock circulation plans. The scheme can be applied to medium size RTS networks. Solution ensures a long-term maintenance policy that ...

Rescheduling of Railway Rolling Stock with Dynamic Passenger Flows

Transportation Science, 2014

Traditional rolling stock rescheduling applications either treat passengers as static objects whose influence on the system is unchanged in a disrupted situation, or they treat passenger behavior as a given input. In case of disruptions however, we may expect the flow of passengers to change significantly. In this paper we present a model for passenger flows during disruptions and we describe an iterative heuristic for optimizing the rolling stock to the disrupted passenger flows. The model is tested on realistic problem instances of NS, the major operator of passenger trains in the Netherlands.

Railway Rolling Stock Planning: Robustness Against Large Disruptions

Transportation Science, 2011

In this paper we describe a two-stage optimization model for determining robust rolling stock circulations for passenger trains. Here robustness means that the rolling stock circulations can better deal with large disruptions of the railway system. The two-stage optimization model is formulated as a large Mixed-Integer Linear Programming model. We first use Benders decomposition to determine optimal solutions for the LP-relaxation of this model. Then we use the cuts that were generated by the Benders decomposition for computing heuristic robust solutions for the two-stage optimization model. We call our method Benders heuristic.

Integrating Timetable Recovery and Rolling Stock Rescheduling

intranet.imet.gr

During daily operations of a railway network incidents may cause the railway traffic to deviate from the planned operations. In this situation new plans must be designed in order to operate under the new conditions and to recover network operations to the usual plan once the incident has finished.

The integrated rolling stock circulation and depot location problem in railway rapid transit systems

Transportation Research Part E: Logistics and Transportation Review, 2018

Rolling stock management is one of the key operational issues for a railway transportation company. It constitutes the fourth phase of the classical Railway Planning Process, after Network design, Line Planning and Services Scheduling/Timetabling. Rolling stock circulation consists of defining individual train paths over the network accomplishing pre-defined services. Those services are previously designed in order to attend certain passengers' demand, and fulfilling some design criteria. In this paper we propose, in the context of Railway Rapid Transit Systems, a general mixed integer programming model in order to design rolling stock circulation plans and simultaneously considering the problem of determining the number and location of rest facilities. The model yields then rolling stocks plans that facilitate the posterior design of rotating maintenance schemes. According to the problem structure, we propose a sequential solving approach. We first determine the minimum number of vehicles needed to perform the complete weekly train schedule. In a second phase, we obtain the set of daily routes that must be performed at each line every day. In a third stage, we deal with the problem of determining weekly circulations and depot locations by means of a Genetic Algorithm. The objective at this stage is to minimize empty movements and to equilibrate the number of kilometers covered by each unit. In order to illustrate the proposed approach, this is applied to design a rotating rolling stock plan for the RRT Network of Seville.

Train Scheduling and Rolling Stock Assignment in High Speed Trains

Procedia - Social and Behavioral Sciences, 2014

The Train Timetabling Problem (TTP) has been widely studied for freight and passenger rail systems. A lesser effort has been devoted to the study of high-speed rail systems. A modeling issue that has to be addressed is to model departure time choice of passengers on railway services. Passengers who use these systems attempt to travel at predetermined hours due to their daily life necessities (e.g., commuter trips). We incorporate all these features into TTP focusing on high-speed railway systems. We propose a Rail Scheduling and Rolling Stock (RSch-RS) model for timetable planning of high-speed railway systems. This model is composed of two essential elements: i) an infrastructure model for representing the railway network: it includes capacity constraints of the rail network and the Rolling-Stock constraints; and ii) a demand model that defines how the passengers choose the departure time. The resulting model is a mixed-integer programming model which objective function attempts to maximize the profit for the rail operator.

Maintenance routing for train units: The Scenario Model

Train units need regular preventive maintenance. Given the train units that require maintenance in the forthcoming 1-3 days, the rolling stock schedule must be adjusted so that these urgent units reach the maintenance facility in time. We present an integer programming model for this problem, give complexity results, suggest solution methods and report our computational results on practical instances of NS Reizigers, the main Dutch operator of passenger trains.