Allocation of Railway Rolling Stock for Passenger Trains

Abstract

For a commercially operating railway company, providing a high level of service for the passengers is of utmost importance. The latter requires a high punctuality of the trains and an adequate rolling stock capacity. Unfortunately, the latter is currently (2002) one of the bottlenecks in the service provision by the main Dutch railway operator NS Reizigers. Especially during the morning rush hours, many passengers cannot be transported according to the usual service standards due to a shortage of the rolling stock capacity. On the other hand, a more effective allocation of the available rolling stock capacity seems to be feasible, since there are also a few trains with some slack capacity.The effectiveness of the rolling stock capacity is determined mainly by the allocation of the train types and subtypes to the lines. Therefore, we describe in this paper a model that can be used to find an optimal allocation of train types and subtypes to train series. This optimal allocation is more effective than the manually planned one, which is accomplished by minimizing the shortages of capacity during the rush hours.The model is implemented in the modeling language OPL Studio 3.1, solved by CPLEX 7.0, and tested on several scenarios based on the 2001-2002 timetable of NS Reizigers. The results of the model were received positively, both by the planners and by the management in practice, since these results showed that a significant service improvement over the manually planned allocation can be achieved within a shorter throughput time of the involved part of the planning process.

Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem

“…His model and solution approaches inspired later researchers. Abbink et al [17] studied the marshaling of train-sets during morning rush hours; the goal of the model was to minimize shortages of train seats. This study contributed to passenger service during rush hours.…”

Solving a real-world train-unit assignment problem

“…There are a few references that consider the assignment of TUs: [1,2,15,23,25]. Most of them consider the case in which there is a very small number of distinct TU types (two in most cases).…”

“…The objective is to maximize the expected profit for the company and the problem is solved by means of stochastic optimization, branch-and-bound and column generation. In [1], Abbink et al present an ILP formulation with the objective of minimizing the seat shortages during the rush hours. Alfieri et al [2] propose an ILP model for the case of multiple TU types, aimed at satisfying the seat requests while minimizing the travel distance.…”

A Short Turning Strategy for Train Scheduling Optimization in an Urban Rail Transit Line: The Case of Beijing Subway Line 4

“…Peeters and Kroon [29] developed an integer programming model to find an efficient railway train circulation on a set of interacting train lines by a branch-and-price algorithm. Abbink et al [30] proposed a model to obtain an optimal allocation of railway train with the objective to minimize the shortages of capacity during the rush hours, where the optimal solution is more effective than the manually planned one. Lai et al [31] developed a model which covered a lot of characteristics, such as train, inspection, utilization path, and operation.…”