On solving multi-type railway line planning problems

被引:118
作者
Goossens, JW
van Hoesel, S
Kroon, L
机构
[1] Univ Maastricht, Dept Quantitat Econ, NL-6200 MD Maastricht, Netherlands
[2] Erasmus Univ, Rotterdam Sch Management, NL-3000 DR Rotterdam, Netherlands
关键词
integer programming; combinatorial optimisation; railway transportation;
D O I
10.1016/j.ejor.2004.04.036
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
An important strategic element in the planning process of a railway operator is the development of a line plan, i.e., a set of routes (paths) on the network of tracks, operated at a given hourly frequency. The models described in the literature have thus far considered only lines that halt at all stations along their route. In this paper we introduce several models for solving line planning problems in which lines can have different halting patterns. Correctness and equivalence proofs for these models are given, as well as an evaluation using several real-life instances. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:403 / 424
页数:22
相关论文
共 16 条
[1]  
ALFIERI A, 2002, ERS2002110LIS ERIM E
[2]  
[Anonymous], 1998, THESIS TU BRAUNSCHWE
[3]  
[Anonymous], THESIS TU BRAUNSCHWE
[4]   Algorithms for railway crew management [J].
Caprara, A ;
Fischetti, M ;
Toth, P ;
Vigo, D ;
Guida, PL .
MATHEMATICAL PROGRAMMING, 1997, 79 (1-3) :125-141
[5]   Cost optimal allocation of rail passenger lines [J].
Claessens, MT ;
van Dijk, NM ;
Zwaneveld, PJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 110 (03) :474-489
[6]  
FRELING R, IN PRESS TRANSPORTAT
[7]   Dispatching buses in parking depots [J].
Gallo, G ;
Di Miele, F .
TRANSPORTATION SCIENCE, 2001, 35 (03) :322-330
[8]  
GOOSSENS JHM, IN PRESS TRANSPORTAT
[9]  
KROON LG, 2001, LECT NOTES EC MATH S, V505
[10]  
NACHTIGALL K, 1999, THESIS BRAUNSCHWEIG