Optimisation of train schedules to achieve minimum transit times and maximum reliability

The overall timetable reliability is a measure of the likely performance of the timetable as a whole, in terms of schedule adherence. The concept is a critical performance measure for both urban and non-urban rail passenger services, as well as rail freight transportation. This paper deals with the scheduling of trains on single track corridors, so as to minimise train trip times and maximise reliability of train arrival times. A method used to quantify the amount of risk of delay associated with each train, each track segment, and the schedule as a whole, is used as the reliability component of the constrained optimisation model. The methodology used to estimate the risk of delay is put forward. The paper also describes a number of alternative solution techniques for the scheduling problem. These techniques include exact optimal solutions using branch and bound, and heuristic approaches, such as genetic algorithms, nearest neighbourhood heuristic and tabu search. Some of the results of using these alternative approaches are briefly described. The schedule produced using risk of delay in the objective function, will be the most efficient in terms of delay due to train conflicts and delay that may occur due to unexpected events. The model and solution techniques are applied to the problem of determining improved positions of sidings on a single track corridor, with respect to a given schedule.

[1]  Malachy Carey,et al.  Stochastic approximation to the effects of headways on knock-on delays of trains , 1994 .

[2]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[3]  Erhan Kozan,et al.  Modelling delay risks associated with a train schedule , 1995 .

[4]  Seok-Woo Hong,et al.  TWO MOMENTS ESTIMATION OF THE DELAY ON A PARTIALLY DOUBLE-TRACK RAIL LINE WITH SCHEDULED TRAFFIC , 1990 .

[5]  Patrick T. Harker,et al.  Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution , 1991, Oper. Res..

[6]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[7]  E. R. Petersen Over-the-Road Transit Time for a Single Track Railway , 1974 .

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

[9]  Erhan Kozan,et al.  MODELING SINGLE-LINE TRAIN OPERATIONS , 1995 .

[10]  E R Kraft A BRANCH AND BOUND PROCEDURE FOR OPTIMAL TRAIN DISPATCHING , 1987 .

[11]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

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

[13]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  B Szpigel,et al.  OPTIMAL TRAIN SCHEDULING ON A SINGLE LINE RAILWAY , 1973 .

[16]  Patrick T. Harker,et al.  Improving railroad on-time performance: models, algorithms and applications , 1989 .

[17]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[18]  Mills R.G.J. DYNAMIC RESCHEDULING OF LONG-HAUL TRAINS FOR IMPROVED TIMEKEEPING AND ENERGY CONSERVATION , 1991 .