Railway crew scheduling: Models, methods and applications

The railway crew scheduling problem consists of finding the most efficient duty combination for railway crews to cover all trains and related activities for a defined period of time. Crew scheduling problems in transportation originate in airline and bus industries. In the 1990s, researchers developed sophisticated algorithms which were capable of solving the larger and more complex problem instances of railway operators. Practical implementations and decision support tools received very satisfying feedback from the industry. Since then, numerous real-world problems have been studied requiring innovative algorithmic approaches to the NP-hard problem. In this paper, we review 123 articles on railway crew scheduling focusing on more recent publications since 2000. After depicting crew scheduling in railway including the differences between transportation modes, our goal is to classify the literature according to model formulations, objectives, constraints and solution methods. By systematizing the collected articles, we identify research opportunities including integrated approaches with other planning stages, real-time rescheduling and a further investigation of the impact of robustness and employee satisfaction on the cost of railway crew schedules. (C) 2019 Elsevier B.V. All rights reserved.