Cost optimal allocation of rail passenger lines

被引:158
作者
Claessens, MT
van Dijk, NM
Zwaneveld, PJ
机构
[1] TNO, INRO, NL-2600 JA Delft, Netherlands
[2] Erasmus Univ, Rotterdam, Netherlands
[3] Netherlands Railways Travelers, NL-3500 HA Utrecht, Netherlands
[4] Univ Amsterdam, NL-1018 WB Amsterdam, Netherlands
关键词
branch and bound; integer programming; optimization; timetabling;
D O I
10.1016/S0377-2217(97)00271-3
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of cost optimal railway line allocation for passenger trains for the Dutch railway system. At present, the allocation of passenger lines by Dutch Railways is based on maximizing the number of direct travelers. This paper develops an alternative approach that takes operating costs into account. A mathematical programming model is developed which minimizes the operating costs subject to service constraints and capacity requirements. The model optimizes on lines, line types, routes, frequencies and train lengths. First, the line allocation model is formulated as an integer nonlinear programming model. This model is transformed into an integer linear programming model with binary decision variables. An algorithm is presented which solves the problem to optimality. The algorithm is based upon constraint satisfaction and a Branch and Bound procedure. The algorithm is applied to a subnetwork of the Dutch railway system for which it shows a substantial cost reduction. Further application and extension seem promising. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:474 / 489
页数:16
相关论文
共 17 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]  
[Anonymous], THESIS TU BRAUNSCHWE
[3]  
[Anonymous], THESIS TU BRAUNSCHWE
[4]  
BEALE EML, P 5 INT C OP RES TAV, P447
[5]  
BOUMA A, 1994, LINIENPLANUNG SIMULA, P369
[6]  
Brooke A., 1992, GAMS A User's Guide. Release 2.25
[7]   Optimal lines for railway systems [J].
Bussieck, MR ;
Kreuzer, P ;
Zimmermann, UT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (01) :54-63
[8]  
CLAESSENS MT, 1994, THESIS U AMSTERDAM
[9]  
*CPLEX OPT INC, 1994, US CPLEX CALL LIBR V
[10]   SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS [J].
CROWDER, H ;
JOHNSON, EL ;
PADBERG, M .
OPERATIONS RESEARCH, 1983, 31 (05) :803-834