Algorithms for railway crew management

Algorithms for railway crew management

0.00 Avg rating0 Votes
Article ID: iaor1999773
Country: Netherlands
Volume: 79
Issue: 1/3
Start Page Number: 125
End Page Number: 141
Publication Date: Oct 1997
Journal: Mathematical Programming
Authors: , , , ,
Keywords: scheduling, programming: integer, personnel & manpower planning
Abstract:

Crew management is concerned with building the work schedules of crews needed to cover a planned timetable. This is a well-known problem in Operations Research and has been historically associated with airlines and mass-transit companies. More recently, railway applications have also come on the scene, especially in Europe. In practice, the overall crew management problem is decomposed into two subproblems, called crew scheduling and crew rostering. In this paper, we give an outline of different ways of modeling the two subproblems and possible solution methods. Two main solution approaches are illustrated for real-world applications. In particular we discuss in some detail the solution techniques currently adopted at the Italian railway company, Ferrovie dello Stato SpA, for solving crew scheduling and rostering problems.

Reviews

Required fields are marked *. Your email address will not be published.