Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling

Authors:
Daniel Potthoff;Dennis Huisman;Guy Desaulniers
Affiliations:
Econometric Institute and ECOPT, Erasmus University Rotterdam, NL-3000 DR Rotterdam, The Netherlands, and Department of Logistics, Netherlands Railways, NL-3500 HA Utrecht, The Netherlands;Econometric Institute and ECOPT, Erasmus University Rotterdam, NL-3000 DR Rotterdam, The Netherlands, and Department of Logistics, Netherlands Railways, NL-3500 HA Utrecht, The Netherlands;École Polytechnique de Montréal and GERAD, Department of Mathematics and Industrial Engineering, Montréal, Québec H3C 3AT, Canada
Venue:
Transportation Science
Year:
2010

Citing 13
Cited 0

A New Era for Crew Recovery at Continental Airlines

Interfaces
The Operational Airline Crew Scheduling Problem

Transportation Science
A Heuristic Method for the Set Covering Problem

Operations Research
Airline Crew Recovery

Transportation Science
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research
Simultaneous disruption recovery of a train timetable and crew roster in real time

Computers and Operations Research
Duty-period-based network model for crew rescheduling in European airlines

Journal of Scheduling
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A comparison of five heuristics for the multiple depot vehicle scheduling problem

Journal of Scheduling
The New Dutch Timetable: The OR Revolution

Interfaces
The train driver recovery problem-A set partitioning based model and solution method

Computers and Operations Research
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Networks - Route 2007
Disruption Management in Passenger Railway Transportation

Robust and Online Large-Scale Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Dutch railway network experiences about three large disruptions per day on average. In this paper, we present an algorithm to reschedule the crews when such a disruption occurs. The algorithm is based on column generation techniques combined with Lagrangian heuristics. Since the number of duties is very large in practical instances, we first define a core problem of tractable size. If some tasks remain uncovered in the solution of the core problem, we perform a neighborhood exploration to improve the solution. Computational experiments with real-life instances show that our method is capable of producing good solutions within a couple of minutes of computation time.