ALGORITHMS FOR RAILWAY CREW MANAGEMENT

Citation
A. Caprara et al., ALGORITHMS FOR RAILWAY CREW MANAGEMENT, Mathematical programming, 79(1-3), 1997, pp. 125-141
Citations number
35
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Science Software Graphycs Programming
Journal title
ISSN journal
00255610
Volume
79
Issue
1-3
Year of publication
1997
Pages
125 - 141
Database
ISI
SICI code
0025-5610(1997)79:1-3<125:AFRCM>2.0.ZU;2-7
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 cr ew 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 a pplications. In particular we discuss in some detail the solution tech niques currently adopted at the Italian railway company, Ferrovie dell o State SpA, for solving crew scheduling and rostering problems. (C) 1 997 The Mathematical Programming Society, Inc. Published by Elsevier S cience B.V.