Circulation of railway rolling stock: a branch-and-price approach

Authors:
Marc Peeters;Leo Kroon
Affiliations:
Electrabel, Risk Asset and Liability Management, Place de l'Université 16, 1348 Louvain-la-Neuve, Belgium;NS Reizigers, Department of Logistics, P.O. Box 2025, 3500 HA Utrecht, The Netherlands and Rotterdam School of Management, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR, Rotterdam, The Neth ...
Venue:
Computers and Operations Research
Year:
2008

Citing 10
Cited 3

Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Schedule Optimization at Sncf: From Conception to Day of Departure

Interfaces
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem

Transportation Science
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Operations Research
Simultaneous Assignment of Locomotives and Cars to Passenger Trains

Operations Research
A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation

INFORMS Journal on Computing
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research
Allocation of Railway Rolling Stock for Passenger Trains

Transportation Science
Maintenance Routing for Train Units: The Transition Model

Transportation Science
Efficient Circulation of Railway Rolling Stock

Transportation Science

Efficient Circulation of Railway Rolling Stock

Transportation Science
Models and algorithms for the train unit assignment problem

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A Lagrangian heuristic for a train-unit assignment problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we describe a model and a branch-and-price algorithm to determine an efficient railway rolling stock circulation on a set of interacting train lines. Given the timetable and the passengers' seat demand, the model determines an allocation of rolling stock to the daily trips. In order to efficiently utilize the train units, they can be added to or removed from the trains at some stations along the lines. These changes in train compositions are subject to several constraints, mainly corresponding to the order of the train units within the trains. A solution is evaluated based on three criteria, i.e. (i) the service to the passengers, (ii) the robustness, and (iii) the cost of the circulation. The developed branch-and-price algorithm was tested on a number of real-life instances of NS Reizigers, the main Dutch operator of passenger trains, thereby outperforming the commercial solver CPLEX 8.0.