A disjunctive graph model and framework for constructing new train schedules

Train scheduling is a complex and time consuming task of vital importance in many countries. To create completely new train schedules that are more accurate and efficient than permitted by current techniques, a novel "hybrid" job shop approach is proposed and implemented in this paper. Unique characteristics of train scheduling are firstly incorporated into a disjunctive graph representation of the solution. Dedicated "stand-alone" constructive algorithms that utilise this representation are then developed. The modelling approach and the constructive algorithms are essential as they provide the basis for which meta-heuristics and other iterative refinement algorithms can be applied. A numerical investigation and case study is provided and demonstrates the viability of the modelling approach. Furthermore it is demonstrated that good quality solutions are provided with reasonable computational effort.

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

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

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

[4]  Erhan Kozan,et al.  Techniques for absolute capacity determination in railways , 2006 .

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

[6]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

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

[8]  Frank Werner,et al.  Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..

[9]  Erhan Kozan,et al.  ABSOLUTE CAPACITY DETERMINATION AND TIMETABLING IN RAILWAYS , 2004 .

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

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

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

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

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

[15]  Robert L. Burdett,et al.  A railway capacity determination model and rail access charging methodologies , 2005 .

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

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

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

[19]  Belarmino Adenso-Díaz,et al.  On-line timetable re-scheduling in regional train services , 1999 .

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

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

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

[23]  Tamás Kis,et al.  Job-shop scheduling with processing alternatives , 2003, Eur. J. Oper. Res..

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

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

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

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

[28]  Ferenc Szidarovszky,et al.  A multi-objective train scheduling model and solution , 2004 .

[29]  Nidhal Rezg,et al.  A taboo search approach for deadlock-free scheduling of automated manufacturing systems , 2001, J. Intell. Manuf..

[30]  Ming Zhong,et al.  Bicriteria train scheduling for high-speed passenger railroad planning applications , 2005, Eur. J. Oper. Res..

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

[32]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

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

[34]  J. Wesley Barnes,et al.  Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches , 2005, Eur. J. Oper. Res..

[35]  Bostjan Murovec,et al.  A repairing technique for the local search of the job-shop problem , 2004, Eur. J. Oper. Res..