ABSOLUTE CAPACITY DETERMINATION AND TIMETABLING IN RAILWAYS

To determine with certainty the capacity of a railway line or network a train timetabling problem should be solved. However due to the size and complexity of this timetabling problem, simpler approximations and simulations are more often used in practice. Absolute capacity on the other hand may be more simply obtained by ignoring the possibility of collision conflicts, which are manifested as interference delays and occur as a result of insufficient passing facilities. This is achieved by allowing trains to pass through one another on non-critical sections in the timetable. Under this assumption, the full timetabling problem may be considerably reduced. In this paper details of a timetabling approach are presented and the calculation of important parameters required in the approach. Mathematical models for solving both the full and reduced timetabling problem are then developed. Alternative heuristics however are also proposed and extended because the reduced problem is still of considerable size and complexity.

[1]  Te-Wei Chiang,et al.  Knowledge-Based System for Railway Scheduling , 1998, Data Knowl. Eng..

[2]  Alain Billionnet,et al.  Using Integer Programming to Solve the Train-Platforming Problem , 2003, Transp. Sci..

[3]  Malachy Carey,et al.  A model and strategy for train pathing with choice of lines, platforms, and routes , 1994 .

[4]  X. Cai,et al.  A fast heuristic for the train scheduling problem , 1994, Comput. Oper. Res..

[5]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[6]  M. J Dorfman,et al.  Scheduling trains on a railway network using a discrete event model of railway traffic , 2004 .

[7]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[8]  Zhihui Xue,et al.  Review of Scheduling computer and manufacturing processes by Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Guenter Schmidt, Jan Weglarz Springer-Verlag 2001 , 2003 .

[9]  Leo G. Kroon,et al.  A Variable Trip Time Model for Cyclic Railway Timetabling , 2003, Transp. Sci..

[10]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective , 2003 .

[11]  Leo G. Kroon,et al.  Routing Trains Through Railway Stations: Model Formulation and Algorithms , 1996, Transp. Sci..

[12]  Per Olov Lindberg,et al.  Railway Timetabling Using Lagrangian Relaxation , 1998, Transp. Sci..

[13]  Erhan Kozan,et al.  Job scheduling with technical constraints , 2004, J. Oper. Res. Soc..

[14]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[15]  S. Gibson,et al.  Allocation of capacity in the rail industry , 2003 .

[16]  Leo G. Kroon,et al.  Routing trains through a railway station based on a node packing model , 2001, Eur. J. Oper. Res..

[17]  C.K. Wong,et al.  Two simulated annealing-based heuristics for the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[18]  Leo G. Kroon,et al.  Decision Support Systems Support the Search for Win-Win Solutions in Railway Network Design , 1999, Interfaces.

[19]  Malachy Carey,et al.  Extending a train pathing model from one-way to two-way track , 1994 .

[20]  Erhan Kozan,et al.  Heuristic Techniques for Single Line Train Scheduling , 1997, J. Heuristics.

[21]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[22]  Malachy Carey,et al.  Scheduling and Platforming Trains at Busy Complex Stations , 2003 .

[23]  Malachy Carey,et al.  A Model, Algorithms and Strategy for Train Pathing , 1995 .

[24]  Ismail Sahin,et al.  Railway traffic control and train scheduling based oninter-train conflict management , 1999 .

[25]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

[26]  Inder Khosla.  The scheduling problem where multiple machines compete for a common local buffer , 1995 .

[27]  Michel Gendreau,et al.  A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 1996 .

[28]  Leo Kroon,et al.  Routing trains through railway stations: complexity issues , 1997 .

[29]  Michiel A. Odijk,et al.  A CONSTRAINT GENERATION ALGORITHM FOR THE CONSTRUCTION OF PERIODIC RAILWAY TIMETABLES , 1996 .

[30]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[31]  Erhan Kozan,et al.  Optimal scheduling of trains on a single line track , 1996 .

[32]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[33]  Xiaoqiang Cai,et al.  Greedy heuristics for rapid scheduling of trains on a single track , 1998 .

[34]  Richard L. Daniels,et al.  Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment , 1999, Comput. Oper. Res..

[35]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[36]  Hayriye Ayhan,et al.  A probabilistic (max, +) approach for determining railway infrastructure capacity , 2003, Eur. J. Oper. Res..

[37]  Luis Ferreira.  Rail track infrastructure ownership: investment and operational issues , 1997 .