Scheduling Freight Trains in Rail-Rail Transshipment Yards

被引:48
作者
Boysen, Nils [1 ]
Jaehn, Florian [2 ]
Pesch, Erwin [2 ]
机构
[1] Univ Jena, Lehrstuhl Allgemeine Betriebswirtschaftslehre Ope, D-07743 Jena, Germany
[2] Univ Siegen, Inst Wirtschaftsinformat, D-57068 Siegen, Germany
关键词
railway systems; transshipment yard; train scheduling; dynamic programming; beam search; BEAM SEARCH; TRANSPORT; OPTIMIZATION; GENERATION; ALGORITHMS; EXCHANGE; MODELS; TRAMS;
D O I
10.1287/trsc.1100.0365
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Transshipment yards, where gantry cranes enable the efficient transfer of containers between freight trains, are important entities in modern railway systems. They facilitate a general shift from point-to-point transport to hub-and-spoke railway systems, a shift being driven by concerted efforts within the European Union (EU) to transfer goods traffic from road to rail. Modern rail-rail transshipment yards accelerate container handling so that multiple smaller trains, with identical destinations, can be consolidated onto a reduced number of trains. An important problem attendant upon the daily operations of a transshipment yard is the train-scheduling problem, which involves determining the processing order of trains at parallel railway tracks. The present paper investigates this problem, with a special focus on resolving deadlocks and avoiding multiple crane picks per container move. A mathematical program along with a complexity proof is provided, and two different procedures are described: exact (dynamic programming) and heuristic (beam search).
引用
收藏
页码:199 / 211
页数:13
相关论文
共 32 条
[1]   Modeling and optimization of the intermodal terminal Mega Hub [J].
Alicke K. .
OR Spectrum, 2002, 24 (1) :1-17
[2]  
Alicke K, 1998, FORDERN HEBEN, V8, P769
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[4]   Global energy scenarios meeting stringent CO2 constraints -: cost-effective fuel choices in the transportation sector [J].
Azar, C ;
Lindgren, K ;
Andersson, BA .
ENERGY POLICY, 2003, 31 (10) :961-976
[5]   Comparative evaluation of existing and innovative rail-road freight transport terminals [J].
Ballis, A ;
Golias, J .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2002, 36 (07) :593-611
[6]  
Blasum U, 1999, MATH METHOD OPER RES, V49, P137
[7]   Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling [J].
Blum, C .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) :1565-1591
[8]   Is a new applied transportation research field emerging? - A review of intermodal rail-truck freight transport literature [J].
Bontekoning, YM ;
Macharis, C ;
Trip, JJ .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2004, 38 (01) :1-34
[9]   Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard [J].
Bostel, N ;
Dejax, P .
TRANSPORTATION SCIENCE, 1998, 32 (04) :370-379
[10]   Sequencing mixed-model assembly lines to minimize part inventory cost [J].
Boysen, Nils ;
Fliedner, Malte ;
Scholl, Armin .
OR SPECTRUM, 2008, 30 (03) :611-633