Optimizing the Simplon railway corridor

被引:4
作者
Borndoerfer, Ralf [1 ]
Erol, Berkan [1 ]
Graffagnino, Thomas [2 ]
Schlechte, Thomas [1 ]
Swarat, Elmar [1 ]
机构
[1] Zuse Inst Berlin, D-14195 Berlin, Germany
[2] Schweizer Bundesbahnen SBB AG, Infrastruktur Fahrplan & Netzdesign, CH-300 Bern 65, Switzerland
关键词
Railway track allocation; Network aggregation; Case study; Simplon corridor; COLUMN-GENERATION APPROACH;
D O I
10.1007/s10479-012-1260-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a case study of a railway timetable optimization for the very dense Simplon corridor, a major railway connection in the Alps between Switzerland and Italy. The key to deal with the complexity of this scenario is the use of a novel aggregation-disaggregation method. Starting from a detailed microscopic representation as it is used in railway simulation, the data is transformed by an automatic procedure into a less detailed macroscopic representation, that is sufficient for the purpose of capacity planning and amenable to state-of-the-art integer programming optimization methods. This macroscopic railway network is saturated with trains. Finally, the optimized timetable is re-transformed to the microscopic level in such a way that it can be operated without any conflicts among the train paths. Using this micro-macro aggregation-disaggregation approach in combination with integer programming methods, it becomes for the first time possible to generate a profit maximal and conflict free timetable for the complete Simplon corridor over an entire day by a simultaneous optimization of all trains requests. In addition, this also allows us to undertake a sensitivity analysis of various problem parameters.
引用
收藏
页码:93 / 106
页数:14
相关论文
共 26 条
[1]   A column-generation approach to line planning in public transport [J].
Borndoerfer, Ralf ;
Groetschel, Martin ;
Pfetsch, Marc E. .
TRANSPORTATION SCIENCE, 2007, 41 (01) :123-132
[2]  
Borndorfer R, 2009, P 3 INT SEM RAILW OP
[3]  
Borndorfer R., 2006, COMPETITION REGULATI, V1, P163
[4]  
BORNDORFER R, 2007, ATMOS 2007
[5]   Railway timetabling using Lagrangian relaxation [J].
Brannlund, U ;
Lindberg, PO ;
Nou, A ;
Nilsson, JE .
TRANSPORTATION SCIENCE, 1998, 32 (04) :358-369
[6]  
Cacchiani V., 2007, THESIS DEIS BOLOGNA
[7]   A column generation approach to train timetabling on a corridor [J].
Cacchiani, Valentina ;
Caprara, Alberto ;
Toth, Paolo .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2008, 6 (02) :125-142
[8]   A FAST HEURISTIC FOR THE TRAIN SCHEDULING PROBLEM [J].
CAI, X ;
GOH, CJ .
COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (05) :499-510
[9]  
Caimi G., 2004, FINDING DELAY TOLERA, P136
[10]  
Caimi G., 2009, THESIS ETH ZURICH