Algorithms for railway crew management

被引:116
作者
Caprara, A
Fischetti, M
Toth, P
Vigo, D
Guida, PL
机构
[1] UNIV BOLOGNA,DEIS,BOLOGNA,ITALY
[2] UNIV UDINE,DIPARTIMENTO MATEMAT & INFORMAT,I-33100 UDINE,ITALY
关键词
crew management; railway optimization; algorithms; crew scheduling and rostering;
D O I
10.1007/BF02614314
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 State SpA, for solving crew scheduling and rostering problems. (C) 1997 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
引用
收藏
页码:125 / 141
页数:17
相关论文
共 36 条