Optimizing the Cargo Express Service of Swiss Federal Railways

被引:23
作者
Ceselli, Alberto [1 ]
Gatto, Michael [2 ]
Luebbecke, Marco E. [3 ]
Nunkesser, Marc [2 ]
Schilling, Heiko [3 ]
机构
[1] Univ Milan, Dipartimento Tecnol Informaz, I-26013 Crema, Italy
[2] ETH, Dept Comp Sci, CH-8092 Zurich, Switzerland
[3] Tech Univ Berlin, Inst Math, D-10623 Berlin, Germany
关键词
railway optimization; freight transportation; hub-and-spoke systems; column generation;
D O I
10.1287/trsc.1080.0246
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The Cargo Express service of Swiss Federal Railways (SBB Cargo) offers fast overnight transportation of goods between selected train stations in Switzerland and is operated as a hub-and-spoke system with two hubs. We present three different models for planning the operation of this service as a whole. All models capture the underlying optimization problem with a high level of detail: Traffic routing, train routing, makeup, scheduling, and locomotive assignment are all addressed. At the same time we respect hard constraints like tight service time windows and train capacities, and we avoid hub overloading. We describe our approaches for obtaining provably good quality solutions. Our algorithmic techniques involve branch-and-cut, branch-and-price, and problem-specific exact and heuristic acceleration methods. We conclude our study with computational results on realistic data.
引用
收藏
页码:450 / 465
页数:16
相关论文
共 44 条
[1]  
ACHTERBERG T, 2007, THESIS TU BERLIN BER
[2]   Solving real-life railroad blocking problems [J].
Ahuja, Ravindra K. ;
Jha, Krishna C. ;
Liu, Jian .
INTERFACES, 2007, 37 (05) :404-419
[3]   MODELS FOR RAIL TRANSPORTATION [J].
ASSAD, AA .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1980, 14 (03) :205-220
[4]  
AUSIELLO G, 1998, COMPLEXITY APPROXIMA
[5]   AN ALGORITHM FOR THE RESOURCE CONSTRAINED SHORTEST-PATH PROBLEM [J].
BEASLEY, JE ;
CHRISTOFIDES, N .
NETWORKS, 1989, 19 (04) :379-394
[6]  
BLASUM U, 2000, ZPR2000386 ZENTR ANG
[7]   Accelerated label setting algorithms for the elementary resource constrained shortest path problem [J].
Boland, N ;
Dethridge, J ;
Dumitrescu, I .
OPERATIONS RESEARCH LETTERS, 2006, 34 (01) :58-68
[8]  
CAMPETELLA M, 2006, ATMOS 2006
[9]   A branch-and-price algorithm for the capacitated p-median problem [J].
Ceselli, A ;
Righini, G .
NETWORKS, 2005, 45 (03) :125-142
[10]  
CESELLI A, 2006, IMPLEMENTATION EDGE