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

DOI10.1016/j.cor.2009.03.023zbMath1177.90181OpenAlexW2075805791MaRDI QIDQ1046697

Natalia J. Rezanova, David M. Ryan

Publication date: 22 December 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.023

zbMATH Keywords

set partitioningconstraint branchingrail crew schedulingreal-time disruption recovery

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

The matching relaxation for a class of generalized set partitioning problems ⋮ Determining operations affected by delay in predictive train timetables ⋮ Application of an iterative framework for real-time railway rescheduling ⋮ Algorithms and implementation of a set partitioning approach for modular machining line design ⋮ Integer programming for minimal perturbation problems in university course timetabling ⋮ The home care crew scheduling problem: preference-based visit clustering and temporal dependencies ⋮ Real-time freight locomotive rescheduling and uncovered train detection during disruption ⋮ Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space ⋮ On the mixed set covering, packing and partitioning polytope ⋮ A survey on robustness in railway planning ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints

Uses Software

• Mosek

Cites Work

• A column generation approach for the rail crew re-scheduling problem
• Disruption management in the airline industry-concepts, models and methods
• On the integer properties of scheduling set partitioning models
• Simultaneous disruption recovery of a train timetable and crew roster in real time
• An Integer Programming Approach to the Vehicle Scheduling Problem
• A Column Generation Approach for Large-Scale Aircrew Rostering Problems
• Perfect zero–one matrices
• A Heuristic Method for the Set Covering Problem
• Selected Topics in Column Generation

This page was built for publication: The train driver recovery problem-a set partitioning based model and solution method