Integrating Timetabling and Crew Scheduling at a Freight Railway Operator

被引:20
作者
Bach, Lukas [1 ,2 ]
Dollevoet, Twan [3 ,4 ]
Huisman, Dennis [3 ,4 ,5 ]
机构
[1] Aarhus Univ, Dept Econ & Business, Cluster Operat Res & Logist, DK-8210 Aarhus V, Denmark
[2] SINTEF ICT, Dept Appl Math, N-0316 Oslo, Norway
[3] Erasmus Univ, Erasmus Sch Econ, Erasmus Ctr Optimizat Publ Transport, NL-3000 DR Rotterdam, Netherlands
[4] Erasmus Univ, Erasmus Sch Econ, Inst Econometr, NL-3000 DR Rotterdam, Netherlands
[5] Netherlands Railways, Proc Qual & Innovat, NL-3500 HA Utrecht, Netherlands
关键词
railway crew planning; vehicle and crew scheduling; partial integration; branch and price; COLUMN GENERATION; VEHICLE; CONSTRAINTS; ALGORITHM;
D O I
10.1287/trsc.2015.0648
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We investigate to what degree we can integrate a train timetabling/engine scheduling problem with a crew scheduling problem. In the timetabling/engine scheduling problem, we determine for each demand a specific time within its time window when the demand should be serviced. Furthermore, we generate engine duties for the demands. In our solution approach for the overall problem, we first obtain an optimal solution for the timetabling/engine scheduling problem. When solving the crew scheduling problem, we then exploit the fact that numerous optimal and near optimal solutions exist for the previous problem. We consider all these solutions that can be obtained from the optimal engine schedule by shifting the demands in time, while keeping the order of demands in the engine duties intact. In particular, in the crew scheduling stage it is allowed to retime the service of demands if the additional cost is outweighed by the crew savings. This information is implemented in a mathematical model for the crew scheduling problem. The model is solved using a column generation scheme. We perform computational experiments based on a case at a freight railway operator, DB Schenker Rail Scandinavia, and show that significant cost savings can be achieved.
引用
收藏
页码:878 / 891
页数:14
相关论文
共 25 条
[1]   Solving large scale crew scheduling problems in practice [J].
Abbink E.J.W. ;
Albino L. ;
Dollevoet T. ;
Huisman D. ;
Roussado J. ;
Saldanha R.L. .
Public Transport, 2011, 3 (2) :149-164
[2]  
BACH L., 2014, THESIS
[3]   Freight railway operator timetabling and engine scheduling [J].
Bach, Lukas ;
Gendreau, Michel ;
Wohlk, Sanne .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 241 (02) :309-319
[4]   A heuristic method for the set covering problem [J].
Caprara, A ;
Fischetti, M ;
Toth, P .
OPERATIONS RESEARCH, 1999, 47 (05) :730-743
[5]  
Caprara A, 2007, HBK OPERAT RES MANAG, V14, P129, DOI 10.1016/S0927-0507(06)14003-7
[6]  
de Groot SW, 2008, LECT NOTES ECON MATH, V600, P43
[7]   Dynamic aggregation of set-partitioning constraints in column generation [J].
Elhallaoui, I ;
Villeneuve, D .
OPERATIONS RESEARCH, 2005, 53 (04) :632-645
[8]   An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems [J].
Feillet, D ;
Dejax, P ;
Gendreau, M ;
Gueguen, C .
NETWORKS, 2004, 44 (03) :216-229
[9]   Models and algorithms for integration of vehicle and crew scheduling [J].
Freling, R ;
Huisman, D ;
Wagelmans, APM .
JOURNAL OF SCHEDULING, 2003, 6 (01) :63-85
[10]  
Gintner V, 2008, LECT NOTES ECON MATH, V600, P25