Routing trains through railway stations: complexity issues

textabstractIn this paper we consider the problem of routing trains through railway stations. This problem occurs as a subproblem in the project DONS that is currently being carried out under the supervision of Railned and Netherlands Railways. The project DONS involves the determination of the required future capacity of the Dutch railway infrastructure. In this paper we focus on the computational complexity of the problem of routing trains through railway stations. After an extensive description of the problem, we show that only a subset of the sections and routes of a railway station needs to be taken into account. Then we show that the routing problem is NP-complete as soon as each train has three routing possibilities. However, if each train has only two routing possibilities, then the problem can be solved in an amount of time that is polynomial in the number of trains. Furthermore, if the layout of the railway station is fixed, then the latter is also the case for the problem of finding an assignment of a maximum number of trains to routes that is feasible from a safety point of view. This result can be extended to the case where coupling and uncoupling of trains, certain service considerations, and a cyclic timetable have to be taken into account.

[1]  A.W.J. Kolen,et al.  License class design: complexity and algorithms , 1992 .

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

[3]  Helman Stern,et al.  Minimal Resources for Fixed and Variable Job Schedules , 1978, Oper. Res..

[4]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[5]  Joseph Y.-T. Leung,et al.  An Optimal Solution for the Channel-Assignment Problem , 1979, IEEE Transactions on Computers.

[6]  Antoon W.J. Kolen,et al.  An analysis of shift class design problems , 1994 .

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

[8]  Hamilton Emmons,et al.  Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times , 1993 .

[9]  Barry O'Neill,et al.  Games of Boldness, Where the Player Performing the Hardest Task Wins , 1992, Oper. Res..

[10]  Ulrich Derigs,et al.  Operations Research Proceedings 1995 , 1996 .

[11]  Hamilton Emmons,et al.  Fixed Job Scheduling with Two Types of Processors , 1992, Oper. Res..

[12]  L. G. Kroon,et al.  On the computational complexity of (maximum) shift class scheduling , 1991 .

[13]  Matteo Fischetti,et al.  The Fixed Job Schedule Problem with Working-Time Constraints , 1989, Oper. Res..

[14]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[15]  Matteo Fischetti,et al.  The Fixed Job Schedule Problem with Spread-Time Constraints , 1987, Oper. Res..

[16]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[17]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[18]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[19]  Leo Kroon,et al.  Routing trains through railway stations including shunting decisions , 1996 .

[20]  Matteo Fischetti,et al.  Approximation Algorithms for Fixed Job Schedule Problems , 1992, Oper. Res..

[21]  Leo Kroon,et al.  On the computational complexity of (maximum) class scheduling , 1991 .

[22]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[23]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..